An automatization of Barnsley's algorithm for the inverse problem of iterated function systems
2003 (English)In: IEEE Transactions on Image Processing, ISSN 1057-7149, E-ISSN 1941-0042, Vol. 12, no 11, 1388-1397 p.Article in journal (Refereed) Published
We present an automatization of Barnsley's manual algorithm for the solution of the inverse problem of iterated function systems (IFSs). The problem is to retrieve the number of mappings and the parameters of an IFS from a digital binary image approximating the attractor induced by the IFS. Barnsley et al. described a way to manually solve the inverse problem by identifying the fragments, of which the collage is composed, and then computing the parameters of the mappings. The automatic algorithm searches through a finite set of points in the parameter space determining a set of affine mappings. The algorithm uses the collage theorem and the Hausdorff metric. The inverse problem of IFSs is related to image coding of binary images. If the number of mappings and the parameters of an IFS, with not too many mappings, could be obtained from a binary image, then this would give an efficient representation of the image. It is shown that the inverse problem solved by the automatic algorithm has a solution and some experiments show that the automatic algorithm is able to retrieve an IFS, including the number of mappings, from a digital binary image approximating the attractor induced by the IFS.
Place, publisher, year, edition, pages
2003. Vol. 12, no 11, 1388-1397 p.
IdentifiersURN: urn:nbn:se:liu:diva-46442DOI: 10.1109/TIP.2003.818040OAI: oai:DiVA.org:liu-46442DiVA: diva2:267338