Algorithm of dynamic programming for optimization of the global matching between two contours defined by ordered points

• Tipo: Artigo em Revista Científica Internacional
• Data: 2008

Autores

Francisco P. M. Oliveira (Autor) Outra; João Manuel R. S. Tavares (Autor) FEUP

Revista

Título: CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES

Vol. 31 Nº 1

Páginas: 1-11

ISSN: 1526-1492

Editora: Tech Science Press

Indexação

ISI Web of Knowledge - 18 Citações

ISI Web of Science

Scopus - 22 Citações

INSPEC

COMPENDEX

Classificação Científica

CORDIS: Ciências Tecnológicas > Engenharia

Outras Informações

ID Authenticus: P-003-XY0

Abstract (EN): 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica