A POCS-based graph matching algorithm

@article{Wyk2004APG,
  title={A POCS-based graph matching algorithm},
  author={B. J. van Wyk and M. A. van Wyk},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2004},
  volume={26},
  pages={1526-1530}
}
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. 
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

5 Figures & Tables

Topics

Statistics

0510'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.