DocumentCode :
1106845
Title :
A POCS-based graph matching algorithm
Author :
Van Wyk, Barend J. ; Van Wyk, Michaël A.
Author_Institution :
French South African Tech. Inst. in Electron., Tshwane Univ. of Technol., Pretoria, South Africa
Volume :
26
Issue :
11
fYear :
2004
Firstpage :
1526
Lastpage :
1530
Abstract :
A novel projections onto convex sets (POCS) graph matching algorithm is presented. Two-way assignment constraints are enforced without using elaborate penalty terms, graduated nonconvexity, or sophisticated annealing mechanisms to escape from poor local minima. Results indicate that the presented algorithm is robust and compares favorably to other well-known algorithms.
Keywords :
graph theory; image matching; set theory; graph matching algorithm; local minima; projections onto convex sets; two way assignment constraints; Annealing; Bayesian methods; Discrete transforms; Focusing; Gold; Machine vision; Optimization methods; Polynomials; Robustness; State-space methods; Index Terms- Graph matching; contextual correspondence matching; projection onto convex sets.; subgraph matching; Algorithms; Artificial Intelligence; Cluster Analysis; Computer Graphics; Computer Simulation; Depth Perception; Image Enhancement; Image Interpretation, Computer-Assisted; Imaging, Three-Dimensional; Information Storage and Retrieval; Numerical Analysis, Computer-Assisted; Pattern Recognition, Automated; Photogrammetry; Reproducibility of Results; Sensitivity and Specificity; Signal Processing, Computer-Assisted; Subtraction Technique; User-Computer Interface;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.2004.95
Filename :
1335455
Link To Document :
بازگشت