Optimization of the global matching between two contours defined by ordered points using an algorithm based on dynamic programming
This paper presents a new assignment algorithm with order restriction, developed using the paradigm of dynamic programming. The algorithm was implemented and tested to determine the best global matching between two sets of points that represent the contours to be matched. In the experimental tests d...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2008
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/6643 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/6643 |