Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors

DOI10.1007/978-3-642-02124-4_15zbMath1248.68510OpenAlexW1507560488MaRDI QIDQ3637698

Diana Mateus, Avinash Sharma, David Knossow, Radu Horaud

Publication date: 14 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02124-4_15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Machine vision and scene understanding (68T45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Matching the LBO eigenspace of non-rigid shapes via high order statistics

Uses Software

• mclust

Cites Work

• Unnamed Item
• Spectral correspondence for point pattern matching
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• An eigendecomposition approach to weighted graph matching problems
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

This page was built for publication: Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors