.png){kind=icon}
Return
A sparse nonnegative matrix factorization technique for graph matching problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2013.08.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph matching problem that incorporates pairwise constraints can be cast as an Integer Quadratic Programming (IQP). Since it is NP-hard, approximate methods are required. In this paper, a new approximate method based on nonnegative matrix factorization with sparse constraints is presented. Firstly, the graph matching is formulated as an optimization problem with nonnegative and sparse constraints, followed by an efficient algorithm to solve this constrained problem. Then, we show the strong relationship between the sparsity of the relaxation solution and its effectiveness for graph matching based on our model. A key benefit of our method is that the solution is sparse and thus can approximately impose the one-to-one mapping constraints in the optimization process naturally. Therefore, our method can approximate the original IQP problem more closely than other approximate methods. Extensive and comparative experimental results on both synthetic and real-world data demonstrate the effectiveness of our graph matching method. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Graph matching
Nonnegative matrix factorization
Sparse model
Hungarian algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveThe influence of charge ratio on transient networks of polyelectrolyte complex micelles.png)
Soft Matter
Soft MatterIF0
PREAI
ShareSaveShareSaveShareSave
View more