Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms

In this paper, we propose a fast, simple and efficient image codec applicable for embedded processing systems. Among the existing image coding methods, wavelet quad-tree is a foundation leading to an efficient structure to encode images. By searching significant coefficients along quadtrees, an embedded efficient code can be obtained. In this work, we exploit hierarchical relations of the quad-tree structure in terms of searching entropy and present a quadtree searching model that is very close to the searching entropy. By applying this model, our codec surpasses SPIHT [1] by 0.2–0.4 db over wide code rates, and its performance is comparable to SPIHT with arithmetic coding and JPEG2000 [2]. With no additional overhead of arithmetic coding, our code is much faster and simpler than SPIHT with adaptive arithmetic coding and the more complicated JPEG2000 algorithms. This is a critical factor sought in embedded processing in communication systems where energy consumption and speed are priority concerns. Our simulation results demonstrate that the proposed codec is about twice as fast with very low computational overheads and comparable coding performances than existing algorithms.

[1]  Touradj Ebrahimi,et al.  A study of JPEG 2000 still image coding versus other standards , 2000, 2000 10th European Signal Processing Conference.

[2]  Paul Dan Cristea,et al.  Wavelet image compression - the quadtree coding approach , 1999, IEEE Transactions on Information Technology in Biomedicine.

[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]  Jianxiong Wang,et al.  Study of the Image Compression Based on SPIHT Algorithm , 2010, 2010 International Conference on Intelligent Computing and Cognitive Informatics.

[5]  William A. Pearlman,et al.  Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-$k$ Zerotree , 2007, IEEE Transactions on Signal Processing.

[6]  Xianbin Wang,et al.  A Time Slicing Adaptive OFDM System for Mobile Multimedia Communications , 2010, IEEE Transactions on Broadcasting.

[7]  William A. Pearlman,et al.  Efficient, low-complexity image coding with a set-partitioning embedded block coder , 2004, IEEE Transactions on Circuits and Systems for Video Technology.

[8]  Rabab Kreidieh Ward,et al.  JasPer: a portable flexible open-source software tool kit for image coding/processing , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[9]  Yuh-Ren Tsai,et al.  Kasami Code-Shift-Keying Modulation for Ultra-Wideband Communication Systems , 2007, IEEE Transactions on Communications.

[10]  N. Ranganathan,et al.  Performance analysis of wavelets in embedded zerotree-based lossless image coding schemes , 1999, IEEE Trans. Signal Process..

[11]  William A. Pearlman,et al.  Quantifying the coding power of zerotrees of wavelet coefficients: a degree-k zerotree model , 2005, IEEE International Conference on Image Processing 2005.

[12]  Guangjie Han,et al.  Multi-priority Multi-path Selection for Video Streaming in Wireless Multimedia Sensor Networks , 2008, UIC.