A sparse nonnegative matrix factorization technique for graph matching problems

摘要

•We present a graph matching method based on NMF with sparse constraints.•Our sparse model can incorporate the mapping constraints approximately.•We show the link between the sparsity of the solution and its effectiveness.•Experimental results show the effectiveness of our graph matching method.