
Implementing a fast median filter 41
FIGURE 4.6. Determination of the median value by the forgetful selection
process, applied to a 3 × 3 neighborhood window.
FIGURE 4.7. First iteration of the 5 × 5 selection process, with k
25
= 14,
which shows how Instruction Level Parallelism is maximized by the use of
an incomplete sorting network. Arrows represent the result of the swapping
function, with the lower value at the starting point and the higher value at
the end point.