Fractals everywhere
Fractal image compression: theory and application
Fractal image compression: theory and application
A class of fractal image coders with fast decoder convergence
Fractal image compression
Least-squares block coding by fractal functions
Fractal image compression
Architecture for fractal image compression
Journal of Systems Architecture: the EUROMICRO Journal
A fast fractal image encoding method based on intelligent search of standard deviation
Computers and Electrical Engineering
DCT based simple classification scheme for fractal image compression
Image and Vision Computing
A wavelet-based analysis of fractal image compression
IEEE Transactions on Image Processing
Fast fractal image encoding based on adaptive search
IEEE Transactions on Image Processing
Adaptive approximate nearest neighbor search for fractal image compression
IEEE Transactions on Image Processing
A fast and efficient hybrid fractal-wavelet image coder
IEEE Transactions on Image Processing
Image coding based on a fractal theory of iterated contractive image transformations
IEEE Transactions on Image Processing
Novel fractal image encoding algorithm using normalized one-norm and kick-out condition
Image and Vision Computing
An improved no-search fractal image coding method based on a fitting plane
Image and Vision Computing
Real time fractal image coder based on characteristic vector matching
Image and Vision Computing
An efficient approach to speed up the search process during fractal matching process
AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
3D Searchless Fractal Video Encoding at Low Bit Rates
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
In the present paper a fast and efficient fractal image encoding method based on classification of image blocks is presented. Two parameters are used to sort image blocks into disjoint classes: the direction of the approximate first derivative and a normalized root mean square error of the fitting plane in the given block. With the help of these parameters the number of domain blocks examined for a range block is reduced dramatically, and thus, the classification results in a considerable acceleration of the encoding process, without loss of the reconstruction fidelity. The proposed method is compared to recently developed fast classification algorithms and a 'No search algorithm', and its rate-distortion performance under the same encoding time limit is proved to be better than that of the others.