Binary-Tree SPIHT Coding for True Bidimensional Wavelet Decomposition

Author

Guo, Yingchun ; Yu, Ming ; Lin, Xiaojing ; Liang, Yanhong

Author_Institution

Sch. of Comput. Sci. & Software Eng., Hebei Univ. of Technol., Tianjin, China

fYear

2009

fDate

1-3 Nov. 2009

Firstpage

366

Lastpage

369

Abstract

The conventional image coding metrics based wavelet focus on separable wavelet decomposition, which are not fit for human visual system to extract natural images features, while true dimensional wavelet decomposition can deal with them. This paper studied construction of true bidimensional wavelet filter banks and analyzed similarity of decomposed subbands, furthermore, presented a kind of binary-tree coding by using wavelet trees organized by quad-tree SPIHT for reference. Experiments show that at low bitrates this coding scheme gives results superior to those of quad-tree SPIHT on famous 97 wavelet.

Keywords

binary codes; channel bank filters; feature extraction; image coding; tree codes; wavelet transforms; bidimensional wavelet filter banks; binary-tree SPIHT coding; human visual system; image coding metrics; image processing; natural images feature extraction; quad-tree SPIHT; true bidimensional wavelet decomposition; wavelet trees; Computer science; Filter bank; Frequency; Image coding; Intelligent networks; Intelligent systems; Software engineering; Voice mail; Wavelet analysis; Wavelet coefficients; binary Tree SPIHT Coding; image processing; quad-tree SPIHT coding; true bidimensional Wavelet;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Networks and Intelligent Systems, 2009. ICINIS '09. Second International Conference on

Conference_Location

Tianjin

Print_ISBN

978-1-4244-5557-7

Electronic_ISBN

978-0-7695-3852-5

Type

conf

DOI

10.1109/ICINIS.2009.100

Filename

5365754