Non-Exhaustive Search Method for Fractal Image Compression

Author(s):  
Heba Abedellatif ◽  
Taha E. Taha ◽  
Ramadan El-Shanawany ◽  
Fathi E. Abd El-Samie ◽  
Osama F. Zahran
Fractals ◽  
1997 ◽  
Vol 05 (supp01) ◽  
pp. 231-241
Author(s):  
Leszek Ciepliński ◽  
Czesław Jȩdrzejek ◽  
Tomasz Major

In this paper we investigate the effect of fast nearest neighbor search method on acceleration of fractal image compression. First we follow the Saupe1 encoding step of fractal image compression that uses the multi-dimensional nearest neighbor search in a projected space. Then we investigate performance of a method for finding the nearest vector called partial distortion elimination. We also propose some supplementary accelerating concepts. For all inspected methods the impact of the tolerance criterion for mean square error of block matching is examined.


Author(s):  
Shilpi Sharma ◽  
Arvind Kumar Kourav ◽  
Vimal Tiwari

Fractal algorithms are used to represent similar parts of images into mathematical transforms that can recreate the original image. This chapter presents a fast fractal image compression technique via domain kick-out method, based on averaging of domain images to discard redundant domain images. It accelerates the encoding process by reducing the size of the domain pool. Results of a simulation on the proposed speedup technique on three standard test images shows that performance of the proposed technique is far superior to the present kick out methods of fractal image compression. It has reported a speedup ratio of 31.07 in average while resulting into compression ratio and retrieved image quality comparable to Jacquin's full search method.


2012 ◽  
Vol 488-489 ◽  
pp. 1587-1591
Author(s):  
Amol G. Baviskar ◽  
S. S. Pawale

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