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

PDE Face: A Novel 3D Face Model

YesWe introduce a novel approach to face models, which exploits the use of Partial Differential Equations (PDE) to generate the 3D face. This addresses some common problems of existing face models. The PDE face benefits from seamless merging of surface patches by using only a relatively small number of parameters based on boundary curves. The PDE face also provides users with a great degree of freedom to individualise the 3D face by adjusting a set of facial boundary curves. Furthermore, we introduce a uv-mesh texture mapping method. By associating the texels of the texture map with the vertices of the uv mesh in the PDE face, the new texture mapping method eliminates the 3D-to-2D association routine in texture mapping. Any specific PDE face can be textured without the need for the facial expression in the texture map to match exactly that of the 3D face model