DocumentCode :
2542642
Title :
Solving Image Puzzles with a Simple Quadratic Programming Formulation
Author :
Andalo, Fernanda A. ; Taubin, Gabriel ; Goldenstein, S.
Author_Institution :
Inst. of Comput., Univ. of Campinas (UNICAMP), Campinas, Brazil
fYear :
2012
fDate :
22-25 Aug. 2012
Firstpage :
63
Lastpage :
70
Abstract :
We present a new formulation to automatically solve jigsaw puzzles considering only the information contained on the image. Our formulation maps the problem of solving a jigsaw puzzle to the maximization of a constrained quadratic function that can be solved by a numerical method. The proposed method is deterministic and it can handle arbitrary rectangular pieces. We tested the validity of the method to solve problems up to 3300 puzzle pieces, and we compared our results to the current state-of-the-art, obtaining superior accuracy.
Keywords :
image processing; numerical analysis; quadratic programming; arbitrary rectangular pieces; constrained quadratic function; formulation maps; image puzzles; jigsaw puzzles; maximization; numerical method; quadratic programming formulation; Accuracy; Equations; Image color analysis; Optimization; Shape; Tiles; Vectors; image analysis; image puzzle; jigsaw puzzle; quadratic programming;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Graphics, Patterns and Images (SIBGRAPI), 2012 25th SIBGRAPI Conference on
Conference_Location :
Ouro Preto
ISSN :
1530-1834
Print_ISBN :
978-1-4673-2802-9
Type :
conf
DOI :
10.1109/SIBGRAPI.2012.18
Filename :
6382740
Link To Document :
بازگشت