Referenced Items are not available for this document.
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit distance originally used for graph-matching by Sanfeliu and Fu (1983). We show how the normalised edit distance of Marzal and Vidal (1993) can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare the resulting graph-matching algorithm with that reported by Wilson and Hancock (1997)
Published in:
Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on
(Volume:2
)
Date of Conference: 16-20 Aug 1998
- Page(s):
- 1711 - 1714 vol.2
- Meeting Date :
- 16 Aug 1998-20 Aug 1998
- ISSN :
- 1051-4651
- Print ISBN:
- 0-8186-8512-3
- INSPEC Accession Number:
- 6104172
- Conference Location :
- Brisbane, Qld.
- Digital Object Identifier :
- 10.1109/ICPR.1998.712053
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
