This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
Search
Skip to Search Results- 2Graphical models
- 1Graph Matching
- 1Graphical Models
- 1Junction tree algorithm
- 1Point matching
- 1Point proximity functions
-
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...
-
2003
Caelli, Terry, Caetano, Tiberio, Barone, Dante
Technical report TR03-21. This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler models in which optimal inference is feasible, and contrast them to the well-known...