Adaptive coding of DCT coefficients by Golomb-Rice codes

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this report 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 publicationHP Laboratories Technical Report
PublisherHwelett Packard Lab
Pages12
Number of pages1
Edition98-146
StatePublished - Aug 1998

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

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 HP Laboratories Technical Report (98-146 ed., pp. 12). Hwelett Packard Lab.