Redesigning of JPEG statistical model in the lossy mode fitting distribution of DCT coefficients

Kuroki, Y.; Ueshige, Yoshifumi; Ohta, Teiji

doi:10.1109/icip.2000.899583

Cited by 4 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Being based on a predictive scheme, the distribution model of the prediction errors of LAR codec may follow the Laplacian model [8], [9]. To find the best fitted probability distribution model, practical probability distributions of prediction errors have been observed in a previous work [4].…”

Section: Characterization Of Prediction Errorsmentioning

confidence: 99%

Quality constraint and rate-distortion optimization for predictive image coders

2013

View full text Add to dashboard Cite

International audienceNext generations of image and video coding methods should of course be efficient in terms of compression, but also propose advanced functionalities. Among these functionalities such as scalability, lossy and lossless coding, data protection, Rate Distortion Optimization (RDO) and Rate Control (RC) are key issues. RDO aims at optimizing compression performances, while RC mechanism enables to exactly compress at a given rate. A less common functionality than RC, but certainly more helpful, is Quality Control (QC): the constraint is here given by the quality. In this paper, we introduce a joint solution for RDO and QC applied to a still image codec called Locally Adaptive Resolution (LAR), providing scalability both in resolution and SNR and based on a multi-resolution structure. The technique does not require any additional encoding pass. It relies on a modeling and estimation of the prediction errors obtained in an early work. First, quality constraint is applied and propagated through the whole resolution levels called pyramid. Then, the quantization parameters are deduced considering inter and intra pyramid level relationships. Results show that performances of the proposed method are very close to an exhaustive search solution

show abstract

Section: Characterization Of Prediction Errorsmentioning

confidence: 99%

Quality constraint and rate-distortion optimization for predictive image coders

2013

View full text Add to dashboard Cite

show abstract

Improving DC Coding Models of JPEG Arithmetic Coder

Lakhani

2004

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

Modifying JPEG Binary Arithmetic Codec for Exploiting Inter/Intra-Block and DCT Coefficient Sign Redundancies

Lakhani

2013

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

This article presents four modifications to the JPEG arithmetic coding (JAC) algorithm, a topic not studied well before. It then compares the compression performance of the modified JPEG with JPEG XR, the latest block-based image coding standard. We first show that the bulk of inter/intra-block redundancy, caused due to the use of the block-based approach by JPEG, can be captured by applying efficient prediction coding. We propose the following modifications to JAC to take advantages of our prediction approach. 1) We code a totally different DC difference. 2) JAC tests a DCT coefficient by considering its bits in the increasing order of significance for coding the most significant bit position. It causes plenty of redundancy because JAC always begins with the zeroth bit. We modify this coding order and propose alternations to the JPEG coding procedures. 3) We predict the sign of significant DCT coefficients, a problem is not addressed from the perspective of the JPEG decoder before. 4) We reduce the number of binary tests that JAC codes to mark end-of-block. We provide experimental results for two sets of eight-bit gray images. The first set consists of nine classical test images mostly of size 512 × 512 pixels. The second set consists of 13 images of size 2000 × 3000 pixels or more. Our modifications to JAC obtain extra-ordinary amount of code reduction without adding any kind of losses. More specifically, when we quantize the images using the default quantizers, our modifications reduce the total JAC code size of the images of these two sets by about 8.9 and 10.6%, and the JPEG Huffman code size by about 16.3 and 23.4%, respectively, on the average. Gains are even higher for coarsely quantized images. Finally, we compare the modified JAC with two settings of JPEG XR, one with no block overlapping and the other with the default transform (we denote them by JXR0 and JXR1, respectively). Our results show that for the finest quality rate image coding, the modified JAC compresses the large set images by about 5.8% more than JXR1 and by 6.7% more than JXR0, on the average. We provide some rate-distortion plots on lossy coding, which show that the modified JAC distinctly outperforms JXR0, but JXR1 beats us by about a similar margin.

show abstract

Redesigning of JPEG statistical model in the lossy mode fitting distribution of DCT coefficients

Cited by 4 publications

References 2 publications

Quality constraint and rate-distortion optimization for predictive image coders

Quality constraint and rate-distortion optimization for predictive image coders

Improving DC Coding Models of JPEG Arithmetic Coder

Modifying JPEG Binary Arithmetic Codec for Exploiting Inter/Intra-Block and DCT Coefficient Sign Redundancies

Contact Info

Product

Resources

About