Non-Bayesian graph matching without explicit compatibility calculations

DOI10.1007/3-540-70659-3_7MaRDI QIDQ4808929zbMATH OpenFDO

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

Publication date 12 August 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/2396/23960074.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Orthonormal kernel Kronecker product graph matching
• Kronecker product graph matching.
• A sparse nonnegative matrix factorization technique for graph matching problems
• A new algorithm for graph matching with application to content-based image retrieval
• Local entropic graphs for globally-consistent graph matching

Cited in

(2)

• Kronecker product graph matching.
• Orthonormal kernel Kronecker product graph matching

This page was built for publication: Non-Bayesian graph matching without explicit compatibility calculations

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