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
Edition98-146
StatePublished - Aug 1998

Fingerprint

Image compression
Computational complexity
Hardware

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Memon, N. (1998). Adaptive coding of DCT coefficients by Golomb-Rice codes. In HP Laboratories Technical Report (98-146 ed.). Hwelett Packard Lab.

Adaptive coding of DCT coefficients by Golomb-Rice codes. / Memon, N.

HP Laboratories Technical Report. 98-146. ed. Hwelett Packard Lab, 1998.

Research output: Chapter in Book/Report/Conference proceedingChapter

Memon, N 1998, Adaptive coding of DCT coefficients by Golomb-Rice codes. in HP Laboratories Technical Report. 98-146 edn, Hwelett Packard Lab.
Memon N. Adaptive coding of DCT coefficients by Golomb-Rice codes. In HP Laboratories Technical Report. 98-146 ed. Hwelett Packard Lab. 1998
Memon, N. / Adaptive coding of DCT coefficients by Golomb-Rice codes. HP Laboratories Technical Report. 98-146. ed. Hwelett Packard Lab, 1998.
@inbook{db845a932b3c45f7a5237a7165522e82,
title = "Adaptive coding of DCT coefficients by Golomb-Rice codes",
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.",
author = "N. Memon",
year = "1998",
month = "8",
language = "English (US)",
booktitle = "HP Laboratories Technical Report",
publisher = "Hwelett Packard Lab",
edition = "98-146",

}

TY - CHAP

T1 - Adaptive coding of DCT coefficients by Golomb-Rice codes

AU - Memon, N.

PY - 1998/8

Y1 - 1998/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032142286&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032142286&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0032142286

BT - HP Laboratories Technical Report

PB - Hwelett Packard Lab

ER -