CVX based SLAM algorithms paper read

It is a summary of a few point cloud matching algorithms based on convex optimzation theory.

SLAM problems
2D SLAM
**#2.3**
**Loss = Difference of poses**
**QCQP+Lagrangian duality**
3D SLAM
**#2.4**
**Loss = Difference of poses**
**QCQP+Lagrangian duality**
More general
**#1.2**
**Multiview Geometry Problems**
**Fractional Programming+Convex Envelope**
Point cloud registration
BnB method
**global optimal**
#1.2
**QCQP+Lagrangian duality**
#1.1
**Fractional Programming+Convex Envelope**
Relaxation method
**tight empirically**
**For SO3 constraint of rotation**
Matrix Representation
**#2.1 #2.2**
Quaternion Representation
**#3**
**The only correspondence free method here**

1 Banch and Bound

1.1 Practical Global Optimization for Multiview Geometry

article researchgate

  • Agarwal S , Chandraker M K , Kahl F , et al. Practical Global Optimization for Multiview Geometry[C]// Computer Vision - ECCV 2006, 9th European Conference on Computer Vision, Graz, Austria, May 7-13, 2006, Proceedings, Part I. Springer, Berlin, Heidelberg, 2006.

This article talks about using Banch and Bound algorithm for three types of Multiview Geometry problems:

  • Camera pixels triangualtion
  • Camera Resectioning, which is to estimate camera matrix P.
  • Projection from P n \mathbf{P}^{n} P
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 5
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 5
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值