Local entropic graphs for globally-consistent graph matching

DOI10.1007/978-3-540-31988-7_33MaRDI QIDQ5316484zbMATH OpenOpenAlexFDO

Authors Miguel A. Lozano, F. Escolano

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107037

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Recommendations

• A significant improvement of Softassign with diffusion kernels
• Graph similarity through entropic manifold alignment
• Edit distance based kernel functions for attributed graph matching
• Subgraph transformations for the inexact matching of attributed relational graphs
• The graph matching problem

Cited in

(6)

• Data graph formulation as the minimum-weight maximum-entropy problem
• Orthonormal kernel Kronecker product graph matching
• Graph similarity through entropic manifold alignment
• Non-Bayesian graph matching without explicit compatibility calculations
• A comparison of least squares and spectral methods for attributed graph matching
• A significant improvement of Softassign with diffusion kernels

This page was built for publication: Local entropic graphs for globally-consistent graph matching

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