Multiple path exploration for graph matching

Abstract

The graph matching problem is a hot topic in machine vision. Although a myriad of matching algorithms have been proposed during decades of investigation, it is still a challenging issue because of the combinatorial nature. As one of the outstanding graph matching algorithms, the graduated nonconvexity and concavity procedure follows the path following algorithm. The main drawback of this approach lies that there may exist singular points which violate the smoothness of the solution path and thus harm the accuracy of matching. Addressing this problem, we develop a novel algorithm to bypass this pitfall to improve the matching accuracy. We design an effective method of singular point discovering by checking the smoothness of the path and subsequently explore multiple smooth curves at detected points for better matching results. For evaluation, we make comparisons between our approach and several outstanding matching algorithms on three popular benchmarks, and the results reveal the advantage of our approach.

http://ift.tt/2qSXJgk