Related Experiment Videos
A POCS-based graph matching algorithm
Barend J van Wyk1, Michael A van Wyk
1French South African Technical Institute in Electronics, Tshwane University of Technology, Private Bag X680, Pretoria, 0001, South Africa. ben.van.wyk@fsatie.ac.za
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.
Related Concept Videos
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
Graphical Representation of Inequalities
Graphs of Two-Variable Functions
Graphs of Functions
Graphs of Equations in Two Variables
Wilcoxon Signed-Ranks Test for Matched Pairs