A new fast fractalencoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) do...
详细信息
A new fast fractalencoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) domain, and the search for the minimum Euclidean-distance isometry transform to a range block starts with the one having the minimum feature distance. The search is then terminated with the test reports that the remaining isometry transforms have larger distances than current minimum distance. The second and third low frequency coefficients of WHT are used as the features of the image blocks, The simulation results confirmed that our algorithm produces a completely identical fractal code, including minimum distance isometry transform, to that of the conventional full search in reduced time.
To overcome the long encoding time of fractalimage coding, many methods have been proposed and most of these are based on image blocks classification or feather matching. It is really a good choice to convert the ent...
详细信息
ISBN:
(纸本)9781467347143
To overcome the long encoding time of fractalimage coding, many methods have been proposed and most of these are based on image blocks classification or feather matching. It is really a good choice to convert the entire search into the nearest neighbor search defined under some situation. This paper proposes a fractal image encoding method based on sub-block subtraction, which converts the entire search into the nearest neighbor search and saves plenty of time. We also present the feasibility analysis. By comparing with the basic fractal algorithm, the simulation result shows that the proposed algorithm not only can guarantee the same image quality but also can improve the encoding speed.
暂无评论