Adaptive coding of DCT coefficients by Golomb-Rice codes

N. Memon

    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

    Fingerprint

    Image compression
    Computational complexity
    Hardware

    ASJC Scopus subject areas

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

    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.

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

    IEEE International Conference on Image Processing. Vol. 1 IEEE Comp Soc, 1998. p. 516-520.

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

    Memon, N 1998, Adaptive coding of DCT coefficients by Golomb-Rice codes. in IEEE International Conference on Image Processing. vol. 1, IEEE Comp Soc, pp. 516-520, Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3), Chicago, IL, USA, 10/4/98.
    Memon N. Adaptive coding of DCT coefficients by Golomb-Rice codes. In IEEE International Conference on Image Processing. Vol. 1. IEEE Comp Soc. 1998. p. 516-520
    Memon, N. / Adaptive coding of DCT coefficients by Golomb-Rice codes. IEEE International Conference on Image Processing. Vol. 1 IEEE Comp Soc, 1998. pp. 516-520
    @inproceedings{677fca912b5440549fcac36c86633ebd,
    title = "Adaptive coding of DCT coefficients by Golomb-Rice codes",
    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.",
    author = "N. Memon",
    year = "1998",
    language = "English (US)",
    volume = "1",
    pages = "516--520",
    booktitle = "IEEE International Conference on Image Processing",
    publisher = "IEEE Comp Soc",

    }

    TY - GEN

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

    AU - Memon, N.

    PY - 1998

    Y1 - 1998

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

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

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

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

    M3 - Conference contribution

    VL - 1

    SP - 516

    EP - 520

    BT - IEEE International Conference on Image Processing

    PB - IEEE Comp Soc

    ER -