Adaptive coding of DCT coefficients by Golomb-Rice codes

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

Abstract

In this paper we apply some of the Golomb-Rice coding techniques that emerged in JPEG-LS, a new standard for lossless image compression, and apply them towards coding DCT coefficients in the lossy JPEG baseline algorithm. We show that this results in significant improvements in performance with limited impact on computational complexity. In fact, one significant reduction in complexity provided by the proposed techniques is the complete elimination of the Huffman tables in JPEG baseline which can be a bottleneck in hardware implementations. We give simulation results, comparing the performance of the proposed technique to JPEG baseline, JPEG baseline with optimal Huffman coding (two pass) and JPEG arithmetic.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Image Processing
PublisherIEEE Comp Soc
Pages516-520
Number of pages5
Volume1
StatePublished - 1998
EventProceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) - Chicago, IL, USA
Duration: Oct 4 1998Oct 7 1998

Other

OtherProceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3)
CityChicago, IL, USA
Period10/4/9810/7/98

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Adaptive coding of DCT coefficients by Golomb-Rice codes'. Together they form a unique fingerprint.

  • Cite this

    Memon, N. (1998). Adaptive coding of DCT coefficients by Golomb-Rice codes. In IEEE International Conference on Image Processing (Vol. 1, pp. 516-520). IEEE Comp Soc.