Abstract

A new method of model registration is proposed using graphical templates. A graph of landmarks is chosen in the template image. All possible candidates for these landmarks are found in the data image using local operators. A dynamic programming algorithm on decomposable subgraphs of the template graph finds the optimal match to a subset of the candidate points in polynomial time. This combination of local operators to describe points of interest/landmarks and a graph to describe their geometric orientation in the plane, yields fast and precise matches of the model to the data, with no initialization required.

Keywords

InitializationTemplateComputer scienceImage registrationArtificial intelligenceGraphGraphical modelComputer visionPattern recognition (psychology)AlgorithmImage (mathematics)Theoretical computer science

Affiliated Institutions

Related Publications

Publication Info

Year
1996
Type
article
Volume
18
Issue
3
Pages
225-236
Citations
130
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

130
OpenAlex

Cite This

Yali Amit, Augustine Kong (1996). Graphical templates for model registration. IEEE Transactions on Pattern Analysis and Machine Intelligence , 18 (3) , 225-236. https://doi.org/10.1109/34.485529

Identifiers

DOI
10.1109/34.485529