The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Efficient Nonlocal Means for Denoising of Textural Patterns
Abstract
This paper contributes two novel techniques in the context of image restoration by nonlocal filtering. First, we introduce an efficient implementation of the nonlocal means filter based on arranging the data in a cluster tree. The structuring of data allows for a fast and accurate preselection of similar patches. In contrast to previous approaches, the preselection is based on the same distance measure as used by the filter itself. It allows for large speedups, especially when the search for similar patches covers the whole image domain, i.e., when the filter is truly nonlocal. However, also in the windowed version of the filter, the cluster tree approach compares favorably to previous techniques in respect of quality versus computational cost. Second, we suggest an iterative version of the filter that is derived from a variational principle and is designed to yield nontrivial steady states. It reveals to be particularly useful in order to restore regular, textured patterns.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177 · cited 1×
“A similar , but iterative, filter is the bilateral filter [36], [38].”
A Non-Local Algorithm for Image Denoising
Buades, A., Coll, B., & Morel, J.-M. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.38 · Cited by 7,616
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
SUSAN—a new approach to low level image processing
Smith, S. M., & Brady, J. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007963824710 · Cited by 3,333
Cited by
Adaptive non‐local means denoising of MR images with spatially varying noise levels
Manjón, J. V., Coupé, P., Martí‐Bonmatí, L., Collins, D. L., & Robles, M. (2010) · Journal of Magnetic Resonance Imaging · doi:10.1002/jmri.22003 · Cited by 1,082
Iterative Weighted Maximum Likelihood Denoising With Probabilistic Patch-Based Weights
Deledalle, C.-A., Denis, L., & Tupin, F. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2029593 · Cited by 823
Patch-based segmentation using expert priors: Application to hippocampus and ventricle segmentation
Coupé, P., Manjón, J. V., Fonov, V., Pruessner, J., Robles, M., & Collins, D. L. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2010.09.018 · Cited by 692
Color demosaicking by local directional interpolation and nonlocal adaptive thresholding
Wu, X. (2011) · Journal of Electronic Imaging · doi:10.1117/1.3600632 · Cited by 544
The Generalized PatchMatch Correspondence Algorithm
Barnes, C., Shechtman, E., Goldman, D. B., & Finkelstein, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15558-1_3 · Cited by 530
Metadata
- Authors
- Brox, T., Kleinschmidt, O., & Cremers, D.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2008-07
- Volume
- 17
- Issue
- 7
- Pages
- 1083-1092
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2163168659
- Cited by
- 235
- References
- 4
- FWCI
- 34.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Nonlocal Means for Denoising of Textural Patterns. https://app.cochat.ai/papers/10.1109/tip.2008.924281
- The paper
- Brox, T., Kleinschmidt, O., & Cremers, D. (2008). Efficient Nonlocal Means for Denoising of Textural Patterns. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2008.924281
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.