Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Sartaj Sahni (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: