A graph matching algorithm based on filtering strategy of Bi-directional K-Nearest-Neighbors
DOI:
Author:
Affiliation:

Shanghai Maritime University,Shanghai Maritime University,Shanghai Maritime University,Shanghai Maritime University,Shanghai Institute of Technical Physics, Chinese Academy of Sciences,Shanghai Institute of Technical Physics, Chinese Academy of Sciences

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, a novel graph matching algorithm, called Filtering Bi-directional K-Nearest-Neighbors Strategy (Filtering BiKNN Strategy) is presented to solve the pseudo isomorphic graph matching for remote sensing images with large affine transformation, similar patterns or from multisource sensors. BiKNN was proposed to describe the adjacent relationships of feature points. Filtering strategy is used to eliminate dubious matches of pseudo isomorphism for restrict constraints. Any BiKNN vertices of candidate outliers treated as outliers in latter iterations are rechecked with the expanded BiKNN respectively. Candidate outliers with stable graph structures are recovered to the residual sets. Three typical remote sensing images and twenty image pairs were utilized to evaluate the performance. Compared with random sample consensus (RANSAC), graphing transformation matching (GTM) and the proposed BiKNN matching, Filtering BiKNN Strategy can deal with pseudo isomorphism and obtain the highest recall and precision.

    Reference
    Related
    Cited by
Get Citation

ZHAO Ming, AN Bo-Wen, WANG Tian-Zhen, XU Yuan-Yuan, LIN Chang-Qing, SUN Sheng-Li. A graph matching algorithm based on filtering strategy of Bi-directional K-Nearest-Neighbors[J]. Journal of Infrared and Millimeter Waves,2014,33(1):78~83

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 10,2012
  • Revised:February 02,2013
  • Adopted:February 26,2013
  • Online: April 03,2014
  • Published: