Weighted graph-matching using modal clusters

DOI10.1007/3-540-44692-3_18MaRDI QIDQ4780826zbMATH OpenFDO

Authors Marco Carcassoni, Edwin R. Hancock

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2124/21240142

zbMATH Keywords

eigendecomposition methodpattern recognitionweighted graph matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Weighted clustering of attributed multi-graphs
• An eigendecomposition approach to weighted graph matching problems
• Exact clustering of weighted graphs via semidefinite programming
• A dynamical systems approach to weighted graph matching
• Graph clustering using the weighted minimum common supergraph
• On Finding Graph Clusterings with Maximum Modularity
• Inexact multisubgraph matching using graph eigenspace and clustering models

Cited in

(7)

• An algorithm for weighted sub-graph matching based on gradient flows
• A long trip in the charming world of graphs for pattern recognition
• Spectral correspondence for point pattern matching
• A hierarchical framework for spectral correspondence
• A distance measure for large graphs based on prime graphs
• Structural, Syntactic, and Statistical Pattern Recognition
• Retrieval of textured images through the use of quantization and modal analysis

This page was built for publication: Weighted graph-matching using modal clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780826)