Efficient subtree splitting algorithm for wavelet-based fractal image coding

Author

Po, L.M. ; Zhang, Y. ; Cheung, K.W. ; Cheung, C.H.

Author_Institution

CityU Image Process. Lab., City Univ. of Hong Kong, Hong Kong

Volume

4

fYear

1998

fDate

31 May-3 Jun 1998

Firstpage

106

Abstract

In this paper, a novel wavelet subtree splitting algorithm is proposed, which divides a subtree into scalar quantized wavelet coefficients and fractal coded sub-subtree. Based on this new technique, a variable size wavelet subtree fractal coding scheme for still image compression is developed. Experimental results show that the new scheme can achieve nearly optimal partition of wavelet subtree with substantially computational reduction as compared with Davis´ scheme

Keywords

computational complexity; fractals; image coding; trees (mathematics); wavelet transforms; fractal coded sub-subtree; optimal partition; scalar quantized wavelet coefficients; still image compression; substantially computational reduction; subtree splitting algorithm; wavelet subtree splitting algorithm; wavelet-based fractal image coding; Data structures; Fractals; Frequency; Image coding; Image processing; Partitioning algorithms; Process planning; Spatial resolution; Wavelet coefficients; Wavelet domain;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on

Conference_Location

Monterey, CA

Print_ISBN

0-7803-4455-3

Type

conf

DOI

10.1109/ISCAS.1998.698769

Filename

698769