Unsupervised learning for graph matching

DOI10.1007/S11263-011-0442-2zbMATH Open1235.68274OpenAlexW2152953631MaRDI QIDQ409138FDOQ409138

Martial Hebert, Rahul Sukthankar, Marius Leordeanu

Publication date: 12 April 2012

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-011-0442-2

Recommendations

• Graph matching with nonnegative sparse model
• scientific article; zbMATH DE number 2090196
• scientific article; zbMATH DE number 1974100
• Recent advance on graph matching in computer vision: from two-graph matching to multi-graph matching
• Automatic learning of cost functions for graph edit distance

zbMATH Keywords

unsupervised learningparameter learninggraph matchingsemi-supervised learningfeature matchingMAP inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An eigendecomposition approach to weighted graph matching problems
• Unsupervised learning for graph matching
• Title not available (Why is that?)

Cited In (14)

• Unsupervised learning in space and time. A modern approach for computer vision using graph-based techniques and deep neural networks
• Unsupervised learning for graph matching
• Seeking affinity structure: strategies for improving \(m\)-best graph matching
• Title not available (Why is that?)
• Computer Vision - ECCV 2004
• Outlier robust feature correspondence by learning based matching process
• Distance metric learning for graph structured data
• Image matching from handcrafted to deep features: a survey
• Graph matching by simplified convex-concave relaxation procedure
• A Scalable Unsupervised Framework for Comparing Graph Embeddings
• ROML: a robust feature correspondence approach for matching objects in a set of images
• Vertex nomination via seeded graph matching
• Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
• Efficient feature matching via nonnegative orthogonal relaxation

This page was built for publication: Unsupervised learning for graph matching

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