SearchSkip to Search Results
A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metricsDownload
Technical report TR04-04. We have developed a polynomial time optimal method for a class of attributed graph matching problems using the Junction Tree algorithm from Graphical Models. In this paper we compare this method with standard probabilistic relaxation labeling using different forms of...