知识卡片
关联优化不能证明地标身份
描述子匹配或匈牙利分配可提出关联,但最优匹配只相对于给定代价和约束。需要检验统计与几何一致性;唯一标签也可能识别出错,不能把分配算法当成身份真实性保证。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 同时定位与建图
原书出处 · 1 处
- · 查看原书依据
Crucially, this step requires the careful and error-free association of features with landmarks in a process known as data association. Data association can be accomplished in one of two ways: by using description vectors over the features and matching if the similarity of the descriptors are above a certain threshold, or through use of a Hungarian algorithm for optimal assignment. This data association step can
参考来源
- 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第17章《同时定位与建图》(来源项目: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_17.xhtml)
- 结论依据:摘录中关于关联优化不能证明地标身份的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Crucially, this step requires the careful and error-free association of features with landmarks in a process known as data association. Data association can be accomplished in one of two ways: by using description vectors over the features and matching if the similarity of the descriptors are above a certain threshold, or through use of a Hungarian algorithm for optimal assignment. This data association step can