In the processing of photographic images, it is common to manipulate them to include objects that are not present in the original image, to make them more appealing or to change the environment. Therefore, they are manually edited and the object to be included is cut out of a source image, to join it to the destination and then, through the use of filters, the contour is softened to make the union between both images less noticeable. Perez et al. introduced a technique, called perfect cloning, based on processing the image gradient to integrate them, using sparse matrices, allowing to automate this process. However, its implementation in languages such as Java is complex due to memory limitations for large matrices. Hence, this paper introduces a method of implementing sparse arrays that allow their use in Java. It has been implemented as a plugin for the free software ImageJ. In addition, the technique is compared with the Multiresolution method, developed by Burt and Adelson, which is considered a reference in the field.
Photo restoration is one of the most popular tasks in digital image processing, required when an image has stains, scratches or any unwanted object. Inpainting is the name given to this type of method, which is based on modifying the areas, where the unwanted information is, in an imperceptible way. The concept of Inpainting was born in the early twentieth century, due to the need to replace or remove an object from a photograph, this was possible through manual brushstrokes of an editor or painter. From the above and the theory of Poisson's image editing, a new technique based on variational calculus and the use of sparse matrices is developed. In this technique, a functional is proposed, which is subsequently minimized, thus achieving that the union between the filled region and the image to be repaired is visually imperceptible. The results obtained were compared with those of the bilinear interpolation, isophote, Orthogonal Matching Pursuit (OMP) and KSVD techniques, the latter two being techniques based on sparse models. Then, the difference between the original and the resulting image was calculated considering only the areas of interest to find the number of distinct pixels and the root mean square error (RMSE). The proposed method presents better results than bilinear interpolation, Orthogonal Matching Pursuit and K-SVD, and very similar to those obtained with the Isotope technique.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.