Abstract

An Adaptive Content based Closer Proximity Pixel Replacement algorithm for the removal of high density salt and pepper noise in images is proposed. The algorithm uses decision tree to identify and correct the pixels of the image is noisy or not. The algorithm finds Euclidean distance between the processed pixel and the number of non-noisy pixels inside the current processing kernel. The algorithm requires only two non-noisy pixels to be present in kernel for the algorithm to operate. The faulty pixels are replaced only by the median of pixels that occurs more frequently in the current processing kernel based on the Euclidean distance. The algorithm increases the window size by two when there are no non-noisy pixels in the current processing kernel. The proposed algorithm was compared with 16 standard and existing algorithms derived from recent literatures. Exhaustive experiments on standard database images suggest that the algorithm exhibit excellent noise suppression and good information preservation characteristics even at very high noise densities.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.