Solving image puzzles with a simple quadratic programming formulation

XXV Conference on Graphics, Patterns and Images (SIBGRAPI), Ouro Preto, MG, Brazil, 2012

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.

BibTeX

@inproceedings{andalo12sibgrapi,
    authors      = “Fernanda A. Andal{\‘o} and Gabriel Taubin and Siome Goldenstein”,
    title        = “Solving image puzzles with a simple quadratic programming formulation”,
    booktitle    = “{XXV} Conference on Graphics, Patterns and Images ({SIBGRAPI})”,
    year         = 2012,
    address      = “Ouro Preto, MG, Brazil”,
}