Optimization for automated assembly of puzzles

Sağıroğlu, Mahmut Şamil and Erçil, Aytül (2008) Optimization for automated assembly of puzzles. (Submitted)

WarningThere is a more recent version of this item available.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://www.springer.com/business/operations+research/journal/11750


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.

Item Type:Article
Subjects:T Technology > T Technology (General)
ID Code:10724
Deposited By:Aytül Erçil
Deposited On:14 Nov 2008 09:25
Last Modified:20 Dec 2010 09:35

Available Versions of this Item

Repository Staff Only: item control page