Share Email Print
cover

Proceedings Paper

Quad-tree partitioned fractal coding based on region competition strategy
Author(s): Yonghong Chen; Zelin Shi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To deal with the time-consuming problem in the fractal coding, a novel method based on the region competition strategy is introduced to improve the speed of fractal coding effectively. This strategy adopted can discover the optimal affine matching block and the optimal affine transformation of each range block, improving some affine ones with bigger error. Experiments on still life image, fractal image and remote sensing image show that the proposed scheme reduces the compression time and obtains the approximate reconstruction fidelity while it has the same compression ratios as that of adaptive quad-tree partitioned fractal coding.

Paper Details

Date Published: 14 November 2007
PDF: 6 pages
Proc. SPIE 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications, 679040 (14 November 2007); doi: 10.1117/12.747843
Show Author Affiliations
Yonghong Chen, Shenyang Institute of Automation (China)
Graduate School of the Chinese Academy of Sciences (China)
Zelin Shi, Shenyang Institute of Automation (China)


Published in SPIE Proceedings Vol. 6790:
MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications

© SPIE. Terms of Use
Back to Top