TY - GEN
T1 - Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms
AU - Ma, Tao
AU - Shrestha, Pradhumna
AU - Hempel, Michael
AU - Peng, Dongming
AU - Sharif, Hamid
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Image coding
KW - embedded communication system
KW - quad-tree search model
UR - http://www.scopus.com/inward/record.url?scp=84856255602&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856255602&partnerID=8YFLogxK
U2 - 10.1109/ICIP.2011.6116287
DO - 10.1109/ICIP.2011.6116287
M3 - Conference contribution
AN - SCOPUS:84856255602
SN - 9781457713033
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 297
EP - 300
BT - ICIP 2011
T2 - 2011 18th IEEE International Conference on Image Processing, ICIP 2011
Y2 - 11 September 2011 through 14 September 2011
ER -