知识卡片
递归实现不必存无限历史
递推 y[t]=x[t]+αy[t−1] 在零初始条件下对应 h[t]=αᵗu[t],是可由一个前态更新实现的无限冲激响应。它在表达上具有无限历史记忆,计算时却不必每步对全部过去样本重新卷积。非零初始状态还会额外贡献齐次响应。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 时间滤波器
原书出处 · 1 处
- · 查看原书依据
In this chapter, we have written all the filters as convolutions. However, some filters are better described as difference equations (this is specially important in time). An example of a difference equation is:
参考来源
- 位置:《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)
- 结论依据:摘录中关于递归实现不必存无限历史的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:In this chapter, we have written all the filters as convolutions. However, some filters are better described as difference equations (this is specially important in time). An example of a difference equation is: