25 September 1998 Fast and efficient fractal image compression algorithm
Author Affiliations +
Proceedings Volume 3545, International Symposium on Multispectral Image Processing (ISMIP'98); (1998) https://doi.org/10.1117/12.323567
Event: International Symposium on Multispectral Image Processing, 1998, Wuhan, China
Abstract
Since the encoding time for fractal encoding method is high and of importance, how to speed up the encoding is a key issue. In this paper, we propose a fast and efficient fractal coding algorithm, which is based on merged quadtree partitioning scheme. In this algorithm, the searching procedure in the finer level sufficiently uses the computing result of the coarser one. For the searches in finer levels, most of computation has been completed by searches in the coarser level, so the total search time reduces greatly. Besides, we use simple merged quadtree to reduce the number of transformation needed by encoding the whole image, so at the same PSNR, we also gain an increase of the compression ratio.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yigang Wang, Qunsheng Peng, Yiwen Jin, "Fast and efficient fractal image compression algorithm", Proc. SPIE 3545, International Symposium on Multispectral Image Processing (ISMIP'98), (25 September 1998); doi: 10.1117/12.323567; https://doi.org/10.1117/12.323567
PROCEEDINGS
4 PAGES


SHARE
Back to Top