Discrete particle swarm optimization for high-order graph matching

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 objec...