Memory constrained wavelet based image coding

We present a method for ordering the wavelet coefficient information in a compressed bitstream that allows an image to be sequentially decoded, with lower memory requirements than conventional wavelet decompression schemes. We also introduce a hybrid filtering scheme that uses different horizontal and vertical filters, each with different depths of wavelet decomposition. This reduces decoder memory requirements by reducing the instantaneous number of wavelet coefficients needed for inverse filtering.

[1]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..

[2]  Chia-Yuan Teng,et al.  Quadtree-guided wavelet image coding , 1996, Proceedings of Data Compression Conference - DCC '96.

[3]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[4]  Antonio Ortega,et al.  Line based reduced memory, wavelet image compression , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[5]  Pamela C. Cosman,et al.  Image compression for memory constrained printers , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[6]  A. Said,et al.  Manuscript Submitted to the Ieee Transactions on Circuits and Systems for Video Technology a New Fast and Eecient Image Codec Based on Set Partitioning in Hierarchical Trees , 2007 .