Deakin University
Browse

File(s) not publicly available

A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metrics

conference contribution
posted on 2004-01-01, 00:00 authored by T S Caetano, Terry CaelliTerry Caelli, D A C Barone
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 point metrics and under different levels of additive noise. Results show that, no matter which of the metrics is applied, our technique is more effective than probabilistic relaxation labeling for large graph sizes. For small graph sizes, our technique is still preferable for two of the metrics, while for the third one both techniques perform similarly.

History

Volume

2

Pagination

124 - 127

ISSN

1051-4651

Publication classification

E1.1 Full written paper - refereed

Title of proceedings

Proceedings - International Conference on Pattern Recognition

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC