A versatile matching algorithm based on dynamic programming with circular order preserving
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Outros Autores: | , |
Tipo de documento: | Livro |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | https://hdl.handle.net/10216/44126 |
Resumo: | 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. |
id |
RCAP_495693cbe0e233be5856edf090e2d29a |
---|---|
oai_identifier_str |
oai:repositorio-aberto.up.pt:10216/44126 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A versatile matching algorithm based on dynamic programming with circular order preservingEngenharia mecânica, Engenharia mecânicaMechanical engineering, Mechanical engineeringThis 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.20092009-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bookapplication/pdfhttps://hdl.handle.net/10216/44126engFrancisco Paulo Marques de OliveiraJoão Manuel Ribeiro da Silva TavaresTodd C. Patakyinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-29T15:04:28Zoai:repositorio-aberto.up.pt:10216/44126Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T00:15:02.018077Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A versatile matching algorithm based on dynamic programming with circular order preserving |
title |
A versatile matching algorithm based on dynamic programming with circular order preserving |
spellingShingle |
A versatile matching algorithm based on dynamic programming with circular order preserving Francisco Paulo Marques de Oliveira Engenharia mecânica, Engenharia mecânica Mechanical engineering, Mechanical engineering |
title_short |
A versatile matching algorithm based on dynamic programming with circular order preserving |
title_full |
A versatile matching algorithm based on dynamic programming with circular order preserving |
title_fullStr |
A versatile matching algorithm based on dynamic programming with circular order preserving |
title_full_unstemmed |
A versatile matching algorithm based on dynamic programming with circular order preserving |
title_sort |
A versatile matching algorithm based on dynamic programming with circular order preserving |
author |
Francisco Paulo Marques de Oliveira |
author_facet |
Francisco Paulo Marques de Oliveira João Manuel Ribeiro da Silva Tavares Todd C. Pataky |
author_role |
author |
author2 |
João Manuel Ribeiro da Silva Tavares Todd C. Pataky |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Francisco Paulo Marques de Oliveira João Manuel Ribeiro da Silva Tavares Todd C. Pataky |
dc.subject.por.fl_str_mv |
Engenharia mecânica, Engenharia mecânica Mechanical engineering, Mechanical engineering |
topic |
Engenharia mecânica, Engenharia mecânica Mechanical engineering, Mechanical engineering |
description |
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. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009 2009-01-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/book |
format |
book |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://hdl.handle.net/10216/44126 |
url |
https://hdl.handle.net/10216/44126 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136070765379584 |