2000Journal of Northeastern UniversityRequires access

Data Compression Dictionary and a Quick Image Compression Algorithm Based on Fractal Mapping

Zhao De, B Clinic

Open publisher page 0 citations

Abstract

The compression time of fractal coding algorithm is so long that the algorithm is hardly useful in reality. The idea to preprocess the image by means of many grey levels was presented. It constructs a data compression dictionary based on compressed image, so that the compression block matched in the image is only searched in the data compression dictionary. As a result, this algorithm greatly shortens the compression time and the searching scope in the compression procedure,compared with other algorithms of the fractal block coding. In addition, the theoretical basis of constructing the data compression dictionary was obtained. Based on the new compression idea, a concrete algorithm of realizing fractal image coding was designed. The new algorithm can improve compression ratio while reducing encoding time.

About this research paper

What this paper is about

The compression time of fractal coding algorithm is so long that the algorithm is hardly useful in reality. The idea to preprocess the image by means of many grey levels was presented. It constructs a data compression dictionary based on compressed image, so that the compression block matched in the image is only searched in the data compression dictionary. As a result, this algorithm greatly shortens the compression time and the searching scope in the compression procedure,compared with other algorithms of the fractal block coding. In addition, the theoretical basis of constructing the data compression dictionary was obtained. Based on the new compression idea, a concrete algorithm of realizing fractal image coding was designed. The new algorithm can improve compression ratio while reducing encoding 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

The compression time of fractal coding algorithm is so long that the algorithm is hardly useful in reality. The idea to preprocess the image by means of many grey levels was presented. It constructs a data compression dictionary based on compressed image, so that the compression block matched in the image is only searched in the data compression dictionary. As a result, this algorithm greatly shortens the compression time and the searching scope in the compression procedure,compared with other algorithms of the fractal block coding. In addition, the theoretical basis of constructing the data compression dictionary was obtained. Based on the new compression idea, a concrete algorithm of realizing fractal image coding was designed. The new algorithm can improve compression ratio while reducing encoding time.

Key concepts: Fractal compression, Fractal transform, Data compression, Color Cell Compression, Image compression, Texture compression, Computer science, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Data Compression Dictionary and a Quick Image Compression Algorithm Based on Fractal Mapping — Research Paper | ScholarLens