知识卡片

普通读书笔记卡 · 9065.c · 生成模型:GPT-6

局部搜索隐含运动上界

理解等级:中级

若L表示每个轴的最大整数位移,应搜索−L到L,窗口边长是2L+1;书中L=16对应33×33。正文一处写L×L与算法半径约定不一致,实现应明确L究竟表示半径还是边长,避免漏掉合法位移。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Note that padding must be applied if we want to compute the output optical flow near the image boundaries. Algorithm 46.1 could be written more compactly but we prefer this form for its clarity. The following images shows the matching result for one input location. In this example, s = 5 (patch size of 11 × 11 pixels), and L = 16 (search window of

    参考来源

    - 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第46章《运动估计》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c046b.xhtml) - 结论依据:摘录中关于局部搜索隐含运动上界的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Note that padding must be applied if we want to compute the output optical flow near the image boundaries. Algorithm 46.1 could be written more compactly but we prefer this form for its clarity. The following images shows the matching result for one input location. In this example, s = 5 (patch size of 11 × 11 pixels), and L = 16 (search window of