Share Email Print

Proceedings Paper

Fast and efficient fractal image compression algorithm
Author(s): Yigang Wang; Qunsheng Peng; Yiwen Jin
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 25 September 1998
PDF: 4 pages
Proc. SPIE 3545, International Symposium on Multispectral Image Processing (ISMIP'98), (25 September 1998); doi: 10.1117/12.323567
Show Author Affiliations
Yigang Wang, Zhejiang Univ. (China)
Qunsheng Peng, Zhejiang Univ. (China)
Yiwen Jin, Zhejiang Univ. (China)

Published in SPIE Proceedings Vol. 3545:
International Symposium on Multispectral Image Processing (ISMIP'98)
Ji Zhou; Anil K. Jain; Tianxu Zhang; Yaoting Zhu; Mingyue Ding; Jianguo Liu, Editor(s)

© SPIE. Terms of Use
Back to Top