1993Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)Open access

A Comparison of Some of the Most Current Methods of Image Compression

Robert T. Kay

Open full text 0 citations

Abstract

In this report, commonly used lossless and lossy image compression algorithms are heuristically presented and then compared in terms of performance. The lossy algorithms, JPEG (Joint Photographic Experts Group) and Fractal compression, are compared in terms of their respective sensitivities between compression ratio and image fidelity. Compression algorithms based on the lossless models of Huffman, Adaptive Huffman, and Arithmetic coding are compared in terms of compression ratio and compression/decompression time requirements. High fidelity image reconstructions of JPEG and Fractal compressions are also included in the comparison. Results, for the images tested, indicate that if imperceptible losses in fidelity can be tolerated, then among the current versions of the algorithms tested, the JPEG results in higher compression with less process time.

Open-access reader

About this research paper

What this paper is about

In this report, commonly used lossless and lossy image compression algorithms are heuristically presented and then compared in terms of performance. The lossy algorithms, JPEG (Joint Photographic Experts Group) and Fractal compression, are compared in terms of their respective sensitivities between compression ratio and image fidelity. Compression algorithms based on the lossless models of Huffman, Adaptive Huffman, and Arithmetic coding are compared in terms of compression ratio and compression/decompression time requirements. High fidelity image reconstructions of JPEG and Fractal compressions are also included in the comparison. Results, for the images tested, indicate that if imperceptible losses in fidelity can be tolerated, then among the current versions of the algorithms tested, the JPEG results in higher compression with less process time.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this report, commonly used lossless and lossy image compression algorithms are heuristically presented and then compared in terms of performance. The lossy algorithms, JPEG (Joint Photographic Experts Group) and Fractal compression, are compared in terms of their respective sensitivities between compression ratio and image fidelity. Compression algorithms based on the lossless models of Huffman, Adaptive Huffman, and Arithmetic coding are compared in terms of compression ratio and compression/decompression time requirements. High fidelity image reconstructions of JPEG and Fractal compressions are also included in the comparison. Results, for the images tested, indicate that if imperceptible losses in fidelity can be tolerated, then among the current versions of the algorithms tested, the JPEG results in higher compression with less process time.

Key concepts: Lossy compression, Lossless compression, Lossless JPEG, Image compression, JPEG, Data compression ratio, Fractal transform, Data compression

Related papers

Back to paper searchBrowse research topicsOriginal source
A Comparison of Some of the Most Current Methods of Image Compression — Research Paper | ScholarLens