Fast algorithm to select maps in an iterated function system fractal model

Greg Vines; Monson H. Hayes III

doi:10.1117/12.131506

1 November 1992 Fast algorithm to select maps in an iterated function system fractal model

Greg Vines, Monson H. Hayes III

Proceedings Volume 1818, Visual Communications and Image Processing '92; (1992) https://doi.org/10.1117/12.131506
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States

Abstract

A new algorithm is proposed for determining the interpolation points for an Iterated Function System (IFS) model for one-dimensional data. The algorithm quickly selects points which are shown to provide favorable results when compared to an exhaustive search of all possible points. The algorithm is based on a recent proof which relates the fixed points of the IFS maps to the extremum points of the attractor of the IFS. The resulting algorithm greatly reduces the search time for the best interpolation points, and results are given comparing the proposed algorithm to exhaustive searches for a small number of maps on a series of test files.

Citation Download Citation

Greg Vines and Monson H. Hayes III "Fast algorithm to select maps in an iterated function system fractal model", Proc. SPIE 1818, Visual Communications and Image Processing '92, (1 November 1992); https://doi.org/10.1117/12.131506

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available