Recursive two-dimensional median filtering algorithms for fast image root extraction

The authors develop and evaluate two new two-dimensional fast recursive median filtering algorithms, for image root extraction. The first recursive algorithm, which is called the fast binary root algorithm, converges to a root of a binary image in one pass including a number of local rescans. The second is referred to as the fast multilevel root algorithm. It converges to a root of a multilevel image in two passes, the second of which includes a number of local rescans. The number of ordering positions required by the author´s algorithms is shown to be significantly less than those required by the standard and regular recursive median filters