Efficient subtree splitting algorithm for wavelet-based fractal image coding
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 22_Publication in policy or professional journal
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 106-109 |
| Journal / Publication | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 4 |
| Publication status | Published - 1998 |
Conference
| Title | Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, ISCAS. Part 5 (of 6) |
|---|---|
| City | Monterey, CA, USA |
| Period | 31 May - 3 June 1998 |
Link(s)
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.
Citation Format(s)
Efficient subtree splitting algorithm for wavelet-based fractal image coding. / Po, L. M.; Zhang, Y.; Cheung, K. W. et al.
In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 4, 1998, p. 106-109.
In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 4, 1998, p. 106-109.
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 22_Publication in policy or professional journal
