Elisavet (Ellie) Konstantina Stathopoulou, R. Hänsch, O. Hellwich
{"title":"基于相机运动先验知识的特征匹配异常点去除","authors":"Elisavet (Ellie) Konstantina Stathopoulou, R. Hänsch, O. Hellwich","doi":"10.5220/0005456406030610","DOIUrl":null,"url":null,"abstract":"The search of corresponding points in between images of the same scene is a well known problem in many computer vision applications. In particular most structure from motion techniques depend heavily on the correct estimation of corresponding image points. Most commonly used approaches make neither assumptions about the 3D scene nor about the relative positions of the cameras and model both as completely unknown. This general model results in a brute force comparison of all keypoints in one image to all points in all other images. In reality this model is often far too general because coarse prior knowledge about the cameras is often available. For example, several imaging systems are equipped with positioning devices which deliver pose information of the camera. Such information can be used to constrain the subsequent point matching not only to reduce the computational load, but also to increase the accuracy of path estimation and 3D reconstruction. This study presents Guided Matching as a new matching algorithm towards this direction. The proposed algorithm outperforms brute force matching in speed as well as number and accuracy of correspondences, given well estimated priors.","PeriodicalId":411140,"journal":{"name":"International Conference on Computer Vision Theory and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Prior Knowledge About Camera Motion for Outlier Removal in Feature Matching\",\"authors\":\"Elisavet (Ellie) Konstantina Stathopoulou, R. Hänsch, O. Hellwich\",\"doi\":\"10.5220/0005456406030610\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The search of corresponding points in between images of the same scene is a well known problem in many computer vision applications. In particular most structure from motion techniques depend heavily on the correct estimation of corresponding image points. Most commonly used approaches make neither assumptions about the 3D scene nor about the relative positions of the cameras and model both as completely unknown. This general model results in a brute force comparison of all keypoints in one image to all points in all other images. In reality this model is often far too general because coarse prior knowledge about the cameras is often available. For example, several imaging systems are equipped with positioning devices which deliver pose information of the camera. Such information can be used to constrain the subsequent point matching not only to reduce the computational load, but also to increase the accuracy of path estimation and 3D reconstruction. This study presents Guided Matching as a new matching algorithm towards this direction. The proposed algorithm outperforms brute force matching in speed as well as number and accuracy of correspondences, given well estimated priors.\",\"PeriodicalId\":411140,\"journal\":{\"name\":\"International Conference on Computer Vision Theory and Applications\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computer Vision Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0005456406030610\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Vision Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0005456406030610","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Prior Knowledge About Camera Motion for Outlier Removal in Feature Matching
The search of corresponding points in between images of the same scene is a well known problem in many computer vision applications. In particular most structure from motion techniques depend heavily on the correct estimation of corresponding image points. Most commonly used approaches make neither assumptions about the 3D scene nor about the relative positions of the cameras and model both as completely unknown. This general model results in a brute force comparison of all keypoints in one image to all points in all other images. In reality this model is often far too general because coarse prior knowledge about the cameras is often available. For example, several imaging systems are equipped with positioning devices which deliver pose information of the camera. Such information can be used to constrain the subsequent point matching not only to reduce the computational load, but also to increase the accuracy of path estimation and 3D reconstruction. This study presents Guided Matching as a new matching algorithm towards this direction. The proposed algorithm outperforms brute force matching in speed as well as number and accuracy of correspondences, given well estimated priors.