基于极极几何的立体匹配新算法

N. Rais, Hammad, Khan, Habibullah Jamal
{"title":"基于极极几何的立体匹配新算法","authors":"N. Rais, Hammad, Khan, Habibullah Jamal","doi":"10.1109/INMIC.2003.1416609","DOIUrl":null,"url":null,"abstract":"We present a new stereo matching algorithm using epipolar geometry. The proposed algorithm does not completely rely on the fundamental matrix for the identification of the corresponding pairs. In fact, it uses epipolar geometry to locate the corresponding epipolar line in the other image in order to reduce the search space from the whole image plane to just one-dimension. A search window around the point is selected and a correlation-based matching algorithm is used to identify the corresponding points on the epipolar lines. An optimized search window size for correlation computation is also presented in the proposed algorithm. The algorithm provides more accurate results over normal stereo matching algorithms at the cost of marginal computational complexity","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new algorithm of stereo matching using epipolar geometry\",\"authors\":\"N. Rais, Hammad, Khan, Habibullah Jamal\",\"doi\":\"10.1109/INMIC.2003.1416609\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new stereo matching algorithm using epipolar geometry. The proposed algorithm does not completely rely on the fundamental matrix for the identification of the corresponding pairs. In fact, it uses epipolar geometry to locate the corresponding epipolar line in the other image in order to reduce the search space from the whole image plane to just one-dimension. A search window around the point is selected and a correlation-based matching algorithm is used to identify the corresponding points on the epipolar lines. An optimized search window size for correlation computation is also presented in the proposed algorithm. The algorithm provides more accurate results over normal stereo matching algorithms at the cost of marginal computational complexity\",\"PeriodicalId\":253329,\"journal\":{\"name\":\"7th International Multi Topic Conference, 2003. INMIC 2003.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Multi Topic Conference, 2003. INMIC 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INMIC.2003.1416609\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Multi Topic Conference, 2003. INMIC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC.2003.1416609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种基于极极几何的立体匹配算法。该算法不完全依赖于基本矩阵进行对应对的识别。实际上,它使用极极几何来定位另一幅图像中对应的极极线,从而将整个图像平面的搜索空间缩小到仅为一维。选择点周围的搜索窗口,采用基于相关性的匹配算法识别极线上的对应点。提出了一种优化的相关度计算的搜索窗口大小。该算法比常规的立体匹配算法提供更精确的结果,但代价是计算复杂度很小
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new algorithm of stereo matching using epipolar geometry
We present a new stereo matching algorithm using epipolar geometry. The proposed algorithm does not completely rely on the fundamental matrix for the identification of the corresponding pairs. In fact, it uses epipolar geometry to locate the corresponding epipolar line in the other image in order to reduce the search space from the whole image plane to just one-dimension. A search window around the point is selected and a correlation-based matching algorithm is used to identify the corresponding points on the epipolar lines. An optimized search window size for correlation computation is also presented in the proposed algorithm. The algorithm provides more accurate results over normal stereo matching algorithms at the cost of marginal computational complexity
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信