Algorithm of Dynamic Programming for Optimization of the Global Matching between Two Contours Defined by Ordered Points
Francisco. P. M. Oliveira; and Jo ~ a o Manuel R. S. Tavares

doi:10.3970/cmes.2008.031.001
Source CMES: Computer Modeling in Engineering & Sciences, Vol. 31, No. 1, pp. 1-12, 2008
Download Full length paper in PDF format. Size = 176,629 bytes
Keywords Image analysis, contours matching, optimization, dynamic programming.
Abstract 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.
PDF download PDF