首页> 外文期刊>Latin America Transactions, IEEE (Revista IEEE America Latina) >Evaluation of Interest Point Matching Methods for Projective Reconstruction of 3D Scenes
【24h】

Evaluation of Interest Point Matching Methods for Projective Reconstruction of 3D Scenes

机译:3D场景投影重建的兴趣点匹配方法评估

获取原文
获取原文并翻译 | 示例
           

摘要

This work evaluates the application of different state-of-the-art methods for interest point matching, aiming the robust and efficient projective reconstruction of three-dimensional scenes. Projective reconstruction refers to the computation of the structure of a scene from images taken with uncalibrated cameras. To achieve this goal, it is essential the usage of an effective point matching algorithm. Even though several point matching methods have been proposed in the literature, their impacts in the projective reconstruction task have not yet been carefully studied. Our evaluation uses as criterion the estimated epipolar, reprojection and reconstruction errors, as well as the running times of the algorithms. Specifically, we compare five different techniques: SIFT, SURF, ORB, BRISK and FREAK. Our experiments show that binary algorithms such as, ORB and BRISK, are so accurate as float point algorithms like SIFT and SURF, nevertheless, with smaller computational cost.
机译:这项工作评估了针对兴趣点匹配的各种最先进方法的应用,旨在对三维场景进行健壮而高效的投影重建。投影重建是指根据未经校准的相机拍摄的图像计算场景的结构。为了实现这个目标,必须使用有效的点匹配算法。尽管在文献中已经提出了几种点匹配方法,但尚未仔细研究它们在投影重建任务中的影响。我们的评估将估计的极线误差,重投影误差和重建误差以及算法的运行时间用作标准。具体来说,我们比较了五种不同的技术:SIFT,SURF,ORB,BRISK和FREAK。我们的实验表明,诸如ORB和BRISK之类的二进制算法与诸如SIFT和SURF之类的浮点算法一样精确,但是计算成本却较低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号