|
This article is cited in 2 scientific papers (total in 2 papers)
Reversible data compression by universal arithmetic coding
A. I. Stefanovich, D. V. Sushko Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract:
The paper considers the general approach to the reversible (lossless) digital data compression problem, which is based on universal arithmetic coding of data with unknown statistics. A model of a source with calculable sequence of states is used for data description. Within the approach, the tasks of obtaining specific compression methods and algorithms for particular data types are set up. The authors use computed tomography data (tomograms) as the object of the study and present two methods of lossless compression of tomograms. The first method encodes prediction errors of tomograms; the second method encodes components of discrete wavelet transform of tomograms. These methods are examined in details, effective compression algorithms are constructed, and individual estimates of bit rate are obtained for the algorithms. The bit rates of the constructed algorithms and the lossless compression algorithms of the JPEG 2000 standard are compared. The results demonstrate high quality of the constructed algorithms and indicate great potential of the approach in general.
Keywords:
reversible data compression; lossless compression; universal coding; arithmetic coding; computed tomography.
Received: 30.11.2016
Citation:
A. I. Stefanovich, D. V. Sushko, “Reversible data compression by universal arithmetic coding”, Inform. Primen., 11:1 (2017), 20–45
Linking options:
https://www.mathnet.ru/eng/ia457 https://www.mathnet.ru/eng/ia/v11/i1/p20
|
Statistics & downloads: |
Abstract page: | 278 | Full-text PDF : | 160 | References: | 33 | First page: | 2 |
|