Abstract

Spectral matching is an efficient approach for inexact graph matching. Many spectral matching methods boil down to power iteration which calculate the confidence vector iteratively. Inspired by the Web page ranking method Hypertext Induced Topic Search (HITS), we introduce hubness vector and authority vector to replace the traditional confidence vector, and an iterative algorithm is proposed to solve the subgraph matching problem. The incorporation of hubness and authority can help reduce the distraction caused by outliers, and provides better robustness against outliers. The performance of the proposed algorithm is evaluated on both synthetic graphs and real-world images.

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 call

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.