CAJ | 학술논문

针对基于链表实现的感兴趣区域编码算法占用存储资源较多的问题,提出了一种无链表的编码算法.在SPIHT(等级树集合分裂)编码过程中,采用标志位图表示系数和集合的重要件信息;优先编码感兴趣区域,利用队列缓存非感兴趣区域系数和集合信息;编码非感兴趣区域时,从队列中恢复编码所需的重要件信息.编码过程不需要提升感兴趣区域小波系数,能实现感兴趣区域重建质量的精确控制.仿真实验表明,该算法优于提升小波系数的感兴趣区域编码算法;当编码码率为1 bpp(比特/像素)时,其存储需求仅为链表实现的感兴趣区域分离编码算法的1/10.
침대기우련표실현적감흥취구역편마산법점용존저자원교다적문제,제출료일충무련표적편마산법.재SPIHT(등급수집합분렬)편마과정중,채용표지위도표시계수화집합적중요건신식;우선편마감흥취구역,이용대렬완존비감흥취구역계수화집합신식;편마비감흥취구역시,종대렬중회복편마소수적중요건신식.편마과정불수요제승감흥취구역소파계수,능실현감흥취구역중건질량적정학공제.방진실험표명,해산법우우제승소파계수적감흥취구역편마산법;당편마마솔위1 bpp(비특/상소)시,기존저수구부위련표실현적감흥취구역분리편마산법적1/10.
To reduce memory requirement of the ROI (region of interest) coding algorithm based on lists, a new ROI coding algorithm based on listless zero-tree was proposed. In the process of SPIHT (set partitioning in hierarchical trees), signed bit planes are used to record the significance information of coefficients and sets. The ROI is encoded first, and the significance information of NROI (non-region of interest) is recorded in queues, so that the NROI can be encoded with restored significance information from the queues. The simulation results show that the proposed algorithm can get better reconstructed quality than the coding algorithm based on scaling ROI coefficients. It can achieve accurate ROI coding without scaling up ROI coefficients, and needs only one-tenth of memory required by the ROI separate coding algorithm based on lists when the coding rate is 1 bpp (hits/ pixel).