2012
DOI: 10.5201/ipol.2012.l-bm3d
|View full text |Cite
|
Sign up to set email alerts
|

An Analysis and Implementation of the BM3D Image Denoising Method

Abstract: BM3D is a recent denoising method based on the fact that an image has a locally sparse representation in transform domain. This sparsity is enhanced by grouping similar 2D image patches into 3D groups. In this paper we propose an open-source implementation of the method. We discuss the choice of all parameter methods and confirm their actual optimality. The description of the method is rewritten with a new notation. We hope this new notation is more transparent than in the original paper. A final index gives n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
201
0
2

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 310 publications
(204 citation statements)
references
References 13 publications
1
201
0
2
Order By: Relevance
“…At the time of writing only two implementations of BM3D algorithm were publicly available, the original design by Dabov et al [1] and an implementation created using C++ by Lebrun [34]. The source code for the original design was not available, and therefore the presented implementations could not be fully compared.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…At the time of writing only two implementations of BM3D algorithm were publicly available, the original design by Dabov et al [1] and an implementation created using C++ by Lebrun [34]. The source code for the original design was not available, and therefore the presented implementations could not be fully compared.…”
Section: Resultsmentioning
confidence: 99%
“…Five different implementations were compared with each other having the same filter profile in use in each test case. These five implementations are referred as Lebrun [34], Original by Dabov et al [1], OpenCL, CUDA and Mobile CUDA. The test execution times were averaged from five sequential test runs.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Internal denoising algorithms use larger patches and search-windows at higher noise levels [13][14][15][16], improving reconstructed quality. Extensions to the NLM algorithm proposed adaptive spatial support for superior results, by classifying patches as textured or smooth by edge-detection and morphological operations [17], or by clustering the SVD (singular-value decomposition) of the blocks' gradient fields [18], allowing spatial adaptation for each block.…”
Section: Related Workmentioning
confidence: 99%