This is the authors' abstract. We don't add key points for this paper.
A fast median filtering algorithm with logarithmic time complexity is presented that is based on a special data structure, a double heap, which naturally supports the median. With slight modification, the approach can be used to implement any rank-order filter. A complete implementation of the algorithm has been tested as a global Modula-2 module and has the expected performance and correctness.>
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Astola et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: