Please use this identifier to cite or link to this item:
Author(s): Francisco P. M. Oliveira
João Manuel R. S. Tavares
Title: Algorithm of dynamic programming for optimization of the global matching between two contours defined by ordered points
Issue Date: 2008
Abstract: This work presents a new assignment algorithm with order restriction. Our algorithm was developed using the optimization technique of dynamic programming. It was implemented and tested to determine the best global matching that respects the order of the points that define two contours to be matched. In the experimental tests done, we used the affinity matrix obtained via the method proposed by Shapiro based on geometric modeling and modal matching.The proposed algorithm revealed an optimum performance, when compared with classic assignment algorithms: Hungarian method, Simplex for Flow Problems and LAPm. Indeed, the quality of the matching improved when compared with these three algorithms, because the crossed matching, allowed by the conventional assignment algorithms, disappeared. Besides, the computational cost of our new algorithm is very low in comparison with the other three, resulting lesser execution times.
Subject: Engenharia
Source: ICCES08
Document Type: Artigo em Livro de Atas de Conferência Internacional
Rights: restrictedAccess
Appears in Collections:FEUP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:
File Description SizeFormat 
  Restricted Access
66.51 kBAdobe PDF    Request a copy from the Author(s)

This item is licensed under a Creative Commons License Creative Commons