Paper
31 July 2002 Real-time compression coding based on convolution fractal image
Fu Ping, Ke-bin An, Pei-zhen Zhang, Hexin Chen
Author Affiliations +
Proceedings Volume 4875, Second International Conference on Image and Graphics; (2002) https://doi.org/10.1117/12.477129
Event: Second International Conference on Image and Graphics, 2002, Hefei, China
Abstract
In fractal image compression, an image is coded as a set of contractive transformations, and is guaranteed to generate an approximation to the original image when iteration applied to any initial image. In this paper, according to Jacquin' 5 PIFS algorithm, and by analyzing traditional fractal mapping parameters, a kind of convolution-based fast fractal image coding scheme (CBFC) is advanced. To speed up the encoding and improve the compression ratio, it is combined with quad-tree partitioning neighbor searching algorithm. To improve the real-time performance of the algorithm, it is performed on TMS320C6201. Experiments results of algorithms based on CBFC, and CBFC using quad-tree partitioning structure on DSP are given in this paper as comparisons. The results show that fractal image real-time coding can be realized with the considerable reconstructive image and coding time.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fu Ping, Ke-bin An, Pei-zhen Zhang, and Hexin Chen "Real-time compression coding based on convolution fractal image", Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); https://doi.org/10.1117/12.477129
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Fractal analysis

Computer programming

Digital signal processing

Convolution

Image processing

Fourier transforms

Back to Top