Fast Fractal Image Encoding Algorithm Based on Coefficient of Variation Feature

摘要

In order to improve the drawback of fractal image encoding with full search typically requires a very long runtime. This paper thus proposed an effective algorithm to replace algorithm with full search, which is mainly based on newly-defined coefficient of variation feature of image block. During the search process, the coefficient of variation feature is utilized to confine efficiently the search space to the vicinity of the domain block having the closest coefficient of variation feature to the input range block being encoded, aiming at reducing the searching scope of similarity matching to accelerate the encoding process. Simulation results of three standard test images show that the proposed scheme averagely obtain the speedup of 4.67 times or so by reducing the searching scope of best-matched block, while can obtain the little lower quality of the decoded images against the full search algorithm. Moreover, it is better than the moment of inertia algorithm.