知识卡片

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

因果性限制未来依赖

理解等级:中级

卷积形式下因果滤波核满足 h[n,m,t]=0(t0 为零,非因果滤波可能同时依赖过去和未来。因果性讨论的是时间可用性,与空间核是否对称是两个问题。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Causal filters. These are filters with output variations that only depend of the past values of the input. This puts the following constraint: h [n, m, t] = 0 for all t < 0. This means that if the input is an impulse at t = 0, the output will only have non-zero values for t > 0. If this condition is satisfied, then the

    参考来源

    - 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第19章《时间滤波器》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c019.xhtml) - 结论依据:摘录中关于因果性限制未来依赖的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Causal filters. These are filters with output variations that only depend of the past values of the input. This puts the following constraint: h [n, m, t] = 0 for all t < 0. This means that if the input is an impulse at t = 0, the output will only have non-zero values for t > 0. If this condition is satisfied, then the