Graph Matching Based on Stochastic Perturbation

Chengcai Leng, Wei Xu, Irene Cheng, Anup Basu

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This paper presents a novel perspective on characterizing the spectral correspondence between the nodes of weighted graphs for image matching applications. The algorithm is based on the principal feature components obtained by stochastic perturbation of a graph. There are three areas of contributions in this paper. First, a stochastic normalized Laplacian matrix of a weighted graph is obtained by perturbing the matrix of a sensed graph model. Second, we obtain the eigenvectors based on an eigen-decomposition approach, where representative elements of each row of this matrix can be considered to be the feature components of a feature point. Third, correct correspondences are determined in a low-dimensional principal feature component space between the graphs. In order to further enhance image matching, we also exploit the random sample consensus algorithm, as a post-processing step, to eliminate mismatches in feature correspondences. The experiments on synthetic and real-world images demonstrate the effectiveness and accuracy of the proposed method.

Original languageEnglish
Article number7206600
Pages (from-to)4862-4875
Number of pages14
JournalIEEE Transactions on Image Processing
Volume24
Issue number12
DOIs
StatePublished - 1 Dec 2015

Keywords

  • Graph matching
  • image matching
  • principal feature component
  • random sample consensus (RANSAC)
  • stochastic perturbation

Fingerprint

Dive into the research topics of 'Graph Matching Based on Stochastic Perturbation'. Together they form a unique fingerprint.

Cite this