Title :
Non-Local Euclidean Medians
Author :
Chaudhury, Kunal N. ; Singer, Amit
Author_Institution :
Program in Appl. & Comput. Math. (PACM), Princeton Univ., Princeton, NJ, USA
Abstract :
In this letter, we note that the denoising performance of Non-Local Means (NLM) can be improved at large noise levels by replacing the mean by the Euclidean median. We call this new denoising algorithm the Non-Local Euclidean Medians (NLEM). At the heart of NLEM is the observation that the median is more robust to outliers than the mean. In particular, we provide a simple geometric insight that explains why NLEM performs better than NLM in the vicinity of edges, particularly at large noise levels. NLEM can be efficiently implemented using iteratively reweighted least squares, and its computational complexity is comparable to that of NLM. We provide some preliminary results to study the proposed algorithm and to compare it with NLM.
Keywords :
computational complexity; image denoising; iterative methods; least squares approximations; computational complexity; image denoising performance; iteratively reweighted least squares; noise levels; nonlocal Euclidean medians; Awards activities; Image denoising; Noise; Noise measurement; Noise reduction; Robustness; Signal processing algorithms; Euclidean median; Weiszfeld algorithm; image denoising; iteratively reweighted least squares (IRLS); non-local means;
Journal_Title :
Signal Processing Letters, IEEE
DOI :
10.1109/LSP.2012.2217329