知识卡片
全图配对与匹配器是两层选择
小图像集可枚举每幅与其他图的配对,再用SuperGlue等匹配器为一对图建立对应。枚举所有图像对不等于匹配器内部只执行简单描述子暴力最近邻;原文同时提brute-force与图网络,需区分配对策略和匹配算法。图像对数随集合扩大而迅速增加。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
We perform brute-force matching, that is, match features from one image with features from every other image because we have a small number of images. For the actual matching shown in this section, we use SuperGlue, another graph network-based matcher.
参考来源
- 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第44章《多视图几何与运动恢复结构》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c044.xhtml)
- 结论依据:摘录中关于全图配对与匹配器是两层选择的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:We perform brute-force matching, that is, match features from one image with features from every other image because we have a small number of images. For the actual matching shown in this section, we use SuperGlue, another graph network-based matcher.