Symmetry · 2019 · 86 citations · 30 references
ArtsComputer ScienceComputer VisionDigital ImagingInformation TheoryCoding TheoryData CompressionDigital Image ProcessingImage CompressionImage ProcessingLossless Data CompressionCompression Performance EvaluationCompression RatioCompression TechniquesDictionary CompressionDictionary-based CompressionEntropy In Data CompressionLossless Image CompressionMetrics
Modern daily life activities result in a huge amount of data, which creates a big challenge for storing and communicating them. As an example, hospitals produce a huge amount of data on a daily basis, which makes a big challenge to store it in a limited storage or to communicate them through the restricted bandwidth over the Internet. Therefore, there is an increasing demand for more research in data compression and communication theory to deal with such challenges. Such research responds to the requirements of data transmission at high speed over networks. In this paper, we focus on deep analysis of the most common techniques in image compression. We present a detailed analysis of run-length, entropy and dictionary based lossless image compression algorithms with a common numeric example for a clear comparison. Following that, the state-of-the-art techniques are discussed based on some bench-marked images. Finally, we use standard metrics such as average code length (ACL), compression ratio (CR), pick signal-to-noise ratio (PSNR), efficiency, encoding time (ET) and decoding time (DT) in order to measure the performance of the state-of-the-art techniques.
30
Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM · 1987 · 2.9K citations · Full text
Run-length encodings (Corresp.)
Solomon W. Golomb · IEEE Transactions on Information Theory · 1966 · 972 citations