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 language | English (US) |
|---|---|
| Title of host publication | IEEE International Conference on Image Processing |
| Publisher | IEEE Comp Soc |
| Pages | 516-520 |
| Number of pages | 5 |
| Volume | 1 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) - Chicago, IL, USA Duration: Oct 4 1998 → Oct 7 1998 |
Other
| Other | Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) |
|---|---|
| City | Chicago, IL, USA |
| Period | 10/4/98 → 10/7/98 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering