Fast block matching method for image data compression based on fractal models

Hideo Kuroda; Dan C. Popescu; Hong Yan

doi:10.1117/12.206659

Translator Disclaimer

21 April 1995 Fast block matching method for image data compression based on fractal models

Hideo Kuroda, Dan C. Popescu, Hong Yan

Author Affiliations +

Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206659
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan

Abstract

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.

Citation Download Citation

Hideo Kuroda, Dan C. Popescu, and Hong Yan "Fast block matching method for image data compression based on fractal models", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206659

ACCESS THE FULL ARTICLE