Simple fast median filtering algorithm, with application to corner detection

摘要

Studies the speed of operation of median filtering algorithms. An iterative approach is investigated, and then simplified to take the local neighbourhood centre pixel as a starting approximation. Overall speedup factors of 2-4 are obtained. The method is useful when the 'running median' technique cannot be used, as for 'skimmed' median-based corner detectors.