A fast algorithm for 1-norm vector median filtering

A major drawback with vector median filters is their high computational complexity. A fast algorithm is presented for the computation of the vector median operator based on 1-norm. The algorithm complexity is investigated both from a theoretical and an experimental point of view. Simulation results are shown proving the complexity reduction achieved by the novel algorithm.