Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4946874 | Neurocomputing | 2017 | 6 Pages |
Abstract
Graph matching is a fundamental problem in artificial intelligence and structural data processing. Hypergraph matching has recently become popular in the graph matching community. Existing hypergraph matching algorithms usually resort to the continuous methods, while the combinatorial nature of hypergraph matching is not well considered. Therefore in this paper, we propose a novel hypergraph matching algorithm by introducing the affinity tensor updating based graduated projection. Specifically, the hypergraph matching problem is first formulated as a combinatorial optimization problem in a high order polynomial form. Then this NP-hard problem is relaxed and interpreted in a probabilistic manner, which is approximately solved by iterative techniques. The updating of the affinity tensor is performed in each iteration, besides the updating of probabilistic assignment vector. Experimental results on both synthetic and real-world datasets witness the effectiveness of the proposed method.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Xu Yang, Zhi-Yong Liu, Hong Qiao, Jian-Hua Su,