A versatile matching algorithm based on dynamic programming with circular order preserving
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...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/44126 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/44126 |