Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
