High-order graph matching based on ant colony optimization
Authors:
- Yue WuYue Wu
- Maoguo GongMGMaoguo Gong
- Wenping MaWMWenping Ma
- Shanfeng WangSWShanfeng Wang
- 1 February 2019
- journal article
- conference paper
- Published by Elsevier in Neurocomputing
- Vol. 328, 97-104
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61702392, 61772396, 61472302, 61772392, 61672409)
- China Postdoctoral Science Foundation (2018T111022, 2017M623127)
This publication has 32 references indexed in Scilit:
- Ant colony optimization theory: A surveyTheoretical Computer Science, 2005
- Weighted matchings for dense stereo correspondencePattern Recognition, 2000
- Ant colonies for the quadratic assignment problemJournal of the Operational Research Society, 1999
- The ant system applied to the quadratic assignment problemIEEE Transactions on Knowledge and Data Engineering, 1999
- Face recognition by elastic bunch graph matchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
- Local grayvalue invariants for image retrievalIEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- A graduated assignment algorithm for graph matchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic MatricesThe Annals of Mathematical Statistics, 1964