Non-Local Euclidean Medians

Abstract

In this letter, we note that the denoising performance of Non-Local Means (NLM) at large noise levels can be improved 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.

6 figures, 1 table

Cited by in corpus (7)

• Probabilistic Non-Local Means
• On Detection of Faint Edges in Noisy Images
• Single-lead f-wave extraction using diffusion geometry
• Non-Local Patch Regression: Robust Image Denoising in Patch Space
• Pruned non-local means
• Blockwise SURE Shrinkage for Non-Local Means
• On the convergence of the IRLS algorithm in Non-Local Patch Regression