知识卡片
卷积交换结合律须配边界协议
在求和或积分满足相应条件时,卷积具有交换律、结合律和对加法的分配律,可重组线性滤波链。若每步都截断输出并重新填充,实际有限数组算子未必保持这些等价。比较合并核与分步处理时要连同裁剪和边界一起核对。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 线性图像滤波
原书出处 · 1 处
- · 查看原书依据
In practice, for finite length signals, the associative property might be affected by how boundary conditions are implemented. Distributive with respect to the sum: (15.17) Shift. Another interesting property involves shifting the two convolved functions. Let's consider the con- volution ℓout [n] = h [n] ◦ ℓin [n]. If the input signal, ℓin [n], is translated by a constant n0, i.e. ℓin [n – n0],
参考来源
- 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第15章《线性图像滤波》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c015b.xhtml)
- 结论依据:摘录中关于卷积交换结合律须配边界协议的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:In practice, for finite length signals, the associative property might be affected by how boundary conditions are implemented. Distributive with respect to the sum: (15.17) Shift. Another interesting property involves shifting the two convolved functions. Let's consider the con- volution ℓout [n] = h [n] ◦ ℓin [n]. If the input signal, ℓin [n], is translated by a constant n0, i.e. ℓin [n – n0],