Non local image denoising using image adapted neighborhoods

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In recent years several non-local image denoising methods were proposed in the literature. These methods compute the denoised image as a weighted average of pixels across the whole image (in practice across a large area around the pixel to be denoised). The algorithm non-local means (NLM) proposed by Buades, Morel and Coll showed excellent denoising capabilities. In this case the weight between pixels is based on the similarity between square neighborhoods around them. NLM was a clear breakthrough when it was proposed but then was outperformed by algorithms such as BM3D. The improvements of these algorithms are very clear with respect to NLM but the reasons for such differences are not completely understood. One of the differences between both algorithms is that they use adaptive regions to compute the denoised image. In this article we will study the performance of NLM while using image adapted neighborhoods. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Pardo, Á. (2010). Non local image denoising using image adapted neighborhoods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6419 LNCS, pp. 277–284). https://doi.org/10.1007/978-3-642-16687-7_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free