论文信息 - Efficient serial and parallel algorithms for median filtering

Efficient serial and parallel algorithms for median filtering

A serial algorithm for separable median filtering is developed that requires only two comparisons per element when the window size is three. In addition, fast parallel concurrent-read-exclusive-write parallel random-access machine (CREW PRAM) algorithms with good processor-time product are developed for separable median filtering and two-dimensional median filtering. >

Sartaj Sahni | Sanjay Ranka | S. Sahni | S. Ranka

[1] Nuggehally Sampath Jayant. Average- and Median-Based Smoothing Techniques for Improving Digital Speech Quality in the Presence of Transmission Errors , 1976, IEEE Trans. Commun..

[2] S. L. Tanimoto,et al. Sorting, Histogramming, and Other Statistical Operations on a Pyramid Machine , 1984 .

[3] János Komlós,et al. Deterministic selection in O(loglog N) parallel time , 1986, STOC '86.

[4] Quentin F. Stout. Sorting, Merging, Selecting, and Filtering on Tree and Pyramid Machines , 1983, ICPP.

[5] Patrenahalli M. Narendra,et al. A Separable Median Filter for Image Noise Smoothing , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] Ellis Horowitz,et al. Fundamentals of Data Structures in Pascal , 1984 .

[7] Thomas S. Huang,et al. A fast two-dimensional median filtering algorithm , 1979 .

[8] Dana H. Ballard,et al. Computer Vision , 1982 .

[9] Lawrence R. Rabiner,et al. Applications of a nonlinear smoothing algorithm to speech processing , 1975 .

[10] Sartaj Sahni,et al. Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[11] Anup Basu,et al. Algorithms and hardware for efficient image smoothing , 1987, Comput. Vis. Graph. Image Process..