2014
DOI: 10.5201/ipol.2014.120
| View full text |Cite
|
Sign up to set email alerts
|

Abstract: This article proposes a fast and open-source implementation of the well-known Non-Local Means (NLM) denoising algorithm, in its original pixelwise formulation. The fast implementation is based on the computation of patch distances using sums of lines that are invariant under a patch shift. The optimal parameters of NLM (in the average peak signal to noise ratio -PSNR -sense) are computed from an image database, thereby leading to a parameter-free NLM implementation. Comparison is performed with the parameter-f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
24
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 58 publications
(24 citation statements)
references
References 22 publications
(61 reference statements)
0
24
0
Order By: Relevance
“…A different acceleration strategy consists in comparing the projections of patches onto a low-dimensional subspace, e.g., via a singular value decomposition (Orchard et al 2008) or principal component analysis (Tasdizen 2009). Further references concerning fast variants of NL-means are provided by Froment (2014). Kervrann and Boulanger (2006) propose an extension of NL-means where the filtering parameters as well as the patch size vary spatially depending on the image content, while Salmon (2010) presents a numerical study on the selection of the search-neighborhood size, and a new criterion to set the weight w WIN (x 1 , x 1 ) for the central pixel.…”
Section: Extensions Of the Basic Nl-means Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…A different acceleration strategy consists in comparing the projections of patches onto a low-dimensional subspace, e.g., via a singular value decomposition (Orchard et al 2008) or principal component analysis (Tasdizen 2009). Further references concerning fast variants of NL-means are provided by Froment (2014). Kervrann and Boulanger (2006) propose an extension of NL-means where the filtering parameters as well as the patch size vary spatially depending on the image content, while Salmon (2010) presents a numerical study on the selection of the search-neighborhood size, and a new criterion to set the weight w WIN (x 1 , x 1 ) for the central pixel.…”
Section: Extensions Of the Basic Nl-means Algorithmmentioning
confidence: 99%
“…Hence, fast implementations and variants of NL-means adopt strategies such as the integral-images method Darbon et al 2008;Froment 2014) or criteria for restricting the computation of weights to the most similar patches only. For instance, Buades et al (2005) present a multiscale solution where similar patches are first searched within a sub-sampled image, and then the weights are refined on the full-size noisy image, where the filtering is also performed.…”
Section: Extensions Of the Basic Nl-means Algorithmmentioning
confidence: 99%
“…A faster sort algorithm can be potentially used to speed OWF and to get timings closer to those obtained with BM3D [11]. Moreover, we did not evaluate all the possible implementations as described for instance in [61,62]. Note that OWF has been recently implemented in parallel since every patch can be processed independently.…”
Section: Computings and Algorithm Implementationmentioning
confidence: 99%
“…We tested and compared the effect of different denoising methods on image quality for small subsets gained from the large temporal median image (see Figure 9): the non-local means denoising [69][70][71][72], total variation chambolle [73], total variation bregman [74], and bilateral filter [75]. On the basis of visual perception, we considered the bilateral denoising and non-local means filter as the most suitable methods for sharpening the linear details such as dikes and levees located between adjoining ponds and improve the identification of single ponds.…”
Section: Edge Sharpeningmentioning
confidence: 99%