Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models
Authors:
- 21 August 2002
- book chapter
- Published by Springer Nature
- p. 133-142
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Robust and efficient skeletal graphs2002
- Structural graph matching using the EM algorithm and singular value decompositionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- An median graphs: properties, algorithms, and applicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Recent Advances in Structural Pattern Recognition with Applications to Visual Form AnalysisLecture Notes in Computer Science, 2001
- A Unified Framework for Indexing and Matching Hierarchical Shape Structures2001
- Indexing based on edit-distance matching of shape graphs1998
- Feature-based correspondence: an eigenvector approachImage and Vision Computing, 1992
- An eigendecomposition approach to weighted graph matching problemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1988
- Spektren endlicher grafenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1957
- Measures of the Amount of Ecologic Association Between SpeciesEcology, 1945