Successive bit-plane rate allocation technique for JPEG2000 image coding

Author(s):  
Y.M. Yeung ◽  
O.C. An ◽  
A. Chang
2007 ◽  
Vol 16 (3) ◽  
pp. 673-683 ◽  
Author(s):  
Tammam Tillo ◽  
Marco Grangetto ◽  
Gabriella Olmo

Doklady BGUIR ◽  
2021 ◽  
Vol 19 (2) ◽  
pp. 31-39
Author(s):  
B J.S Sadiq ◽  
V. Yu. Tsviatkou ◽  
М. N. Bobov

The problem of increasing the efficiency of coding of halftone images in the space of bit planes of differences in pixel values obtained using differential coding (DPCM – Differential pulse-code modulation) is considered. For a compact representation of DPCM pixel values, it is proposed to use a combined compression encoder that implements arithmetic coding and run-length coding. An arithmetic encoder provides high compression ratios, but has high computational complexity and significant encoding overhead. This makes it effective primarily for compressing the mean-value bit-planes of DPCM pixel values. Run-length coding is extremely simple and outperforms arithmetic coding in compressing long sequences of repetitive symbols that often occur in the upper bit planes of DPCM pixel values. For DPCM bit planes of pixel values of any image, a combination of simple run length coders and complex arithmetic coders can be selected that provides the maximum compression ratio for each bit plane and all planes in general with the least computational complexity. As a result, each image has its own effective combined encoder structure, which depends on the distribution of bits in the bit planes of the DPCM pixel values. To adapt the structure of the combined encoder to the distribution of bits in the bit planes of DPCM pixel values, the article proposes to use prediction of the volume of arithmetic code based on entropy and comparison of the obtained predicted value with the volume of run length code. The entropy is calculated based on the values of the number of repetitions of ones and zero symbols, which are obtained as intermediate results of the run length encoding. This does not require additional computational costs. It was found that in comparison with the adaptation of the combined encoder structure using direct determination of the arithmetic code volume of each bit plane of DPCM pixel values, the proposed encoder structure provides a significant reduction in computational complexity while maintaining high image compression ratios.


2004 ◽  
Vol 40 (17) ◽  
pp. 1056 ◽  
Author(s):  
T.T. Lu ◽  
P.C. Chang

Sign in / Sign up

Export Citation Format

Share Document