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

Tao Ma, Pradhumna Shrestha, Michael Hempel, Dongming Peng, Hamid Sharif

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationICIP 2011
Subtitle of host publication2011 18th IEEE International Conference on Image Processing
Pages297-300
Number of pages4
DOIs
StatePublished - Dec 1 2011
Event2011 18th IEEE International Conference on Image Processing, ICIP 2011 - Brussels, Belgium
Duration: Sep 11 2011Sep 14 2011

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Other

Other2011 18th IEEE International Conference on Image Processing, ICIP 2011
CountryBelgium
CityBrussels
Period9/11/119/14/11

Fingerprint

Entropy
Processing
Image coding
Communication systems
Energy utilization

Keywords

  • Image coding
  • embedded communication system
  • quad-tree search model

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

Ma, T., Shrestha, P., Hempel, M., Peng, D., & Sharif, H. (2011). Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms. In ICIP 2011: 2011 18th IEEE International Conference on Image Processing (pp. 297-300). [6116287] (Proceedings - International Conference on Image Processing, ICIP). https://doi.org/10.1109/ICIP.2011.6116287

Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms. / Ma, Tao; Shrestha, Pradhumna; Hempel, Michael; Peng, Dongming; Sharif, Hamid.

ICIP 2011: 2011 18th IEEE International Conference on Image Processing. 2011. p. 297-300 6116287 (Proceedings - International Conference on Image Processing, ICIP).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ma, T, Shrestha, P, Hempel, M, Peng, D & Sharif, H 2011, Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms. in ICIP 2011: 2011 18th IEEE International Conference on Image Processing., 6116287, Proceedings - International Conference on Image Processing, ICIP, pp. 297-300, 2011 18th IEEE International Conference on Image Processing, ICIP 2011, Brussels, Belgium, 9/11/11. https://doi.org/10.1109/ICIP.2011.6116287
Ma T, Shrestha P, Hempel M, Peng D, Sharif H. Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms. In ICIP 2011: 2011 18th IEEE International Conference on Image Processing. 2011. p. 297-300. 6116287. (Proceedings - International Conference on Image Processing, ICIP). https://doi.org/10.1109/ICIP.2011.6116287
Ma, Tao ; Shrestha, Pradhumna ; Hempel, Michael ; Peng, Dongming ; Sharif, Hamid. / Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms. ICIP 2011: 2011 18th IEEE International Conference on Image Processing. 2011. pp. 297-300 (Proceedings - International Conference on Image Processing, ICIP).
@inproceedings{3b0854a4dfe442a3805b421a53448024,
title = "Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms",
abstract = "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.",
keywords = "Image coding, embedded communication system, quad-tree search model",
author = "Tao Ma and Pradhumna Shrestha and Michael Hempel and Dongming Peng and Hamid Sharif",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ICIP.2011.6116287",
language = "English (US)",
isbn = "9781457713033",
series = "Proceedings - International Conference on Image Processing, ICIP",
pages = "297--300",
booktitle = "ICIP 2011",

}

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/12/1

Y1 - 2011/12/1

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

SN - 9781457713033

T3 - Proceedings - International Conference on Image Processing, ICIP

SP - 297

EP - 300

BT - ICIP 2011

ER -