Orthonormal kernel Kronecker product graph matching

DOI10.1007/3-540-45028-9_10MaRDI QIDQ4450796zbMATH OpenFDO

Authors Barend Jacobus Van Wyk, Michaël Antonie Van Wyk

Publication date 16 February 2004

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/2726/27260107.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Non-Bayesian graph matching without explicit compatibility calculations
• Kronecker product graph matching.
• Edit distance based kernel functions for attributed graph matching
• Attributed relational graph matching based on the nested assignment structure
• Local entropic graphs for globally-consistent graph matching

Cited in

(3)

• Kronecker product graph matching.
• Correspondence matching using kernel principal components analysis and label consistency constraints
• Non-Bayesian graph matching without explicit compatibility calculations

This page was built for publication: Orthonormal kernel Kronecker product graph matching

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