Abstract
Abstract Graph matching is a fundamental NP-problem in computer vision and pattern recognition. In this paper, we propose a robust approximate graph matching method. The match between two graphs is formulated as an optimization problem and a novel energy function that performs random sample consensus (RANSAC) checking on the max-pooled supports is proposed. Then a belief propagation(BP) algorithm, which can assemble the spatial supports of the local neighbors in the context of the given points, is used to minimize the energy function. To achieve the one-to-(at most)-one matching constraint, we present a method for removing bad matches based on the topological structure of the graphs. Experimental results demonstrate that the proposed method outperforms other state-of-the-art graph matching methods in matching accuracy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.