A sparse nonnegative matrix factorization technique for graph matching problems

DOI10.1016/j.patcog.2013.08.024zbMath1326.68293OpenAlexW1986451263MaRDI QIDQ898325

Bin Luo, Bo Jiang, Jin Tang, 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

Hungarian algorithmgraph matchingnonnegative matrix factorizationsparse model

Mathematics Subject Classification ID

Related Items (2)

Lagrangian relaxation graph matching ⋮ Image matching from handcrafted to deep features: a survey

Cites Work

• Attributed relational graph matching based on the nested assignment structure
• Graph Matching with Nonnegative Sparse Model
• Compressed sensing

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