A Novel Median Filtering Algorithm Based on Incomplete HeapSort Algorithm

Heap sort algorithm is studied thoroughly, a new incomplete heap sort algorithm is designed, and then a novel image median filtering algorithm based on incomplete heap sort algorithm is proposed to improve the filtering speed. The new algorithm considers in detail the characteristic of image median filtering (In median filtering algorithm, the sorting operation of all pixel values is not necessary, getting the median value is the real purpose) and heap sort algorithm, and can give the median value by sorting only part of the pixels value in the neighborhood, thus it can reduce many data move operations, and then greatly improve the efficiency of image median filtering. Algorithm analysis and a lot of experiment results all show that, the new algorithm greatly improves the efficiency of image median filtering, and can keep the edge, outline, texture and much other information to a great extent.