Graph matching with nonnegative sparse model
From MaRDI portal
Publication:4922145
DOI10.1007/978-3-642-38221-5_5zbMATH Open1382.68171OpenAlexW144368257MaRDI QIDQ4922145FDOQ4922145
Authors: Bo Jiang, Jin Tang, Bin Luo 
Publication date: 28 May 2013
Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38221-5_5
Recommendations
- A sparse nonnegative matrix factorization technique for graph matching problems
- scientific article; zbMATH DE number 6746354
- Lagrangian relaxation graph matching
- Recent advance on graph matching in computer vision: from two-graph matching to multi-graph matching
- scientific article; zbMATH DE number 2090196
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)
Cited In (12)
- A quadratic penalty method for hypergraph matching
- Unsupervised learning for graph matching
- Recent advance on graph matching in computer vision: from two-graph matching to multi-graph matching
- An efficient algorithm for bounded spectral matching with affine constraint.
- Lagrangian relaxation graph matching
- Fast exact hyper-graph matching with dynamic programming for spatio-temporal data
- Structural, Syntactic, and Statistical Pattern Recognition
- A sparse nonnegative matrix factorization technique for graph matching problems
- Sequential decision model for inference and prediction on nonuniform hypergraphs with application to knot matching from computational forestry
- Graph matching based on dot product representation of graphs
- Efficient feature matching via nonnegative orthogonal relaxation
- Title not available (Why is that?)
This page was built for publication: Graph matching with nonnegative sparse model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922145)
