Share Email Print

Proceedings Paper

Real-time compression coding based on convolution fractal image
Author(s): Fu Ping; Ke-bin An; Pei-zhen Zhang; Hexin Chen
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 31 July 2002
PDF: 5 pages
Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); doi: 10.1117/12.477129
Show Author Affiliations
Fu Ping, Jilin Univ. (China)
Ke-bin An, Jilin Univ. (China)
Pei-zhen Zhang, Jilin Univ. (China)
Hexin Chen, Jilin Univ. (China)

Published in SPIE Proceedings Vol. 4875:
Second International Conference on Image and Graphics
Wei Sui, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?