4.7 Article

An image matching optimization algorithm based on pixel shift clustering RANSAC

期刊

INFORMATION SCIENCES
卷 562, 期 -, 页码 452-474

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2021.03.023

关键词

Image matching; Pixel shift; Clustering; RANSAC

资金

  1. National Natural Science Foundation of China [11705122]
  2. Science and Technology Program of Sichuan [2020YFH0124]
  3. Guangdong Basic and Applied Basic Research Foundation [2021A1515011342]
  4. Zigong Key Science and Technology Project of China [2020YGJC01]

向作者/读者索取更多资源

This paper introduces a matching optimization algorithm called PSC-RANSAC, which enhances image matching accuracy by using density peaks clustering to select mismatches and effectively eliminating residual mismatches compared to other algorithms.
This paper focuses on improving the accuracy of image matching by eliminating the residual mismatches in the matching results of standard RANSAC. Based on pixel shift clustering and RANSAC algorithms, a matching optimization algorithm called pixel shift clustering RANSAC, PSC-RANSAC in short, is proposed in this paper. Firstly, the pixel shift model of space point from two perspectives are established by parallax principle and camera projection model. Then, based on the established pixel shift model, density peaks clustering (DPC) algorithm is used to select the mismatches out to enhance the accuracy of image matching. Meanwhile the comparisons among PSC-RANSAC, standard RANSAC, progressive sample consensus and graph-cut RANSAC show that PSC-RANSAC can more effectively and robustly eliminate the residual mismatches in initial matching results. The proposed method provides an effective tool for optimization on image matching. (c) 2021 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据