1. Discrete particle swarm optimization for high-order graph matching.
- Author
-
Gong, Maoguo, Wu, Yue, Cai, Qing, Ma, Wenping, Qin, A.K., Wang, Zhenkun, and Jiao, Licheng
- Subjects
- *
PARTICLE swarm optimization , *DISCRETE systems , *GRAPH theory , *MATCHING theory , *NP-hard problems , *ALGORITHMS - 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. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF