Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
From MaRDI portal
Publication:3637698
Recommendations
Cites work
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- An eigendecomposition approach to weighted graph matching problems
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Spectral correspondence for point pattern matching
Cited in
(7)- Computer Vision - ECCV 2004
- scientific article; zbMATH DE number 2090206 (Why is no real title available?)
- Inexact graph matching using a hierarchy of matching processes
- Graph-Based Representations in Pattern Recognition
- A spectral-multiplicity-tolerant approach to robust graph matching
- Structural, Syntactic, and Statistical Pattern Recognition
- Matching the LBO eigenspace of non-rigid shapes via high order statistics
This page was built for publication: Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637698)