{"title":"从一对图像中的匹配点确定立体摄像机几何形状的半解析方法:重合的子午面,精确或有噪声的数据","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":"{\"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}","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}
A semi-analytic method of determining stereo camera geometry from matched points in a pair of images: Coincident meridional planes, exact or noisy data
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.