Abstract
Through a procedure called the LIFSM algorithm, based on the Collage Theorem, it is possible to represent an image by a set of data, known as a fractal code, from which we may construct an approximation of the image. This algorithm is largely based upon the idea of matching larger portions of an image, called “parent blocks,” to smaller portions called “child blocks” in order to minimize a quantity known as the “collage distance.” We modify the LIFSM algorithm through the consideration of “near-optimal pairings.” We develop the theory, discuss applications and present examples in image denoising, image reconstruction, and edge detection.
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.
