• DocumentCode
    1865072
  • Title

    SIFT Feature Point Matching Based on Improved RANSAC Algorithm

  • Author

    Guangjun Shi ; Xiangyang Xu ; Yaping Dai

  • Author_Institution
    Sch. of Autom., Beijing Inst. of Technol., Beijing, China
  • Volume
    1
  • fYear
    2013
  • fDate
    26-27 Aug. 2013
  • Firstpage
    474
  • Lastpage
    477
  • Abstract
    When matching the SIFT feature points, there will be lots of mismatches. The RANSAC algorithm can be used to remove the mismatches by finding the transformation matrix of these feature points. But when the data space contains a lot of mismatches, finding the right transformation matrix will be very difficult. What´s more, the probability of finding the error model is very large. Aiming at solving the problem, this paper proposed an improved RANSAC algorithm. Before using the RANSAC algorithm, we removed parts of the error feature points by two methods, one is eliminating features not belonging to the target area and the other is removing the crossing points. The two methods aimed to improve the proportion of feature points matched correctly. Experiments showed that, the improved RANSAC algorithm could find the model more accurately, improve efficiency, and make the feature point matching more accurately.
  • Keywords
    image matching; matrix algebra; probability; random processes; transforms; SIFT feature point matching; crossing points; data space; error model; improved RANSAC algorithm; probability; transformation matrix; Algorithm design and analysis; Computer vision; Data models; Estimation; Feature extraction; Object recognition; Robustness; SIFT; improved RANSAC; key point matching;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Human-Machine Systems and Cybernetics (IHMSC), 2013 5th International Conference on
  • Conference_Location
    Hangzhou
  • Print_ISBN
    978-0-7695-5011-4
  • Type

    conf

  • DOI
    10.1109/IHMSC.2013.119
  • Filename
    6643931