A sparse nonnegative matrix factorization technique for graph matching problems

DOI10.1016/J.PATCOG.2013.08.024MaRDI QIDQ898325zbMATH OpenOpenAlexFDO

Authors Bo Jiang, Jin Tang, Bin Luo, Hai-feng Zhao

Publication date 8 December 2015

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2013.08.024

zbMATH Keywords

graph matchingHungarian algorithmnonnegative matrix factorizationsparse model

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational methods for sparse matrices (65F50) Machine vision and scene understanding (68T45) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Graph matching with nonnegative sparse model
• Lagrangian relaxation graph matching
• A fast projected fixed-point algorithm for large graph matching
• Efficient feature matching via nonnegative orthogonal relaxation
• scientific article; zbMATH DE number 6746354

Cites work

• Attributed relational graph matching based on the nested assignment structure
• Compressed sensing
• Graph matching with nonnegative sparse model

Cited in

(9)

• Image matching from handcrafted to deep features: a survey
• Efficient feature matching via nonnegative orthogonal relaxation
• Lagrangian relaxation graph matching
• A fast projected fixed-point algorithm for large graph matching
• scientific article; zbMATH DE number 2090200 (Why is no real title available?)
• Graph matching with nonnegative sparse model
• Lightning graph matching
• A quadratic penalty method for hypergraph matching
• Non-negative sparse signal recovery with a feasible based sequential quadratic programming

This page was built for publication: A sparse nonnegative matrix factorization technique for graph matching problems

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