论文部分内容阅读
给出了一种中值滤波的快速算法，该算法利用了两次中值滤波的窗口内数据的相关性。在中值滤波过程中，除了第一个中值要用传统排序算法求得，以后的中值都是通过把新进入窗口元素在前一次排好的序列进行对分查找和内插操作求得。为了便于窗口移动，设计了一种数据结构，可以快速用新移入数据覆盖移出数据，大大减小计数量，还给出了窗口按“之”字形路线移动的２ 维中值滤波方法。
A fast algorithm of median filtering is given, which takes advantage of the correlation between two median filtered windows. In the median filtering process, in addition to the first median to be calculated using the traditional sorting algorithm, after the median is through the new entry window elements arranged in the previous sequence of binary search and interpolation . In order to facilitate the window movement, a data structure is designed, which can quickly remove the data with the new data and greatly reduce the count. The two-dimensional median filter method is also given.