利用双目视觉原理求出匹配点深度信息

上传者: 39707351 | 上传时间: 2019-12-21 20:51:22 | 文件大小: 11.38MB | 文件类型: zip
在C++下,利用Opencv的库,首先通过Sift找出左右图的匹配点,之后通过Ransac和knn算法剔除错误匹配点后,最后求出匹配点对的深度信息

文件下载

资源详情

[{"title":"( 31 个子文件 11.38MB ) 利用双目视觉原理求出匹配点深度信息","children":[{"title":"NewPointClouds","children":[{"title":".vs","children":[{"title":"NewPointClouds","children":[{"title":"v15","children":[{"title":"Browse.VC.db <span style='color:#111;'> 20.55MB </span>","children":null,"spread":false},{"title":".suo <span style='color:#111;'> 31.50KB </span>","children":null,"spread":false},{"title":"ipch","children":[{"title":"1b0d489489dd94da.ipch <span style='color:#111;'> 3.38MB </span>","children":null,"spread":false},{"title":"98b0bdafa38a6eaf.ipch <span style='color:#111;'> 3.44MB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true},{"title":"x64","children":[{"title":"Debug","children":[{"title":"NewPointClouds.pdb <span style='color:#111;'> 1.96MB </span>","children":null,"spread":false},{"title":"NewPointClouds.ilk <span style='color:#111;'> 2.52MB </span>","children":null,"spread":false},{"title":"NewPointClouds.exe <span style='color:#111;'> 311.50KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"NewPointClouds","children":[{"title":"stdafx.cpp <span style='color:#111;'> 330B </span>","children":null,"spread":false},{"title":"NewPointClouds.cpp <span style='color:#111;'> 12.26KB </span>","children":null,"spread":false},{"title":"debug.txt <span style='color:#111;'> 1.99KB </span>","children":null,"spread":false},{"title":"stdafx.h <span style='color:#111;'> 366B </span>","children":null,"spread":false},{"title":"NewPointClouds.vcxproj <span style='color:#111;'> 8.12KB </span>","children":null,"spread":false},{"title":"targetver.h <span style='color:#111;'> 370B </span>","children":null,"spread":false},{"title":"pattenimage_L.bmp <span style='color:#111;'> 469.80KB </span>","children":null,"spread":false},{"title":"NewPointClouds.vcxproj.filters <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"pattenimage_R.bmp <span style='color:#111;'> 469.80KB </span>","children":null,"spread":false},{"title":"NewPointClouds.vcxproj.user <span style='color:#111;'> 165B </span>","children":null,"spread":false},{"title":"x64","children":[{"title":"Debug","children":[{"title":"stdafx.obj <span style='color:#111;'> 5.96KB </span>","children":null,"spread":false},{"title":"NewPointClouds.obj <span style='color:#111;'> 1.34MB </span>","children":null,"spread":false},{"title":"NewPointClouds.tlog","children":[{"title":"CL.write.1.tlog <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"CL.read.1.tlog <span style='color:#111;'> 45.12KB </span>","children":null,"spread":false},{"title":"CL.command.1.tlog <span style='color:#111;'> 1.77KB </span>","children":null,"spread":false},{"title":"NewPointClouds.lastbuildstate <span style='color:#111;'> 210B </span>","children":null,"spread":false},{"title":"link.write.1.tlog <span style='color:#111;'> 716B </span>","children":null,"spread":false},{"title":"link.command.1.tlog <span style='color:#111;'> 3.33KB </span>","children":null,"spread":false},{"title":"link.read.1.tlog <span style='color:#111;'> 9.26KB </span>","children":null,"spread":false}],"spread":false},{"title":"vc141.idb <span style='color:#111;'> 379.00KB </span>","children":null,"spread":false},{"title":"NewPointClouds.pch <span style='color:#111;'> 2.69MB </span>","children":null,"spread":false},{"title":"NewPointClouds.log <span style='color:#111;'> 2.19KB </span>","children":null,"spread":false},{"title":"vc141.pdb <span style='color:#111;'> 1.85MB </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":false},{"title":"NewPointClouds.sln <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明