Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/44126| Author(s): | Francisco Paulo Marques de Oliveira João Manuel Ribeiro da Silva Tavares Todd C. Pataky |
| Title: | A versatile matching algorithm based on dynamic programming with circular order preserving |
| Issue Date: | 2009 |
| Abstract: | 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. |
| Subject: | Engenharia mecânica, Engenharia mecânica Mechanical engineering, Mechanical engineering |
| Scientific areas: | Ciências da engenharia e tecnologias::Engenharia mecânica Engineering and technology::Mechanical engineering |
| URI: | https://hdl.handle.net/10216/44126 |
| Source: | VipIMAGE 2009 - II ECCOMAS Thematic Conference on Computational Vision and Medical Image Processing |
| Document Type: | Artigo em Livro de Atas de Conferência Internacional |
| Rights: | openAccess |
| License: | https://creativecommons.org/licenses/by-nc/4.0/ |
| Appears in Collections: | FEUP - Artigo em Livro de Atas de Conferência Internacional |
This item is licensed under a Creative Commons License
