Fast block matching method for image data compression based on fractal models
Hideo Kuroda, Dan Corneliu Popescu, Hong Yan · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1995
This paper presents a fast block matching technique for image data compression based on fractal models. In fractal coding, domain blocks in an image are searched and the one most similar to a range block is selected as the best matching domain block. We propose a fast search method to improve the encoding time and the data compression rate. In our method a positive aim at a domain block consists of the inner pixels of the range block and the outer only one or two pixels of the range block. The method has been tested on real image data with good results.