LLEC: An Image Coder with Low-Complexity and Low-Memory Requirement

  • Debin Zhao
  • Wen Gao
  • Shiguang Shan
  • Y. K. Chan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2195)


A Low-complexity and Low-memory Entropy Coder (LLEC) for image compression is proposed in this paper. The two key elements in LLEC are zerotree coding and Golomb-Rice codes. Zerotree coding exploits the zerotree structure of transformed coefficients for higher compression efficiency. Golomb-Rice codes are used to code the remaining coefficients in a VLC/VLI manner for low complexity and low memory. The experimental results show that the compression efficiency of DCT- and DWT-based LLEC outperforms baseline JPEG and EZW at the given bit rates, respectively. When compared with SPIHT, LLEC is inferior by 0.3 dB on average for the tested images but superior in terms of computational complexity and memory requirement. In addition LLEC has other desirable features such as parallel processing support, ROI (Region Of Interest) coding and as a universal entropy coder for DCT and DWT.


Discrete Cosine Transform Memory Requirement Discrete Cosine Transform Coefficient Quantization Step Arithmetic Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T. Tran and Q. Nguyen, “A Progressive transmission image coder using linear phase uniform filterbanks as block transform,” IEEE Trans. image Processing, vol. 8, no. 11, pp. 1493–1507, 1999.CrossRefGoogle Scholar
  2. 2.
    W. Pennebaker and J. Mitchell, JPEG Still Image Data Compression Standard. New York: 1993.Google Scholar
  3. 3.
    “Coding of moving pictures and associated audio for digital storage media up to about 1.5 Mbit/s,” Tech. Rep., ISO/IEC IS 11172(MPEG-1), 1993.Google Scholar
  4. 4.
    “Generic coding of moving pictures and associated audio,” Tech. Rep., ISO/IEC DIS 13818(MPEG-2), 1994.Google Scholar
  5. 5.
    L. Chiariglione, “MPEG and multimedia communications,” IEEE Trans. CSVT., vol. 7, no 1, pp. 5–18, 1997.Google Scholar
  6. 6.
    T. Sikora, “The MPEG-4 video standard verification model,” IEEE Trans. CSVT., vol. 7, no 1, pp. 19–31, 1997.Google Scholar
  7. 7.
    F. Pereira and T. Alpert, “MPEG-4 video subjective test procedures and results,” IEEE Trans. CSVT., vol. 7, no 1, pp. 32–51, 1997.Google Scholar
  8. 8.
    “Video codec for audiovisual services at p x 64 kb/s,” ITU-T Rec. H.261, 1990.Google Scholar
  9. 9.
    “Video coding for low bit rate communications,” ITU-T Draft Rec. H.263, Dec. 1995.Google Scholar
  10. 10.
    Z. Xiong, O. Guleryuz, and M. Orchard, “A DCT-based embedded image coder,” IEEE Signal Processing Letters, vol. 3, no. 11, pp. 289–290, 1996.CrossRefGoogle Scholar
  11. 11.
    Z. Xiong, K. Ramchandran, M. Orchard, and Y. Zhang, “A comparative study of DCT and wavelet-based image coding,” IEEE Trans. CSVT., vol. 9, no 5, pp. 692–695, 1999.Google Scholar
  12. 12.
    D. Zhao, W. Gao, and Y. K. Chan, “An embedded image coder based on hierarchical DCT,” Proc. Picture Coding Symposium, pp. 425–428, Portland, USA, 1999.Google Scholar
  13. 13.
    J. Shapiro, “Embedded image coding using zerotree of wavelet coefficients,” IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3445–3463, 1993.zbMATHCrossRefGoogle Scholar
  14. 14.
    A. Said and W. Pearlman, “A new, fast, and efficient image codec based on set partitioning in hierarchical trees,” IEEE Trans. CSV T., vol. 6, no 3, pp. 243–250, 1996.Google Scholar
  15. 15.
    A. Martucci, I. Sodagar, T. Chiang and Y. Zhang, “A zerotree wavelet video coder,” IEEE Trans. CSVT., vol. 7, no 1, pp. 109–118, 1997.Google Scholar
  16. 16.
    D. Taubman, “High performance scalable image compression with EBCOT,” IEEE Trans. Image Processing, vol. 9, No. 7, pp. 1158–1170, July 2000.CrossRefGoogle Scholar
  17. 17.
    N. Memon, “Adaptive coding of DCT coefficients by Golomb-Rice codes,” Proc. ICIP, vol. 1, pp.516–520, Chicago, Illinois, USA, 1998.Google Scholar
  18. 18.
    S. Golomb, “Run-length encodings,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 399–401, July 1966.CrossRefMathSciNetGoogle Scholar
  19. 19.
    R. Rice, “Some practical universal noiseless coding techniques—Part I-III,” Tech. Rep. JPL-79-22, JPL-83-17 and JPL-91-3, Mar. 1979, Mar. 1983, Nov. 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Debin Zhao
    • 1
  • Wen Gao
    • 1
    • 2
  • Shiguang Shan
    • 2
  • Y. K. Chan
    • 3
  1. 1.Department of Computer ScienceHarbin Institute of TechnologyHarbinChina
  2. 2.Institute of Computing TechnologyCASBeijingChina
  3. 3.Department of Computer ScienceCity University of Hong KongHong Kong

Personalised recommendations