A semi-analytic method of determining stereo camera geometry from matched points in a pair of images: Coincident meridional planes, exact or noisy data

Harit P Trivedi
{"title":"A semi-analytic method of determining stereo camera geometry from matched points in a pair of images: Coincident meridional planes, exact or noisy data","authors":"Harit P Trivedi","doi":"10.1016/0734-189X(90)90005-G","DOIUrl":null,"url":null,"abstract":"<div><p>We describe a novel semi-analytic method to determine the parameters of stereo camera geometry from pairs of matched points under the restriction of coincident meridional lanes. By a judicious choice of variables to represent rotation and translation, the noise-free problem reduces to solving two quadratics—one in each variable. With noissy data, the least squares problem reduces to a fifth-degree polynomial in a single variable, all the solutions of which can be (numerically) exactly computed along with an estimate of the standard deviation. The problem of locating the global minimum of the error function in two variables (which generally admits an unpredictable number of local extrema) in this instance becomes that of comparing five numbers. <em>The global minimum can therefore be guaranteed</em>. The algorithm does not break down whether or not the translation vanishes. In fact, we propose an effective signature to detect vanishing translation in the presence of noise. The general algorithm also handles the degenerate case of all imaged points lying in a vertical plane which is known to admit two solutions. Both solutions are found.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"51 3","pages":"Pages 299-312"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90005-G","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Vision, Graphics, and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0734189X9090005G","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

We describe a novel semi-analytic method to determine the parameters of stereo camera geometry from pairs of matched points under the restriction of coincident meridional lanes. By a judicious choice of variables to represent rotation and translation, the noise-free problem reduces to solving two quadratics—one in each variable. With noissy data, the least squares problem reduces to a fifth-degree polynomial in a single variable, all the solutions of which can be (numerically) exactly computed along with an estimate of the standard deviation. The problem of locating the global minimum of the error function in two variables (which generally admits an unpredictable number of local extrema) in this instance becomes that of comparing five numbers. The global minimum can therefore be guaranteed. The algorithm does not break down whether or not the translation vanishes. In fact, we propose an effective signature to detect vanishing translation in the presence of noise. The general algorithm also handles the degenerate case of all imaged points lying in a vertical plane which is known to admit two solutions. Both solutions are found.

从一对图像中的匹配点确定立体摄像机几何形状的半解析方法:重合的子午面,精确或有噪声的数据
提出了一种新的半解析方法,在子午重合通道的限制下,从匹配点对确定立体摄像机几何参数。通过明智地选择代表旋转和平移的变量,无噪声问题简化为求解两个二次方程——每个变量一个。对于有噪声的数据,最小二乘问题在单个变量中简化为五次多项式,它的所有解都可以(数值)精确地计算出来,并估计出标准偏差。在这种情况下,在两个变量中定位误差函数的全局最小值的问题(通常允许不可预测的局部极值数量)变成了比较五个数字的问题。因此可以保证全局最小值。无论翻译是否消失,算法都不会中断。实际上,我们提出了一种有效的签名来检测存在噪声的翻译消失。该算法还处理了垂直平面上所有图像点的退化情况,该情况已知有两个解。两个解都找到了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信