Feature Extraction Using Fractal Codes
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
An Interpolative Scheme for Fractal Image Compression in the Wavelet Domain
CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
A Parallel Architecture for Quadtree-based Fractal Image Coding
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Fractal image compression with variance and mean
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Using quasi-continuous histograms for fuzzy main motion estimation in video sequence
Fuzzy Sets and Systems
Wavelet-based perceptually lossless coding of R-G-B images
Integrated Computer-Aided Engineering
Fast image restoration using the multi-layer best neighborhood matching approach
ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
A 2-D ECG compression algorithm based on wavelet transform and vector quantization
Digital Signal Processing
Hybrid image compression using fractal-wavelet prediction
ISP'06 Proceedings of the 5th WSEAS International Conference on Information Security and Privacy
A fast classification based method for fractal image encoding
Image and Vision Computing
A multi-resolution model of vector map data for rapid transmission over the Internet
Computers & Geosciences
A New Wavelet---Fractal Image Compression Method
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Self-similarity of images in the wavelet domain in terms of ℓ2 and structural similarity (SSIM)
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
Hi-index | 0.01 |
Why does fractal image compression work? What is the implicit image model underlying fractal block coding? How can we characterize the types of images for which fractal block coders will work well? These are the central issues we address. We introduce a new wavelet-based framework for analyzing block-based fractal compression schemes. Within this framework we are able to draw upon insights from the well-established transform coder paradigm in order to address the issue of why fractal block coders work. We show that fractal block coders of the form introduced by Jacquin (1992) are Haar wavelet subtree quantization schemes. We examine a generalization of the schemes to smooth wavelets with additional vanishing moments. The performance of our generalized coder is comparable to the best results in the literature for a Jacquin-style coding scheme. Our wavelet framework gives new insight into the convergence properties of fractal block coders, and it leads us to develop an unconditionally convergent scheme with a fast decoding algorithm. Our experiments with this new algorithm indicate that fractal coders derive much of their effectiveness from their ability to efficiently represent wavelet zero trees. Finally, our framework reveals some of the fundamental limitations of current fractal compression schemes