知识卡片
ICP交替更新对应与变换
ICP先按当前变换找对应点,再在这些对应下优化增量,应用增量后重新匹配并迭代。配对随变换改变,所以一次最近邻后只做一次最小二乘并非完整迭代过程;停止也可能停在局部错误解。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 建图
原书出处 · 1 处
- · 查看原书依据
Initially, t = 0 and nearest neighbors/pairings are established. We can now calculate a δt that optimizes the least-squares problem based on this matching using any solver available for the optimization problem (for a least-squares solution, δt can be obtained analytically by solving for the minimum of the polynomial by setting its derivative to zero). We can then shift all points in A by δt
参考来源
- 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第12章《建图》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/chapter_12.xhtml)
- 结论依据:摘录中关于ICP交替更新对应与变换的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Initially, t = 0 and nearest neighbors/pairings are established. We can now calculate a δt that optimizes the least-squares problem based on this matching using any solver available for the optimization problem (for a least-squares solution, δt can be obtained analytically by solving for the minimum of the polynomial by setting its derivative to zero). We can then shift all points in A by δt