Fast Fractal Image Encoding Based on Classification and Neighbor-Searching
Yi Chuanjun · Computer Knowledge and Technology · 2009
In order to solve the problem of time consuming in the encoding process of the basic fractal algorithm,a fast method based on classification and neighbor-searching is proposed.Every range block is classified into smooth or non-smooth block according to the feature of HVS(Human Visual System).The mean will be kept for every smooth range block,so that the number of range block which needs to search for the best domain block is reduced.Every non-smooth range block searches for the best domain block in its neighborhoods.The domain block which doesn't accord with kick-out condition based on the similar measure is excluded from the codebook.Furthermore,an error threshold and the most times of searching domain block are used to control the searching range.The experimental results demonstrate that the proposed algorithm is much faster than the basic fractal algorithm.