Sensitivity analysis for structural matching
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 62-66 vol.1
- https://doi.org/10.1109/icpr.1996.545992
Abstract
The aim of this paper is to explore the sensitivity of relational matching to attribute and structural information. Broadly speaking there are two main aspects to this study. First, we determine the relative importance of attribute and structural information in matching noise corrupted graphs. The second aspect of our analysis concerns the nature of the relational structures used in matching. Here we compare the matching results obtained using four different graph structures, namely the Delaunay graph, the N-nearest neighbour graph, the Gabriel graph and the relative neighbourhood graph. Our results are presented as noise sensitivity curves. The main conclusion of the study is that attributes are essential when the fractional corruption exceeds 20% and that the Delaunay graph has optimal noise robustness.Keywords
This publication has 9 references indexed in Scilit:
- Relational matching with dynamic graph structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Gauging relational consistency and correcting structural errorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- Relational matching by discrete relaxationImage and Vision Computing, 1995
- Relative sensitivity of a family of closest-point graphs in computer vision applicationsPattern Recognition, 1991
- CAD-based computer vision: from CAD models to relational graphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Stereo correspondence through feature grouping and maximal cliquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Structural stereopsis for 3-D visionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A Metric for Comparing Relational DescriptionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983