Wavelets and Fractal Image Compression Based on Their Self—Similarity of the Space-Frequency Plane of Images

Author(s):  
Yoshito Ueno
Author(s):  
YOSHITO UENO

This paper presents a fusion scheme for wavelets and fractal image compression based on the self-similarity of the space-frequency plane of sub-bands after wavelet transformation of images. Various kinds of wavelet transform are examined for the characteristics of their self-similarity and evaluated for the adoption of fractal encoder. The aim of this paper is to reduce the information of the two sets of blocks involved in the fractal image compression by using the self-similarity of images. And also, the new video encoder using the fusion method of wavelets and fractal adopts the similar manner as the motion compensation technique of MPEG encoder. Experimental results show almost the same PSNR and bits rate as conventional fractal image encoder by depending on the sampled images through computer simulations.


2007 ◽  
Vol 1 (3) ◽  
pp. 381-408
Author(s):  
Ghim-Hwee Ong ◽  
Kin-Wah Eugene Ching

An improvement scheme, so named the Two-Pass Improved Encoding Scheme (TIES), for the application to image compression through the extension of the existing concept of fractal image compression (FIC), which capitalizes on the self-similarity within a given image which is to be compressed, is proposed in this paper. This paper first briefly explores the existing image compression technology based on FIC, before exploring the areas which can be improved and hence establishing the concept behind the TIES algorithm. An effective encoding and decoding algorithm for the implementation of TIES is developed, through the consideration of the domain pool, block scaling and transformation, range block approximation using linear combinations and arithmetic encoding for storing data as close to source entropy as possible. The performance of TIES is then explicitly compared against that of FIC under the same conditions. Finally, due to the long encoding time required by TIES, this paper then proceeds to propose parallelized versions of the two TIES algorithms, before finally concluding with an empirical analysis of the speedup and scalability of the parallelized TIES algorithms, as well as compare the effect of parallelization between the two.


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