An Algorithm to Solve the Inverse IFS-Problem
Erwin Hocevar · Birkhäuser Boston eBooks · 2002
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. 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.