Optimization for automated assembly of puzzles

The puzzle assembly problem has many application areas such as restoration and reconstruction of archeological findings, repairing of broken objects, solving jigsaw type puzzles, molecular docking problem, etc. The puzzle pieces usually include not only geometrical shape information but also visual information such as texture, color, and continuity of lines. This paper presents a new approach to the puzzle assembly problem that is based on using textural features and geometrical constraints. The texture of a band outside the border of pieces is predicted by inpainting and texture synthesis methods. Feature values are derived from these original and predicted images of pieces. An affinity measure of corresponding pieces is defined and alignment of the puzzle pieces is formulated as an optimization problem where the optimum assembly of the pieces is achieved by maximizing the total affinity measure. An fft based image registration technique is used to speed up the alignment of the pieces. Experimental results are presented on real and artificial data sets

Image Inpainting with Improved Storage Capability using DCT

Nowadays, tremendous amount of digital media is generating but having grazes on it. In this paper we proposed new idea to remove the graze from image, called image inpainting where in, Exemplar based image inpainting follows discrete cosine transform . The exemplar based image inpainting is based on copy-and-paste texture synthesis for reconstructing damaged parts of an image. Based on exemplar-matching techniques performance and speed of algorithm increases but size of image is also increases so, we proposed discrete cosine transform for reducing the size of image, removing noise and ultimately provides it good quality of image

Comparative Analysis and Evaluation of Image inpainting Algorithms

Image inpainting refers to the task of filling in the missing or damaged regions of an image in an undetectable manner. There are a large variety of image inpainting algorithms existing in the literature. They can broadly be grouped into two categories such as Partial Differential Equation (PDE) based algorithms and Exemplar based Texture synthesis algorithms. However no recent study has been undertaken for a comparative evaluation of these algorithms. In this paper, we are comparing two different types of image inpainting algorithms. The algorithms analyzed are Marcelo Bertalmio’s PDE based inpainting algorithm and Zhaolin Lu et al’s exemplar based Image inpainting algorithm.Both theoretical analysis and experiments have made to analyze the results of these image inpainting algorithms on the basis of both qualitative and quantitative way. Keywords:Image inpainting, Exemplar based, Texture synthesis, Partial Differential Equation (PDE)