Recursive group coding for image DCT compression efficiency
Keywords:Entropy coding, image compression, recursive group coding, arithmetic coding, Huffman coding
The problem of encoding information in order to eliminate its statistical redundancy has been considered. The most widespread techniques for lossless encoding are arithmetic and Huffman coding. One disadvantage of these methods is the lack of efficiency when encoding characters with extra-large alphabets. In this paper, the efficiency of image data compression with method of recursive group coding has been considered and compared to arithmetic and Huffman coding. It is shown that recursive group coding provides a sufficient gain in compression compared to aforementioned methods.
How to Cite
Copyright (c) 2021 Nadejda Kozhemiakina, Vladimir Lukin, Nikolay Ponomarenko, Victoria Naumenko
This work is licensed under a Creative Commons Attribution 4.0 International License.