Close category search window
 

Fast fractal encoding algorithm using the law of cosines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chou-Chen Wang ; Dept. of Electron. Eng., I-Shou Univ., Kaohsiung, Taiwan ; Liang-Chi Lin ; Shou-Hsuan Tsai

The major drawback of the fractal image compression is the high encoding complexity to find the best match between a range block and a large pool of domain blocks. This paper presents a fast fractal-encoding algorithm based on the law of cosines. The number of domain blocks searched to find the best match for each range block is safely reduced by eliminating the ineligible domain blocks using the law of cosines. Simulation results show that the proposed algorithm can produce a completely identical fractal code to that of the exhaustive search in reduced time.

Published in:
Circuits and Systems, 2004. MWSCAS '04. The 2004 47th Midwest Symposium on  (Volume:1 )

Date of Conference: 25-28 July 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.