Fractal image compression: a randomized approach
Pattern Recognition Letters
Fractal image compression using visual-based particle swarm optimization
Image and Vision Computing
Grey video compression methods using fractals
International Journal of Computer Mathematics - Celebrating the Life of David J. Evans
Study on huber fractal image compression
IEEE Transactions on Image Processing
Novel fractal image encoding algorithm using normalized one-norm and kick-out condition
Image and Vision Computing
DCT based simple classification scheme for fractal image compression
Image and Vision Computing
A multi-purpose digital image watermarking using fractal block coding
Journal of Systems and Software
| Hi-index | 0.01 |
In this paper, a fast encoding algorithm is developed for fractal image compression. At each search entry in the domain pool, the mean square error (MSE) calculations of the given range block and the eight dihedral symmetries of the domain block are obtained simultaneously in the frequency domain, in which the redundant computations are all eliminated in the new encoding algorithm. It is shown in software simulation that the encoding time is about six times faster than that of the baseline method with almost the same PSNR for the retrieved image. The fast algorithm is performed to deal with the eight dihedral symmetries at each search entry. Therefore, it can be applied to various enhanced algorithms which are equipped with quadtree, classification, and other mechanisms