Abstract High-order graph matching utilizes the high-order relations to establish the correspondences between two sets of features. It has been formulated as an optimization problem, and this problem is an NP-hard combinatorial optimization problem. This paper presents a high-order graph matching method based on ant colony optimization. A problem-specific pheromone initialization method is introduced, meanwhile local and global pheromone updating rules are redefined. The proposed algorithm is evaluated on synthetic datasets, CMU House dataset, and real-world datasets. Experimental results demonstrate that our algorithm achieves the promising performance compared with three state-of-the-art methods.
High-order graph matching based on ant colony optimization
Yue Wu,Maoguo Gong,Wenping Ma,Shanfeng Wang
Published 2019 in Neurocomputing
ABSTRACT
PUBLICATION RECORD
- Publication year
2019
- Venue
Neurocomputing
- Publication date
2019-02-01
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-39 of 39 references · Page 1 of 1
CITED BY
Showing 1-27 of 27 citing papers · Page 1 of 1