Bit-plane paralleled image coding algorithm based on run-length coding of first 1 bit

2015 ◽  
Vol 23 (3) ◽  
pp. 864-870
Author(s):  
徐勇 XU Yong
Keyword(s):  
Image Coding ◽  
Run Length ◽  
Run Length Coding ◽  
Bit Plane

scholarly journals Аdaptive combined image coding with prediction of arithmetic code volume

Doklady BGUIR ◽  
2021 ◽  
Vol 19 (2) ◽  
pp. 31-39
Author(s):  
B J.S Sadiq ◽  
V. Yu. Tsviatkou ◽  
М. N. Bobov
Keyword(s):  
Computational Complexity ◽  
Image Coding ◽  
Arithmetic Coding ◽  
Compact Representation ◽  
Arithmetic Code ◽  
Run Length ◽  
Differential Pulse Code Modulation ◽  
Run Length Coding ◽  
Bit Plane ◽  
Bit Planes

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.

Wavelet transform based adaptive bit-plane run-length coding for still images

1994 ◽  
Vol 30 (5) ◽  
pp. 395-396 ◽  
Author(s):  
K.H. Goh ◽  
T.S. Durrani ◽  
J.J. Soraghan
Keyword(s):  
Wavelet Transform ◽  
Still Images ◽  
Run Length ◽  
Run Length Coding ◽  
Bit Plane

Arbitrary shaped ROI image coding using Run-length coding and generalized Exp-Golomb coding

2011 ◽  
Vol 19 (1) ◽  
pp. 175-182
Author(s):  
徐勇 XU Yong ◽  
徐智勇 XU Zhi-yong ◽  
张启衡 ZHANG Qi-heng
Keyword(s):  
Image Coding ◽  
Run Length ◽  
Run Length Coding

Context conditioning and run-length coding for hybrid, embedded progressive image coding

2001 ◽  
Vol 10 (12) ◽  
pp. 1791-1800 ◽  
Author(s):  
W. Berghom ◽  
T. Boskamp ◽  
M. Lang ◽  
H.O. Peitgen
Keyword(s):  
Image Coding ◽  
Context Conditioning ◽  
Run Length ◽  
Run Length Coding
Sign in / Sign up

Export Citation Format

Share Document