Artículos de revistas
Psqp: Puzzle Solving By Quadratic Programming
Registro en:
Ieee Transactions On Pattern Analysis And Machine Intelligence . Ieee Computer Soc , v. 39, p. 385 - 396, 2017.
0162-8828
1939-3539
WOS:000395553400013
10.1109/TPAMI.2016.2547394
Autor
Andalo
Fernanda A.; Taubin
Gabriel; Goldenstein
Siome
Institución
Resumen
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability. 39 2 385 396 CNPq [201238/2010-1, 308882/2013-0, 454082/2014-2] FAPERJ CAPES [E-26/103.665/2012] US National Science Foundation (NSF) [IIS-0808718, CCF-0915661, IIP-1330139] FAPESP [2012/50468-6] Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)