This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results-
A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metrics
Download2004
Barone, Dante, Caelli, Terry, Caetano, Tiberio
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...
-
2004
Barone, Dante, Caetano, Tiberio, Caelli, Terry
Technical report TR04-03. We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relations over a simple triangulated graph that retains the same informational content as the...