Spectral correspondence for point pattern matching

DOI10.1016/S0031-3203(02)00054-7zbMath1010.68161OpenAlexW2150138094WikidataQ60431422 ScholiaQ60431422MaRDI QIDQ1856662

Marco Carcassoni, Edwin R. Hancock

Publication date: 11 February 2003

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(02)00054-7

zbMATH Keywords

sequence analysiseigenvectorspoint pattern matchingproximity matrixrobust error kernel

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items

Approximating the problem, not the solution: an alternative view of point set matching ⋮ A dynamic generating graphical model for point-sets matching ⋮ Graph-based point drift: graph centrality on the registration of point-sets ⋮ NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES ⋮ Point pattern matching algorithm for planar point sets under Euclidean transform ⋮ Correspondence matching using kernel principal components analysis and label consistency constraints ⋮ Classifying transformation-variant attributed point patterns ⋮ Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors

Cites Work

• Unnamed Item
• Unnamed Item
• An eigendecomposition approach to weighted graph matching problems
• Modelbase Partitioning Using Property Matrix Spectra
• Structural Matching with Active Triangulations