Francisco. P. M. Oliveira1, João Manuel R. S. Tavares1
CMES-Computer Modeling in Engineering & Sciences, Vol.31, No.1, pp. 1-12, 2008, DOI:10.3970/cmes.2008.031.001
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 More >
Login
Register
