Graph matching with nonnegative sparse model
From MaRDI portal
Publication:4922145
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
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
- scientific article; zbMATH DE number 2090196 (Why is no real title available?)
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)