Novel subtree partitioning 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) | 2677-2680 |
| Journal / Publication | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 5 |
| Publication status | Published - 1998 |
Conference
| Title | Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. Part 1 (of 6) |
|---|---|
| City | Seattler, WA, USA |
| Period | 12 - 15 May 1998 |
Link(s)
Abstract
In this paper, a novel wavelet subtree partitioning 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)
Novel subtree partitioning algorithm for wavelet-based fractal image coding. / Po, L. M.; Zhang, Y.; Cheung, K. W. et al.
In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, Vol. 5, 1998, p. 2677-2680.
In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, Vol. 5, 1998, p. 2677-2680.
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 22_Publication in policy or professional journal
