ERA

Download the full-sized PDF of A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metricsDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3V40K53Q

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

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

Descriptions

Author or creator
Caetano, Tiberio
Caelli, Terry
Barone, Dante
Additional contributors
Subject/Keyword
Point proximity functions
Point matching
Graphical models
Type of item
Computing Science Technical Report
Computing science technical report ID
TR04-04
Language
English
Place
Time
Description
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 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.
Date created
2004
DOI
doi:10.7939/R3V40K53Q
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-24T23:01:08.147+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 392005
Last modified: 2015:10:12 20:38:18-06:00
Filename: TR04-04.pdf
Original checksum: 8fd5475d710afbdf648a4e6280c89cf2
Well formed: true
Valid: true
Page count: 7
Activity of users you follow
User Activity Date