Graphical models and point pattern matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. Firs...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | other article |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10183/27603 |
| País: | Brasil |
| Oai: | oai:www.lume.ufrgs.br:10183/27603 |