Median filtering in constant time
Median filtering in constant time
复制标题
DOI：
10.1109/tip.2007.902329
复制
发表时间：
2007-09-01
影响因子：
10.6
通讯作者：
Hebert, Patrick
中科院分区：
文献类型：
--
作者：
Perreault, Simon;Hebert, Patrick
中值滤波器是许多图像处理情况中的基本构建块之一。然而，它的使用长期以来一直受到其算法复杂度为O（r）的内核半径的阻碍。随着图像越来越大，滤波器核也越来越大，对更有效的中值滤波算法的需求变得越来越迫切。在这封信中，一个新的，简单的，但速度更快，算法表现出O（1）的运行时复杂度的描述和分析。它是比较和基准对以前的算法。扩展到更高的维度或更高的精度的数据和近似的圆形内核，以及。
The median filter is one of the basic building blocks in many image processing situations. However, its use has long been hampered by its algorithmic complexity of O(r) in the kernel radius. With the trend toward larger images and proportionally larger filter kernels, the need for a more efficient median filtering algorithm becomes pressing. In this correspondence, a new, simple, yet much faster, algorithm exhibiting O(1) runtime complexity is described and analyzed. It is compared and bench-marked against previous algorithms. Extensions to higher dimensional or higher precision data and an approximation to a circular kernel are presented, as well.