基于点加权策略的基本矩阵估计算法

Shi Xiangbin, Liu Fang, Wang Yue, M. Mingming, Jin Ling
{"title":"基于点加权策略的基本矩阵估计算法","authors":"Shi Xiangbin, Liu Fang, Wang Yue, M. Mingming, Jin Ling","doi":"10.1109/ICVRV.2011.45","DOIUrl":null,"url":null,"abstract":"Estimating Fundamental matrix from corresponding points is an important problem in the field of computer vision. The random sample consensus (RANSAC) is one of the most effective methods for Fundamental matrix estimation. In this paper a point weighting strategy is added to RANSAC in order to improve the efficiency. The algorithm gives initial weight to each point, and the weight of corresponding points are changed according to the evaluation value of fundamental matrix computed in each sampling. The weight of points will affect the probability of points to be extracted, and the inliers which have a larger weight than outlier will be more likely to be extracted. The fundamental matrix computed in each sampling is evaluated by the weight of corresponding points, and the weight of the corresponding points are updated in turn, so the whole process forms a positive feedback. Experimental results on synthetic data and real images demonstrated that the new algorithm is valid and robust.","PeriodicalId":239933,"journal":{"name":"2011 International Conference on Virtual Reality and Visualization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Fundamental Matrix Estimation Algorithm Based on Point Weighting Strategy\",\"authors\":\"Shi Xiangbin, Liu Fang, Wang Yue, M. Mingming, Jin Ling\",\"doi\":\"10.1109/ICVRV.2011.45\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Estimating Fundamental matrix from corresponding points is an important problem in the field of computer vision. The random sample consensus (RANSAC) is one of the most effective methods for Fundamental matrix estimation. In this paper a point weighting strategy is added to RANSAC in order to improve the efficiency. The algorithm gives initial weight to each point, and the weight of corresponding points are changed according to the evaluation value of fundamental matrix computed in each sampling. The weight of points will affect the probability of points to be extracted, and the inliers which have a larger weight than outlier will be more likely to be extracted. The fundamental matrix computed in each sampling is evaluated by the weight of corresponding points, and the weight of the corresponding points are updated in turn, so the whole process forms a positive feedback. Experimental results on synthetic data and real images demonstrated that the new algorithm is valid and robust.\",\"PeriodicalId\":239933,\"journal\":{\"name\":\"2011 International Conference on Virtual Reality and Visualization\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Virtual Reality and Visualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICVRV.2011.45\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Virtual Reality and Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVRV.2011.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

从对应点估计基本矩阵是计算机视觉领域的一个重要问题。随机样本一致性(RANSAC)是最有效的基本矩阵估计方法之一。为了提高RANSAC算法的效率,本文在RANSAC算法中加入了点加权策略。该算法为每个点赋予初始权值,并根据每次采样计算的基本矩阵的评价值改变相应点的权值。点的权重会影响点被提取的概率,权重大于离群点的内线更容易被提取。每次采样计算的基本矩阵通过对应点的权值进行评估,并依次更新对应点的权值,整个过程形成正反馈。在合成数据和真实图像上的实验结果表明了新算法的有效性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fundamental Matrix Estimation Algorithm Based on Point Weighting Strategy
Estimating Fundamental matrix from corresponding points is an important problem in the field of computer vision. The random sample consensus (RANSAC) is one of the most effective methods for Fundamental matrix estimation. In this paper a point weighting strategy is added to RANSAC in order to improve the efficiency. The algorithm gives initial weight to each point, and the weight of corresponding points are changed according to the evaluation value of fundamental matrix computed in each sampling. The weight of points will affect the probability of points to be extracted, and the inliers which have a larger weight than outlier will be more likely to be extracted. The fundamental matrix computed in each sampling is evaluated by the weight of corresponding points, and the weight of the corresponding points are updated in turn, so the whole process forms a positive feedback. Experimental results on synthetic data and real images demonstrated that the new algorithm is valid and robust.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信