A POCS-based graph matching algorithm

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 al...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence 2004-11, Vol.26 (11), p.1526
Main Authors: van Wyk, Barend J, van Wyk, Michael A
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Cluster Analysis
Computer Graphics
Computer Simulation
Image Enhancement - methods
Image Interpretation, Computer-Assisted - methods
Imaging, Three-Dimensional - methods
Information Storage and Retrieval - methods
Numerical Analysis, Computer-Assisted
Pattern Recognition, Automated
Reproducibility of Results
Sensitivity and Specificity
Signal Processing, Computer-Assisted
Subtraction Technique
User-Computer Interface
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0162-8828
DOI:10.1109/TPAMI.2004.95