{ "id": "epg3j64q4k", "slug": "noise-level-estimation", "title": "Noise level estimation", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing" }, { "id": "technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai" }, { "id": "technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.algorithms" }, { "id": "technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.numerical_string_geometry" }, { "id": "technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "label": "Fourier and signal transforms", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.numerical_string_geometry.fourier_signal_transforms" } ], "geo": [ { "id": "geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "label": "Non-geographic · 1946 to 2000: Fourier and signal transforms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t1946", "label": "Non-geographic · 1946 to 2000", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946" }, { "id": "geo.nongeo.t1946.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology" }, { "id": "geo.nongeo.t1946.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing" }, { "id": "geo.nongeo.t1946.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai" }, { "id": "geo.nongeo.t1946.technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.algorithms" }, { "id": "geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry" }, { "id": "geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "label": "Fourier and signal transforms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.numerical_string_geometry.fourier_signal_transforms" } ] }, { "id": "geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "label": "Non-geographic · 2001 to 2020: Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t2001", "label": "Non-geographic · 2001 to 2020", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001" }, { "id": "geo.nongeo.t2001.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology" }, { "id": "geo.nongeo.t2001.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing" }, { "id": "geo.nongeo.t2001.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai" }, { "id": "geo.nongeo.t2001.technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.algorithms" }, { "id": "geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry" } ] } ], "excerpt": "Noise level estimation is a signal and image processing method that measures the strength of noise in data from noisy observations alone, without a clean reference.", "snippet": "Noise level estimation is a signal and image processing method that measures the strength of noise in data from noisy observations alone, without a clean reference.", "node": "technology.computing.ai.numerical_string_geometry.fourier_signal_transforms", "markdown": "# Noise level estimation\n\nNoise level estimation is a signal and image processing method that measures the strength of the noise present in data, usually from the noisy observations alone and without access to a clean reference. Estimators return a noise variance, commonly reported as a standard deviation \\( \\sigma = \\sqrt{\\tau} \\),[1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf) and the estimate is what separates blind denoising, where the noise level \\( \\sigma_{n} \\) must be inferred, from non-blind denoising, where it is treated as a known parameter.[2](https://doi.org/10.1109/tip.2013.2283400) The estimated level drives denoising algorithms such as BM3D, auto-tunes edge detection and bilateral filtering, and in recent convolutional pipelines is predicted as a per-pixel sigma-map.\n\n| Key fact | Detail | Source |\n|---|---|---|\n| Quantity produced | A noise variance \\( \\tau \\), returned as the standard deviation \\( \\sigma = \\sqrt{\\tau} \\) | [1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf) |\n| Blind setting | Non-blind denoising treats \\( \\sigma_{n} \\) as known; blind denoising estimates it from the noisy image | [2](https://doi.org/10.1109/tip.2013.2283400) |\n| Classic estimator | Median absolute deviation of the finest-scale wavelet coefficients divided by 0.6745 | [3](https://doi.org/10.1093/biomet/81.3.425) |\n| Method families | Filter-based, patch-based, and statistical approaches | [2](https://doi.org/10.1109/tip.2013.2283400) |\n| Speed (FANS, TID2008) | 0.5785 s per image, versus 4.1901 s (Liu et al.) and 3.4462 s (Pyatykh et al.) | [1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf) |\n| Accuracy (BSD, \\( \\sigma \\) 5–50) | NSS estimator RMSE 1.24 at \\( \\sigma = 5 \\) to 4.67 at \\( \\sigma = 50 \\); DCT-kurtosis estimator 1.40 to 38.88 | [4](https://live.ece.utexas.edu/publications/2018/ssiai_noise_estimation_gupta_bampis_jin_bovik.pdf) |\n| Sigma-map denoising | PSNR within 0.1–0.2 dB of denoising with the ground-truth sigma-map | [5](https://doi.org/10.48550/arxiv.2109.11877) |\n\n## How it works\n\nPublished single-image methods fall into filter-based, patch-based, and statistical families.[2](https://doi.org/10.1109/tip.2013.2283400) Filter-based methods high-pass filter the image and treat the difference as noise; this assumption fails for images with complex structures or fine details.[2](https://doi.org/10.1109/tip.2013.2283400) The wavelet MAD estimator treats all coefficients of the highest-frequency subband as noise and estimates the standard deviation as the median absolute deviation of the finest-scale coefficients divided by 0.6745; the median controls the upward bias caused by signal remaining at that level.[3](https://doi.org/10.1093/biomet/81.3.425) It performs well at high noise levels, but its error increases when the noise level is low.[6](https://www.mdpi.com/1099-4300/24/11/1518)\n\nPatch-based methods build covariance matrices from image patches and read the noise level from the eigenvalues; the PCA-based estimator of Pyatykh et al. takes the smallest eigenvalue of the patch covariance matrix as an estimate of the noise variance, whose square root gives the standard deviation.[6](https://www.mdpi.com/1099-4300/24/11/1518) Statistical approaches analyze a DCT-filtered image and attribute changes in kurtosis values to the added noise.[2](https://doi.org/10.1109/tip.2013.2283400) The FANS algorithm first establishes the statistical relationship between the noise variance and the eigenvalues of the patch covariance matrix, an analysis that shows many state-of-the-art methods underestimate the noise level of an image.[1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf)\n\n## How it is done\n\nA practitioner runs five steps. First, the image is divided into patches, for example by sliding windows.[6](https://www.mdpi.com/1099-4300/24/11/1518) Second, structure-dominated patches are rejected: flat patches can be selected from gradient maps,[6](https://www.mdpi.com/1099-4300/24/11/1518) Liu et al. adaptively select effective patches for covariance calculation,[6](https://www.mdpi.com/1099-4300/24/11/1518) and one homogeneity test relates each patch to its downsampled version to reject non-homogeneous regions.[7](https://sites.units.it/ramponi/teaching/DIP/DIPmaterials/z08_Rakhshanfar16_NoiseEstimation.pdf) Third, the covariance matrix of the selected patches is eigen-decomposed.[1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf)\n\nFourth, the estimate is aggregated from the eigenvalues. The smallest eigenvalue is the classical choice,[6](https://www.mdpi.com/1099-4300/24/11/1518) while a color-image method uses the statistical relationship between the median and mean eigenvalues to average an appropriate number of eigenvalues instead.[8](https://opg.optica.org/josaa/abstract.cfm?uri=josaa-38-8-1150) The chi-square method computes an initial level from the chi-square distribution on the selected flat patches and refines it with an iterative strategy.[6](https://www.mdpi.com/1099-4300/24/11/1518) Fifth, spatially varying noise is handled with local estimates: Immerkær's fast method applies a 3 × 3 mask followed by a summation over the image to estimate the noise standard deviation, and applying it neighborhood-wise is a local adaptation that assumes the noise is approximately constant within each neighborhood,[9](https://doi.org/10.1006/cviu.1996.0060) and CNN-based methods predict patch-wise sigma-maps.[5](https://doi.org/10.48550/arxiv.2109.11877)\n\n## Origin\n\nEvaluation of image noise estimation methods dates to S.I. Olsen's 1993 paper \"Estimation of Noise in Images: An Evaluation\".[10](https://doi.org/10.1006/cgip.1993.1022) The MAD estimator is the estimator of [David L. Donoho](https://www.edgepedia.org/david-l-donoho) and [Iain M. Johnstone](https://www.edgepedia.org/iain-m-johnstone)'s 1994 [Biometrika](https://www.edgepedia.org/biometrika) paper \"Ideal spatial adaptation by wavelet shrinkage\".[3](https://doi.org/10.1093/biomet/81.3.425) John Immerkær's 1996 paper \"Fast Noise Variance Estimation\" describes the 3 × 3-mask method.[9](https://doi.org/10.1006/cviu.1996.0060) Xinhao Liu, Masayuki Tanaka, and Masatoshi Okutomi published single-image noise level estimation for blind denoising in IEEE Transactions on Image Processing in 2013.[2](https://doi.org/10.1109/tip.2013.2283400) Later records include Sheyda Ghanbaralizadeh Bahnemiri, Mykola Ponomarenko, and Karen Egiazarian's 2021 SDNet work on learning-based noise component map estimation,[5](https://doi.org/10.48550/arxiv.2109.11877) Zhicheng Wang and colleagues' 2022 Entropy paper on chi-square estimation,[6](https://www.mdpi.com/1099-4300/24/11/1518) and Zipeng Fu and colleagues' 2025 framework for noise-type and noise-level estimation under additive and multiplicative models in color images.[11](https://doi.org/10.1364/josaa.580440)\n\n## Variants\n\nAssumptions differ sharply across estimators. Much of the literature assumes additive white Gaussian noise (AWGN), and the widely used MAD estimator is built for that model.[12](https://people.csail.mit.edu/celiu/denoise/estnoise/noise.pdf) Signal-dependent noise is handled through the noise level function (NLF), the curve describing how noise varies with brightness. One approach estimates an upper bound on the noise level from a single image using a piecewise smooth image prior and measured CCD camera response functions, inferring the NLF by Bayesian MAP inference;[12](https://people.csail.mit.edu/celiu/denoise/estnoise/noise.pdf) a related journal paper builds a simulation-based model of NLFs, showing their dependence on the camera response function;[13](https://people.csail.mit.edu/billf/papers/denoise_TPAMI.pdf) and Sutour et al. estimate the NLF of stationary noise, the variance as a function of image intensity, in two steps.[14](https://hal.science/hal-01138809/file/M101268R_Sutour_Noise_estimation.pdf) Rakhshanfar and Amarasinghe's estimator covers AWGN, Poissonian-Gaussian (signal-dependent), and processed Poissonian-Gaussian (frequency- and signal-dependent) noise, with non-parametric NLF estimation.[7](https://sites.units.it/ramponi/teaching/DIP/DIPmaterials/z08_Rakhshanfar16_NoiseEstimation.pdf) The principal texture patch (PTP) estimator works for both additive white Gaussian and multiplicative Gaussian noise.[15](https://ieeexplore.ieee.org/document/8695073)\n\nRecent variants combine learning with classical statistics or remove clean-data requirements entirely. An improved PCANet and ResNet101 select flat patches before chi-square estimation.[16](https://www.sciencedirect.com/science/article/abs/pii/S0030402623006046)\n\n## Applications\n\nDenoising is the main consumer of the estimate. BM3D run with the FANS-estimated variance performs almost the same as with the true noise level.[1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf) For color images, a noise level higher than the true one can yield better denoising than the accurate level.[8](https://opg.optica.org/josaa/abstract.cfm?uri=josaa-38-8-1150) Estimated levels also auto-tune other tasks: the NLF-based estimate improves edge detection and bilateral filtering with no user-specified inputs.[12](https://people.csail.mit.edu/celiu/denoise/estnoise/noise.pdf) Blind denoising with the R-NLF algorithm consumes estimated noise level functions, and benchmark comparisons report PSNR after R-NLF denoising for competing estimators.[17](https://www.eurasip.org/Proceedings/Eusipco/Eusipco2016/papers/1570250456.pdf)\n\nIn deep pipelines, DnCNN was designed for Gaussian denoising with unknown noise level, CBDNet trains on real-world noisy-clean pairs for more realistic noise models, and VDNet simultaneously estimates a sigma-map and performs blind denoising.[5](https://doi.org/10.48550/arxiv.2109.11877) SDNet's estimated sigma-maps improve denoising by up to 6 dB PSNR over recent CNN-based blind methods and up to 0.5 dB over other sigma-map estimation methods.[5](https://doi.org/10.48550/arxiv.2109.11877)\n\n## Limitations and alternatives\n\nEach family fails in a known regime: filter-based methods give large errors when image structures are dense and are computationally complex; transform-based methods overestimate at low noise levels; patch-based methods underestimate at high noise levels.[6](https://www.mdpi.com/1099-4300/24/11/1518) The patch-selection method of Shin et al. overestimates at low noise and underestimates at high noise because selection varies markedly with the input image and noise level.[2](https://doi.org/10.1109/tip.2013.2283400) Liu et al.'s adaptive patch selection reduces the PCA method's low-noise overestimation but still underestimates at high noise.[6](https://www.mdpi.com/1099-4300/24/11/1518) Taking the smallest eigenvalue is unstable or overestimating when it does not satisfy the null hypothesis,[6](https://www.mdpi.com/1099-4300/24/11/1518) and SVD tail methods overestimate for images with rich structure because details and noise cannot be completely separated at the end of the singular value spectrum.[6](https://www.mdpi.com/1099-4300/24/11/1518)\n\nNon-Gaussian noise is partly absorbed by the transform: non-Gaussian independent pixel-domain noise becomes Gaussian in the transform domain by the central limit theorem, which one estimator exploits for Laplacian and uniform noise.[4](https://live.ece.utexas.edu/publications/2018/ssiai_noise_estimation_gupta_bampis_jin_bovik.pdf) For Poisson-Gaussian and hybrid noise, 2016 benchmarks report mean relative errors of 0.040 for the VST method on affine noise versus 0.219 for the PCA method, and 0.093 for a Gaussian-Cauchy mixture model.[17](https://www.eurasip.org/Proceedings/Eusipco/Eusipco2016/papers/1570250456.pdf) For clipped noise, IEDD, PCA, WTP, and VDNet fail at large \\( \\sigma_{n} \\), while SDNet's estimation error at \\( \\sigma_{n} \\) = 3 and 5 is twice smaller than the nearest competitor's.[5](https://doi.org/10.48550/arxiv.2109.11877) Two published comparisons disagree. FANS reports that BM3D achieves optimal performance with its accurate variance estimate,[1](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf) while the color-image study finds that a level higher than the true noise denoises better.[8](https://opg.optica.org/josaa/abstract.cfm?uri=josaa-38-8-1150) The DCT-kurtosis estimator is reported to have outperformed the state of the art at the time it appeared,[2](https://doi.org/10.1109/tip.2013.2283400) yet later benchmarks show its RMSE degrading to 38.88 at \\( \\sigma = 50 \\).[4](https://live.ece.utexas.edu/publications/2018/ssiai_noise_estimation_gupta_bampis_jin_bovik.pdf)\n\n## References\n\n1. [An Efficient Statistical Method for Image Noise Level Estimation (Chen et al., ICCV 2015)](https://openaccess.thecvf.com/content_iccv_2015/papers/Chen_An_Efficient_Statistical_ICCV_2015_paper.pdf)\n2. [Xinhao Liu, Masayuki Tanaka, Masatoshi Okutomi (2013). Single-Image Noise Level Estimation for Blind Denoising. IEEE Transactions on Image Processing.](https://doi.org/10.1109/tip.2013.2283400)\n3. [David L Donoho, Iain M Johnstone (1994). Ideal spatial adaptation by wavelet shrinkage. Biometrika.](https://doi.org/10.1093/biomet/81.3.425)\n4. [Natural Scene Statistics for Noise Estimation (Gupta, Bampis, Jin, Bovik, 2018)](https://live.ece.utexas.edu/publications/2018/ssiai_noise_estimation_gupta_bampis_jin_bovik.pdf)\n5. [Bahnemiri, Sheyda Ghanbaralizadeh, Ponomarenko, Mykola, Egiazarian, Karen (2021). Learning-based Noise Component Map Estimation for Image Denoising. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2109.11877)\n6. [Blind Additive Gaussian White Noise Level Estimation from a Single Image by Employing Chi-Square Distribution (Entropy, 2022)](https://www.mdpi.com/1099-4300/24/11/1518)\n7. [Estimation of Gaussian, Poissonian–Gaussian, and Processed Poissonian–Gaussian Noise (Rakhshanfar & Amarasinghe)](https://sites.units.it/ramponi/teaching/DIP/DIPmaterials/z08_Rakhshanfar16_NoiseEstimation.pdf)\n8. [Gaussian noise level estimation for color image denoising (JOSA A, 2021)](https://opg.optica.org/josaa/abstract.cfm?uri=josaa-38-8-1150)\n9. [John Immerkær (1996). Fast Noise Variance Estimation. Computer Vision and Image Understanding.](https://doi.org/10.1006/cviu.1996.0060)\n10. [S.I. Olsen (1993). Estimation of Noise in Images: An Evaluation. CVGIP Graphical Models and Image Processing.](https://doi.org/10.1006/cgip.1993.1022)\n11. [Zipeng Fu and colleagues (2025). Framework for noise-type and noise-level estimation under additive and multiplicative models in color images. Journal of the Optical Society of America A.](https://doi.org/10.1364/josaa.580440)\n12. [Noise Estimation from a Single Image (Liu, Freeman, Szeliski et al., CVPR 2008)](https://people.csail.mit.edu/celiu/denoise/estnoise/noise.pdf)\n13. [Automatic Estimation and Removal of Noise from a Single Photograph (TPAMI)](https://people.csail.mit.edu/billf/papers/denoise_TPAMI.pdf)\n14. [Noise estimation from a single image: a two-step algorithm (Sutour et al.)](https://hal.science/hal-01138809/file/M101268R_Sutour_Noise_estimation.pdf)\n15. [Blind noise-level estimation using principal texture patches (IEEE)](https://ieeexplore.ieee.org/document/8695073)\n16. [Adaptive image noise level estimation with Chi-square distribution on flat patches selected by improved PCANet and ResNet101 (Optik, 2023)](https://www.sciencedirect.com/science/article/abs/pii/S0030402623006046)\n17. [Automatic estimation of the noise level function for adaptive blind denoising (EUSIPCO 2016)](https://www.eurasip.org/Proceedings/Eusipco/Eusipco2016/papers/1570250456.pdf)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Computing and digital systems › Artificial intelligence and data › Algorithms and computational methods › Numerical, string, and geometric algorithms › Fourier and signal transforms*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [], "url": "https://www.edgepedia.org/noise-level-estimation", "markdown_url": "https://www.edgepedia.org/noise-level-estimation.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Noise level estimation\", Edgepedia (EdgeChat), https://www.edgepedia.org/noise-level-estimation. Edgepedia Community License 1.0.", "credit_md": "\"[Noise level estimation](https://www.edgepedia.org/noise-level-estimation)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/noise-level-estimation](https://www.edgepedia.org/noise-level-estimation). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Noise level estimation\", Edgepedia (EdgeChat), https://www.edgepedia.org/noise-level-estimation. Edgepedia Community License 1.0.", "speakable": "Noise level estimation is a signal and image processing method that measures the strength of noise in data from noisy observations alone, without a clean reference." }