DocumentCode
1660565
Title
Novel set partitioning algorithm in image coding
Author
Gan, Tao ; Zhu, Weile
Author_Institution
Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Volume
1
fYear
2005
Firstpage
538
Abstract
This paper provides an insight into the principle of set partitioning in image coding. The state-of-the-art SPIHT algorithm is questioned to be not optimum with its fixed set-partitioning way. To further explore the energy clustering nature of subband coefficients, the set with extended hierarchical zerotree or group of zerotrees is introduced to represent the actual zero blocks emerging in the partitioning process. Moreover, through simple yet effective prediction, the sets containing extended zerotrees with different shape and size are created, adapting to local distribution of wavelet coefficients of the image. With a similar procedure to SPIHT, a novel algorithm is proposed and tested. The simulation shows that the new algorithm can achieve better performance with lower memory requirement and negligible additional complexity in comparison with existing SPIHT.
Keywords
image coding; set theory; trees (mathematics); wavelet transforms; energy clustering; extended hierarchical zerotree; image coding; memory requirement; performance; set partitioning algorithm; subband coefficients; wavelet coefficients; Clustering algorithms; Computational complexity; Gallium nitride; Image coding; Iterative algorithms; Partitioning algorithms; Power engineering and energy; Tree data structures; Wavelet coefficients; Wavelet transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on
Print_ISBN
0-7803-9015-6
Type
conf
DOI
10.1109/ICCCAS.2005.1493466
Filename
1493466
Link To Document