IDEAS home Printed from https://ideas.repec.org/a/axf/gbppsa/v17y2025ip272-278.html

Matching Point Elimination Algorithm Based on RANSAC

Author

Listed:
  • Wei , Xiaoyan
  • Zhang , Xianmei
  • Yan, Cuicui

Abstract

In computer vision and image processing, feature matching accuracy is critical for various applications, such as image stitching and object recognition. This paper focuses on optimizing the classic Scale-Invariant Feature Transform (SIFT) algorithm, which, despite its effectiveness in feature extraction, often encounters mismatched points during the matching process, affecting overall accuracy. To address this issue, we integrate the Random Sample Consensus (RANSAC) algorithm with SIFT. RANSAC iteratively estimates model parameters and eliminates mismatched points from the initial SIFT matches. Experimental results demonstrate that the combined approach significantly improves matching accuracy, reducing errors caused by noise or repetitive patterns in images. The improved algorithm shows notable performance in real-world scenarios, ensuring more reliable results for tasks requiring high precision. This method not only boosts matching accuracy but also enhances the robustness of the feature matching process, making it applicable for advanced fields such as medical imaging, autonomous vehicles, and augmented reality. By refining the feature matching process, this paper contributes to the development of more reliable computer vision systems that can operate effectively in complex environments with a high degree of precision.

Suggested Citation

  • Wei , Xiaoyan & Zhang , Xianmei & Yan, Cuicui, 2025. "Matching Point Elimination Algorithm Based on RANSAC," GBP Proceedings Series, Scientific Open Access Publishing, vol. 17, pages 272-278.
  • Handle: RePEc:axf:gbppsa:v:17:y:2025:i::p:272-278
    as

    Download full text from publisher

    File URL: https://soapubs.com/index.php/GBPPS/article/view/1045/1027
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:axf:gbppsa:v:17:y:2025:i::p:272-278. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Yuchi Liu (email available below). General contact details of provider: https://soapubs.com/index.php/GBPPS .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.