Fast Block Matching in One Dimensional Fractal Image Coding Using Center of Gravity of a Block

概要

論文の詳細を見る
In an encoding process for fractal image compression, the best matching domain block which is most similar to a given range block is selected from the domain pool.Since the quality of a reconstructed image could be improved by increasing the number of domain blocks in the domain pool, one dimensional fractal image coding using Hilbert scanning was suggested,as it can easily increase the number of domain blocks. But this method has a problem of time with increasing the number of domain blocks. So, we propose a fast searching method to improve the time consumption using the center of gravity of the image block. With the proposed method,domain blocks are firstly sorted according to their centers of gravity. Then, domain blocks whose centers of gravity are near to center of gravity of the range block are searched as the candidates for the best matching domain block.Simulation results show that the proposed method improves the time consumption.
社団法人電子情報通信学会の論文
2003-01-14