Graphical models and point pattern matching.
IEEE Trans Pattern Anal Mach Intell
; 28(10): 1646-63, 2006 Oct.
Article
em En
| MEDLINE
| ID: mdl-16986545
ABSTRACT
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. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.
Buscar no Google
Coleções:
01-internacional
Base de dados:
MEDLINE
Assunto principal:
Gráficos por Computador
/
Processamento de Sinais Assistido por Computador
/
Reconhecimento Automatizado de Padrão
/
Inteligência Artificial
/
Interpretação de Imagem Assistida por Computador
/
Aumento da Imagem
/
Técnica de Subtração
Tipo de estudo:
Prognostic_studies
/
Risk_factors_studies
Idioma:
En
Revista:
IEEE Trans Pattern Anal Mach Intell
Assunto da revista:
INFORMATICA MEDICA
Ano de publicação:
2006
Tipo de documento:
Article
País de afiliação:
Austrália