Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

PSQP: Puzzle Solving by Quadratic Programming

Texto completo
Autor(es):
Andalo, Fernanda A. ; Taubin, Gabriel ; Goldenstein, Siome
Número total de Autores: 3
Tipo de documento: Artigo Científico
Fonte: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; v. 39, n. 2, p. 385-396, FEB 2017.
Citações Web of Science: 9
Resumo

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. (AU)

Processo FAPESP: 12/50468-6 - Visão para o cego: traduzindo conceitos visuais 3D em informações de 3D de áudio
Beneficiário:Siome Klein Goldenstein
Modalidade de apoio: Auxílio à Pesquisa - Parceria para Inovação Tecnológica - PITE