Abstract
This paper presents an effective dissimilarity measure for geometric graphs representing shapes. The proposed dissimilarity measure is a distance that combines a sparsification of the geometric graph based on the maximum diversity problem and a new node embedding that captures the topological neighborhood of nodes. The sparsification step aims to reduce the size of the graph and to correct the misdistribution of nodes on the geometric graph induced by the noise of image handling. Experimental evaluation shows that the sparsification algorithm retains the form of the shapes while decreasing the number of processed nodes which reduces the overall matching time. Furthermore, the proposed node embedding and similarity measure give better performance in comparison with existing graph matching approaches.
Sign-in/Register to access full text options 
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.
