Translator Disclaimer
Paper
21 April 1995 Fast block matching method for image data compression based on fractal models
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

DS DCT the double shift DCT image coding for...
Proceedings of SPIE (September 01 1990)
New block coding method for bilevel images
Proceedings of SPIE (March 03 1995)

Back to Top