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
| Hi-index | 0.00 |
In traditional fractal image compression, the encoding procedure is time-consuming due to the full search mechanism. In order to speed-up the encoder, we adopt particle swarm optimization method performed under classification and Dihedral transformation to further decrease the amount of MSE computations. The classifier partitions all of the blocks in domain pool and range pool into three classes according to the third level wavelet coefficients. Each range block searches the most similar block only from the blocks of the same class. Furthermore, according to the property of Dihedral transformation, only four transformations for each domain block are considered so as to reduce the encoding time. Experimental results show that, the encoding time of the proposed method is faster than that of the full search method.