Adaptively Transforming Graph Matching

Fudong Wang, Nan Xue, Yipeng Zhang, Xiang Bai, Gui-Song Xia; Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 625-640


Recently, many graph matching methods that incorporate pairwise constraints and that can be formulated as a quadratic assignment problem (QAP) have been proposed. Although these methods demonstrate promising results for the graph matching problem, they have high complexity in space or time. In this paper, we introduce an adaptively transforming graph matching (ATGM) method from the perspective of functional representation. More precisely, under a transformation formulation, we aim to match two graphs by minimizing the discrepancy between the original graph and the transformed graph. With a linear representation map of the transformation, the pairwise edge attributes of graphs are explicitly represented by unary node attributes, which enables us to reduce the space and time complexity significantly. Due to an efficient Frank-Wolfe method-based optimization strategy, we can handle graphs with hundreds and thousands of nodes within an acceptable amount of time. Meanwhile, because transformation map can preserve graph structures, a domain adaptation-based strategy is proposed to remove the outliers. The experimental results demonstrate that our proposed method outperforms the state-of-the-art graph matching algorithms.

Related Material

[pdf] [arXiv]
author = {Wang, Fudong and Xue, Nan and Zhang, Yipeng and Bai, Xiang and Xia, Gui-Song},
title = {Adaptively Transforming Graph Matching},
booktitle = {Proceedings of the European Conference on Computer Vision (ECCV)},
month = {September},
year = {2018}