title: A POCS-based graph matching algorithm.
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.
authors.affiliation: French South African Technical Institute in Electronics, Tshwane University of Technology, Private Bag X680, Pretoria, 0001, South Africa. ben.van.wyk@fsatie.ac.za
authors.forename: Barend J
authors.initials: BJ
authors.lastname: van Wyk
authors.forename: Michael A
authors.initials: MA
authors.lastname: van Wyk
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D003196:Computer Graphics; D003198:Computer Simulation; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods; D016247:Information Storage and Retrieval / Q000379:methods*; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted; D013382:Subtraction Technique; D014584:User-Computer Interface