Paper
14 November 2007 Quad-tree partitioned fractal coding based on region competition strategy
Yonghong Chen, Zelin Shi
Author Affiliations +
Proceedings Volume 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications; 679040 (2007) https://doi.org/10.1117/12.747843
Event: International Symposium on Multispectral Image Processing and Pattern Recognition, 2007, Wuhan, China
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yonghong Chen and Zelin Shi "Quad-tree partitioned fractal coding based on region competition strategy", Proc. SPIE 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications, 679040 (14 November 2007); https://doi.org/10.1117/12.747843
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Fractal analysis

Remote sensing

Chromium

Computed tomography

Image quality

Image segmentation

Back to Top