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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.