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