A versatile matching algorithm based on dynamic programming with circular order preserving

• Type: Article in International Conference Proceedings Book
• Date: 2009

Authors

Francisco Paulo Marques de Oliveira (Author) FEUP; João Manuel Ribeiro da Silva Tavares (Author) FEUP; Todd C. Pataky (Author) Other

Conference proceedings International

Title: VipIMAGE 2009 - II ECCOMAS Thematic Conference on Computational Vision and Medical Image Processing

Pages: 269-274

VipIMAGE 2009 - II ECCOMAS Thematic Conference on Computational Vision and Medical Image Processing

Porto, Portugal, 14 a 16 de Outubro de 2009

Indexing

ISI Web of Science

Scientific classification

FOS: Engineering and technology > Mechanical engineering

CORDIS: Technological sciences > Engineering > Mechanical engineering

Other information

Abstract (EN): This paper presents an assignment algorithm with circular order preserving constraint. Given a cost affinity matrix and the desired percentage of correspondences, the algorithm implemented using dynamic programming determines the correspondence of type one-to-one of minimum global cost. Here, it was applied to optimize the global matching between two sets of ordered points that represent the contours of objects previously segmented from images. In the tests performed, we considered affinity matrices previously built based on information on curvature and distance to centroid. The results that have been obtained are better than the ones presented in previous studies, for the cases in which partial deformations or occlusions are involved.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6