A POCS-based graph matching algorithm

IEEE Trans Pattern Anal Mach Intell. 2004 Nov;26(11):1526-30. doi: 10.1109/tpami.2004.95.

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.

Publication types

  • Comparative Study
  • Evaluation Study
  • Validation Study

MeSH terms

  • 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