DocumentCode
1743983
Title
Stack X-tree image coding
Author
Canhui Cai ; Tian-Hu Yu ; Mitra, Sanjit K. ; Runtao Ding
Author_Institution
Dept. of Comput. Sci., Huaqiao Univ., Quanzhou, China
fYear
2000
fDate
2000
Firstpage
727
Lastpage
730
Abstract
This paper proposes a new image coding scheme, called the stack X-tree coding. It replaces the zero run in the stack-run coding by the X-tree. An X-tree is defined as a spatial hierarchical tree without significant descendants. By taking advantage of the inter-band dependencies, the X-tree can express more efficiently insignificant coefficients in a wavelet image than the zero run. Experimental results have shown that the performance of the proposed algorithm is better than that of the stack-run, and is highly competitive with that of SPIHT
Keywords
image coding; trees (mathematics); wavelet transforms; stack X-tree image coding algorithm; wavelet coefficients; Bit rate; Computer science; Data structures; Discrete cosine transforms; Frequency domain analysis; Image coding; Partitioning algorithms; Quantization; Wavelet coefficients; Wavelet domain;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2000. IEEE APCCAS 2000. The 2000 IEEE Asia-Pacific Conference on
Conference_Location
Tianjin
Print_ISBN
0-7803-6253-5
Type
conf
DOI
10.1109/APCCAS.2000.913623
Filename
913623
Link To Document