An architecture for fractal image compression using quad-tree multiresolution

2004 ◽  
Author(s):  
A.M. Ramirez ◽  
A.D. Sanchez ◽  
M.L. Aranda ◽  
J.V. Pineda
Keyword(s):  
Image Compression ◽  
Fractal Image Compression ◽  
Fractal Image ◽  
Quad Tree

FRACTAL IMAGE COMPRESSION USING LOCALLY REFINED PARTITIONS

Fractals ◽  
1994 ◽  
Vol 02 (03) ◽  
pp. 405-408
Author(s):  
D. CAI ◽  
T. ARISAWA ◽  
N. ASAI ◽  
Y. IKEBE ◽  
T. ITOH
Keyword(s):  
Image Compression ◽  
Present Report ◽  
Compression Method ◽  
File Size ◽  
Fractal Image Compression ◽  
Fractal Image ◽  
Quad Tree

In the present report, we show a practical fractal image compression method using locally refined partition which is generated automatically and controlled by the values of gradients in images, The method is similar to the ones by Barnsley and Hurd. In our method, using the quad-tree scheme, before the compression processes of the image, we locally refine the domain regions recursively until the size of the regions become smaller than the scale lengths of the gradients in the image or until the predefined minimum refinement size is reached. Based on our method, it is possible to assess the optimum-like set of domain regions for the desired file size.

Efficient Domain Search for Fractal Image Compression Using Feature Extraction Technique

2012 ◽  
Vol 488-489 ◽  
pp. 1587-1591
Author(s):  
Amol G. Baviskar ◽  
S. S. Pawale
Keyword(s):  
Feature Extraction ◽  
Image Compression ◽  
Low Complexity ◽  
Contractive Mapping ◽  
Fractal Image Compression ◽  
Compression Technique ◽  
Image Encoding ◽  
Fractal Image ◽  
Coding Method ◽  
The Given

Fractal image compression is a lossy compression technique developed in the early 1990s. It makes use of the local self-similarity property existing in an image and finds a contractive mapping affine transformation (fractal transform) T, such that the fixed point of T is close to the given image in a suitable metric. It has generated much interest due to its promise of high compression ratios with good decompression quality. Image encoding based on fractal block-coding method relies on assumption that image redundancy can be efficiently exploited through block-self transformability. It has shown promise in producing high fidelity, resolution independent images. The low complexity of decoding process also suggested use in real time applications. The high encoding time, in combination with patents on technology have unfortunately discouraged results. In this paper, we have proposed efficient domain search technique using feature extraction for the encoding of fractal image which reduces encoding-decoding time and proposed technique improves quality of compressed image.

Sign in / Sign up

Export Citation Format

Share Document