
TL;DR
This paper introduces Non-Local Euclidean Medians (NLEM), a denoising algorithm that improves upon Non-Local Means (NLM) at high noise levels by using the median for robustness, especially near edges.
Contribution
The paper proposes NLEM, replacing the mean with the median in NLM, offering improved denoising performance at large noise levels with comparable computational complexity.
Findings
NLEM outperforms NLM at high noise levels near edges.
NLEM is efficiently implemented using iteratively reweighted least squares.
Preliminary results show promising denoising improvements.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
