Abstract
Iterated Function Systems (IFS) seem to be used best to represent objects frequently encountered in the nature, because many of them are self similar. An IFS is a set of affine and contractive transformations. The union (so-called collage) of the subimages generated by transforming the whole image produces the image again — namely the self similar attractor of these transformations, which can be described by a binary image. For a high compressed and compact mathematical representation of the images, it would be desirable to calculate the transformations directly from the image that means to solve the inverse IFS-Problem. The approaches developed so far try to solve this problem using partitioned IFS (PIFS) which encode an image by decomposing it into blocks without taking advantage of any self similarity of subimages and without using the full range of affine transformations for the mapping of these blocks onto each other. In the solution presented here the transformations (IFS-Codes) for a single image are calculated by affinely mapping maxima of the edge of the entire image to the corresponding maxima of the edge of each of the subimages. The affine invariance of an appropriate representation of quadruples thru edge extremes permits to detect extremes of the image and in each of its subimages, which are related to each other.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
