Recursive group coding for image DCT compression efficiency

Nadejda Kozhemiakina, Vladimir Lukin, Nikolay Ponomarenko and Victoria Naumenko
Additional contact information
Nadejda Kozhemiakina: National Aerospace University «KhAI», Kharkiv, Ukraine
Vladimir Lukin: National Aerospace University «KhAI», Kharkiv, Ukraine
Nikolay Ponomarenko: National Aerospace University «KhAI», Kharkiv, Ukraine; Tampere University of Technology, Tampere, Finland
Victoria Naumenko: National Aerospace University «KhAI», Kharkiv, Ukraine

Technium, 2021, vol. 3, issue 1, 150-155

Abstract: 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
https://techniumscience.com/index.php/technium/article/view/2507 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tec:techni:ojs:2507

Access Statistics for this article

Technium is currently edited by Scurtu Ionut Cristian

More articles in Technium from Technium Science
Bibliographic data for series maintained by Ana Maria Golita ().