Advertisement

An Algorithm to Solve the Inverse IFS-Problem

  • Erwin Hocevar

Abstract

Global IFS seem to be suited best for compressed encoding of natural objects which are in most cases self-affine even if not always exactly. Since affine maps — the IFS-Codes — resp. the union of all their orbits, generate an object (an IFS-Attractor), the detection of a nonminimal set of these orbits solves the inverse IFS-Problem by calculating a superset of IFS-Codes which has to be minimized. Here an algorithm is presented to calculate these boundary orbits. On the basis of a generalized convex hull — the —Hull — the log spirals (curves formed by the orbits) circumscribing the object can be calculated. From object points on these log spirals the generating affine maps are derived. Then these affine maps are classified to calculate the IFS-Codes of a minimal IFS. Finally, orbits contained in parts inside the object are set in relation to the found orbits to solve the problem for the entire object.

Keywords

Recursive Calculation Logarithmic Spiral World Scientific Publishing Large Orbit Entire Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    W. G. Kropatsch and M. A. Neuhauser, Recovering iterated functions, In Proceedings of Czech Pattern Recognition Workshop’93, Prenet, Sumava Mountains (November 4–6 1993).Google Scholar
  2. [2]
    M. F. Barnsley, Fractals Everywhere, Academic Press, 1988.Google Scholar
  3. [3]
    M. A. Neuhauser, Diskrete Iterierte Funktionensysteme, Diploma Thesis, Dept. for Pattern Recognition and Image Processing, Inst, of Automation, Technical University of Vienna (March 1993).Google Scholar
  4. [4]
    Fisher Y. (Ed.), Fractal Image Compression — Theory and Application, Springer-Verlag, New York, 1995.Google Scholar
  5. [5]
    Edelsbrunner H., Kirkpatric D.G., Seidel R., On the shape of a set of points in the plane, IEEE Transactions on Information Theory 29 (1983).Google Scholar
  6. [6]
    M. Worring, Shape Analysis of Digital Curves, Thesis, The Institute for Informatics of the University of Amsterdam, Netherlands, 1993.Google Scholar
  7. [7]
    E. Hocevar, The σ-Hull - the Hull where Fractals Live - Calculating a Hull Bounded by log Spirals to Solve the Inverse IFS-Problem by the Detected Orbits. In Paradigms of Complexity (M. M. Novak, ed.), World Scientific Publishing, 2000.Google Scholar
  8. [8]
    J. C. Hart, Similarity Hashing: A Model-Based Vision Solution to the Inverse Problem of RIFS, ASI Workshop on Fractal Image Encoding and Analysis, Trondheim, Norway (July 1995).MATHGoogle Scholar
  9. [9]
    E. Hocevar, W. G. Kropatsch, Capturing Self Similarity of Nature into Formulas - A Feature Based Solution for Fractal Compressed Encoding of Monochrome IFS-Objects, Fractals and Beyond (M. M. Novak, ed.), World Scientific Publishing, 1998, pp. 201–210.Google Scholar
  10. [10]
    M. F. Barnsley, John H. Elton, D.P. Hardin, Recurrent iterated function systems, Journal Constructive Approximation 5 (1989).Google Scholar
  11. [11]
    Vrscay E.R., Iterated Function Systems: Theory, Applications and the Inverse Problem. In Proceedings of an ASI Conference on Fractal Geometry and Analysis 1989, Montreal, Canada, Kluwer, 1991.Google Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Erwin Hocevar

There are no affiliations available

Personalised recommendations