Algorithm of dynamic programming for optimization of the global matching betwee...

• Author(s): Francisco P. M. Oliveira ; João Manuel R. S. Tavares
• Date: 2008
• Persistent ID: http://hdl.handle.net/10216/6654
• Origin: Repositório Aberto da Universidade do Porto
• Subject(s): Ciências tecnológicas; Engenharia
• Document Type: Article
• Language: Portuguese

Description

This paper presents a new assignment algorithm with order restriction. Our optimization algorithm was developed using dynamic programming. It was implemented and tested to determine the best global matching that preserves 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. \newline 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, due to the disappearance of crossed matching, which is allowed by the conventional assignment algorithms. Moreover, the computational cost of this algorithm is much lower than the ones of other three, leading to enhanced execution times.