Cart (Loading....) | Create Account
Close category search window
 

Fractal image compression and recurrent iterated function systems

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

1 Author(s)
Hart, J.C. ; Washington State Univ., Pullman, WA, USA

Linear fractal models such as the iterated function system (IFS), recurrent IFS (RIFS), and Lindenmeyer system (L-system) concisely describe complex objects using self-reference. These models hold much promise in computer graphics as geometric representations of detail. The use of fractals for image compression sacrifices its fractal origins in the search for optimal coding gain. This article rebuilds the relationship between the fields of fractal image compression (FIC) and fractal geometry to better facilitate the sharing of new results. Many geometric representations exist for smooth shapes, and each has certain benefits and drawbacks. Computer-aided geometric design has produced many algorithms to convert a given curve or surface description into the most appropriate geometric representation for a given task. Likewise, there are several models for linear fractal shapes and several methods for converting between the representations. The representation used by FIC has been called partitioned IFS or local IFS. This article describes a method for converting FIC's partitioned/local IFS to fractal geometry's RIFS. This conversion algorithm allows FIC to represent any input shape as a linear fractal and permits algorithms developed for linear fractals to be applied to a wider variety of shapes. When every domain element can be expressed as the union of range elements, FIC produces a structure that is equivalent to a RIFS, enabling it to automatically model arbitrary shapes

Published in:

Computer Graphics and Applications, IEEE  (Volume:16 ,  Issue: 4 )

Date of Publication:

Jul 1996

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.