Share Email Print
cover

Proceedings Paper

An eliminated fractal compression algorithm by variance
Author(s): Yan Li Feng; Zheng Wei Yu; Hui Fan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A new fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper. The number of domain blocks searched to find the best match for each range block and corresponding encoding time are much reduced by elimination domain blocks not searching using the current minimum distortion and variance difference between the range block and domain block. The algorithm produces a completely identical fractal encoding to that of the conventional full search in reduced time.

Paper Details

Date Published: 25 September 2003
PDF: 5 pages
Proc. SPIE 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition, (25 September 2003); doi: 10.1117/12.538966
Show Author Affiliations
Yan Li Feng, China Univ. of Mining Technology (China)
Zheng Wei Yu, China Univ. of Mining Technology (China)
Hui Fan, Shandong Institute of Business and Technology (China)
China Univ. of Mining Technology (China)


Published in SPIE Proceedings Vol. 5286:
Third International Symposium on Multispectral Image Processing and Pattern Recognition
Hanqing Lu; Tianxu Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top