Unifying Offline and Online Multi-graph Matching via Finding Shortest Paths on Supergraph.

This paper addresses the problem of multiple graph matching (MGM) in terms of both offline batch mode and online setting. We explore the concept of cycle-consistency over pairwise matchings and formulate the problem as finding optimal composition path on the supergraph, whose nodes refer to graphs and edge weights denote score function regarding consistency and affinity. By some theoretical study we show that the offline and online MGM on supergraph can be converted to finding all pairwise shortest paths and single-source shortest paths respectively. We adopt the Floyd algorithm [1] and shortest path faster algorithm (SPFA) [2], [3] to effectively find the optimal path. Extensive experimental results show our methods surpass two state-of-the-art MGM methods CAO-C [4] and IMGM [5], for offline and online settings respectively. Source code will be made publicly available.