Year-end Sale % OFF 
Abstract
Graph matching is an essential problem in computer science and communications. It can be applied to a variety of issues such as artificial intelligence, computer vision, and communication systems. In this paper, we propose a new Graphics Processing Unit framework written in CUDA C++ specifically dedicated to geometric graph matching but providing new parallel algorithms, with low computational complexity, as the self-organizing map in the plane, and a distributed local search method. Unlike state-of-the-art graph matching algorithms, available from Matlab platform, that most often need at least O(N2) memory size, with N the problem size, our proposals only require O(N) space and allows massively parallel execution. These parallel algorithms are evaluated and compared to the state-of-the-art methods available for graph matching and following the same experimental protocol.
Published Version
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.
