Translator Disclaimer
13 November 2003 Geometric methods for wavelet-based image compression
Author Affiliations +
Natural images can be viewed as combinations of smooth regions, textures, and geometry. Wavelet-based image coders, such as the space-frequency quantization (SFQ) algorithm, provide reasonably efficient representations for smooth regions (using zerotrees, for example) and textures (using scalar quantization) but do not properly exploit the geometric regularity imposed on wavelet coefficients by features such as edges. In this paper, we develop a representation for wavelet coefficients in geometric regions based on the wedgelet dictionary, a collection of geometric atoms that construct piecewise-linear approximations to contours. Our wedgeprint representation implicitly models the coherency among geometric wavelet coefficients. We demonstrate that a simple compression algorithm combining wedgeprints with zerotrees and scalar quantization can achieve near-optimal rate-distortion performance D(R) ~ (log R)2/R2 for the class of piecewise-smooth images containing smooth C2 regions separated by smooth C2 discontinuities. Finally, we extend this simple algorithm and propose a complete compression framework for natural images using a rate-distortion criterion to balance the three representations. Our Wedgelet-SFQ (WSFQ) coder outperforms SFQ in terms of visual quality and mean-square error.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael B. Wakin, Justin K. Romberg, Hyeokho Choi, and Richard G. Baraniuk "Geometric methods for wavelet-based image compression", Proc. SPIE 5207, Wavelets: Applications in Signal and Image Processing X, (13 November 2003);


Back to Top