Clique-Graph Matching by Preserving Global & Local Structure

Wei-Zhi Nie, An-An Liu, Zan Gao, Yu-Ting Su; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 4503-4510

Abstract


This paper originally proposes the clique-graph and further presents a clique-graph matching method by preserving global and local structures. Especially, we formulate the objective function of clique-graph matching with respective to two latent variables, the clique information in the original graph and the pairwise clique correspondence constrained by the one-to-one matching. Since the objective function is not jointly convex to both latent variables, we decompose it into two consecutive steps for optimization: 1) clique-to-clique similarity measure by preserving local unary and pairwise correspondences; 2) graph-to-graph similarity measure by preserving global clique-to-clique correspondence. Extensive experiments on the synthetic data and real images show that the proposed method can outperform representative methods especially when both noise and outliers exist.

Related Material


[pdf]
[bibtex]
@InProceedings{Nie_2015_CVPR,
author = {Nie, Wei-Zhi and Liu, An-An and Gao, Zan and Su, Yu-Ting},
title = {Clique-Graph Matching by Preserving Global & Local Structure},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}
}