scholarly journals Does an Arithmetic Coding Followed by Run-length Coding Enhance the Compression Ratio?

2015 ◽  
Vol 10 (7) ◽  
pp. 736-741
Author(s):  
Mohammed A. Otair ◽  
Ahmad M. Odat
Keyword(s):  
Compression Ratio ◽  
Arithmetic Coding ◽  
Run Length ◽  
Run Length Coding

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.

Table Substitution Box Method for Increasing Security in Interval Splitting Arithmetic Coding

2017 ◽  
Vol 13 (10) ◽  
pp. 6552-6557
Author(s):  
E.Wiselin Kiruba ◽  
Ramar K.
Keyword(s):  
Compression Ratio ◽  
Arithmetic Coding ◽  
Substitution Box ◽  
Plain Text ◽  
T Box ◽  
Novel Approach ◽  
Permutation Methods ◽  
Message Digest ◽  
Box Method ◽  
Arithmetic Coder

Amalgamation of compression and security is indispensable in the field of multimedia applications. A novel approach to enhance security with compression is discussed in this  research paper. In secure arithmetic coder (SAC), security is provided by input and output permutation methods and compression is done by interval splitting arithmetic coding. Permutation in SAC is susceptible to attacks. Encryption issues associated with SAC is dealt in this research method. The aim of this proposed method is to encrypt the data first by Table Substitution Box (T-box) and then to compress by Interval Splitting Arithmetic Coder (ISAC). This method incorporates dynamic T-box in order to provide better security. T-box is a method, constituting elements based on the random output of Pseudo Random Generator (PRNG), which gets the input from Secure Hash Algorithm-256 (SHA-256) message digest. The current scheme is created, based on the key, which is known to the encoder and decoder. Further, T-boxes are created by using the previous message digest as a key.  Existing interval splitting arithmetic coding of SAC is applied for compression of text data. Interval splitting finds a relative position to split the intervals and this in turn brings out compression. The result divulges that permutation replaced by T-box method provides enhanced security than SAC. Data is not revealed when permutation is replaced by T-box method. Security exploration reveals that the data remains secure to cipher text attacks, known plain text attacks and chosen plain text attacks. This approach results in increased security to Interval ISAC. Additionally the compression ratio  is compared by transferring the outcome of T-box  to traditional  arithmetic coding. The comparison proved that there is a minor reduction in compression ratio in ISAC than arithmetic coding. However the security provided by ISAC overcomes the issues of compression ratio in  arithmetic coding. 

Speicherung von Segmenten mit Run-Length-Coding

2019 ◽  
pp. 516-527
Author(s):  
Alfred Nischwitz ◽  
Max Fischer ◽  
Peter Haberäcker ◽  
Gudrun Socher
Keyword(s):  
Run Length ◽  
Run Length Coding
Sign in / Sign up

Export Citation Format

Share Document