Design of Binocular Stereo Vision System Via CNN-based Stereo Matching Algorithm

Yan Jiao, P. Ho
{"title":"Design of Binocular Stereo Vision System Via CNN-based Stereo Matching Algorithm","authors":"Yan Jiao, P. Ho","doi":"10.1109/NaNA53684.2021.00080","DOIUrl":null,"url":null,"abstract":"In this paper, we design a binocular stereo vision system based on an adjustable narrow-baseline stereo camera for extracting depth information from a rectified stereo pair. The camera calibration and rectification are performed to get a rectified stereo pair serving as the input to the stereo matching algorithm. This algorithm searches the corresponding points between the left and right images and produces a disparity map that is used to obtain the depths via the triangulation principle. We focus on the first stage of the algorithm and propose a CNN-based approach to calculating the matching cost. Fast and slow networks are presented and trained on standard stereo datasets. The output of either network is regarded as the initial matching cost, followed by a series of post-processing methods for generating qualified disparity maps. The contrast tests have demonstrated that the CNN-based methods outperform census transformation on the mentioned datasets. Finally, we advance two error criteria to acquire the range of system working distance under diverse baseline lengths.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA53684.2021.00080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we design a binocular stereo vision system based on an adjustable narrow-baseline stereo camera for extracting depth information from a rectified stereo pair. The camera calibration and rectification are performed to get a rectified stereo pair serving as the input to the stereo matching algorithm. This algorithm searches the corresponding points between the left and right images and produces a disparity map that is used to obtain the depths via the triangulation principle. We focus on the first stage of the algorithm and propose a CNN-based approach to calculating the matching cost. Fast and slow networks are presented and trained on standard stereo datasets. The output of either network is regarded as the initial matching cost, followed by a series of post-processing methods for generating qualified disparity maps. The contrast tests have demonstrated that the CNN-based methods outperform census transformation on the mentioned datasets. Finally, we advance two error criteria to acquire the range of system working distance under diverse baseline lengths.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于cnn立体匹配算法的双目立体视觉系统设计
本文设计了一种基于可调窄基线立体相机的双目立体视觉系统,用于从整流立体对中提取深度信息。对摄像机进行标定和校正,得到校正后的立体对作为立体匹配算法的输入。该算法搜索左右图像之间的对应点,生成视差图,通过三角剖分原理获得深度。我们重点研究了算法的第一阶段,提出了一种基于cnn的匹配代价计算方法。快速和慢速网络在标准立体数据集上呈现和训练。将任意一个网络的输出作为初始匹配代价,然后通过一系列的后处理方法生成合格的视差图。对比测试表明,基于cnn的方法在上述数据集上优于普查变换。最后,我们提出了两个误差准则,以获得不同基线长度下系统工作距离的范围。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Covert Communication in D2D Underlaying Cellular Network Online Scheduling of Machine Learning Jobs in Edge-Cloud Networks Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network Fatigue Detection Technology for Online Learning The Nearest Neighbor Algorithm for Balanced and Connected k-Center Problem under Modular Distance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1