Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
392947 | Information Sciences | 2016 | 14 Pages |
Abstract
High-order graph matching aims at establishing correspondences between two sets of feature points using high-order constraints. It is usually formulated as an NP-hard problem of maximizing an objective function. This paper introduces a discrete particle swarm optimization algorithm for resolving high-order graph matching problems, which incorporates several re-defined operations, a problem-specific initialization method based on heuristic information, and a problem-specific local search procedure. The proposed algorithm is evaluated on both synthetic and real-world datasets. Its outstanding performance is validated in comparison with three state-of-the-art approaches.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Maoguo Gong, Yue Wu, Qing Cai, Wenping Ma, A.K. Qin, Zhenkun Wang, Licheng Jiao,