知识卡片
局部匹配还需多点几何一致
用描述子距离检索候选后,可让相对位置、尺度和方向对对象位姿投票,再检查多个匹配是否一致。单个近邻匹配也可能来自重复纹理或背景,书中至少三个特征是特定识别流程条件,不是所有视觉任务固定的最低点数。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 特征提取
原书出处 · 1 处
- · 查看原书依据
Scale-invariant features of training images can be stored in a database and used to identify these objects in the future. One approach is to find all features in an image and compare them with those in the database. This comparison is done by using the Euclidian distance as metric and searching a k-d tree (with d = 128). In order to make this approach robust,
参考来源
- 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第09章《特征提取》(来源项目: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_9.xhtml)
- 结论依据:摘录中关于局部匹配还需多点几何一致的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Scale-invariant features of training images can be stored in a database and used to identify these objects in the future. One approach is to find all features in an image and compare them with those in the database. This comparison is done by using the Euclidian distance as metric and searching a k-d tree (with d = 128). In order to make this approach robust,