In this paper, we propose a fast algorithm for fractal image coding based on a single kick-out condition and zero contrast prediction. The single kick-out condition can eliminate lots of unmatched domain blocks in the early encoding phase. An efficient method based on zero contrast prediction is also proposed, which can determine whether the contrast factor for a domain block is zero or not and compute the corresponding difference between the range block and the transformed domain block efficiently and exactly. The proposed algorithm can achieve the same reconstructed image quality as the exhaustive search, and can greatly reduce the required computational complexity. In addition, this algorithm does not need any preprocessing steps and additional memory for its implementation, and can combine with other fast fractal algorithms to further improve the speed. Experimental results show that the runtime is reduced by about 50% when compared to the exhaustive search method. The runtime can be reduced by about 75% when our algorithm is combined with the DCT inner product algorithm.
[1]
Y. Fisher.
Fractal image compression: theory and application
,
1995
.
[2]
Dietmar Saupe,et al.
Accelerating fractal image compression by multi-dimensional nearest neighbor search
,
1995,
Proceedings DCC '95 Data Compression Conference.
[3]
A. Jacquin.
Fractal image coding: a review
,
1993,
Proc. IEEE.
[4]
C. K. Lee,et al.
Fast fractal image block coding based on local variances
,
1998,
IEEE Trans. Image Process..
[5]
Trieu-Kien Truong,et al.
A fast encoding algorithm for fractal image compression using the DCT inner product
,
2000,
IEEE Trans. Image Process..