Share Email Print

Proceedings Paper

Fast noise variance estimation by principal component analysis
Author(s): Stanislav Pyatykh; Lei Zheng; Jürgen Hesser
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Noise variance estimation is required in many image denoising, compression, and segmentation applications. In this work, we propose a fast noise variance estimation algorithm based on principal component analysis of image blocks. First, we rearrange image blocks into vectors and compute the covariance matrix of these vectors. Then, we use Bartlett's test in order to select the covariance matrix eigenvalues, which correspond only to noise. This allows estimating the noise variance as the average of these eigenvalues. Since the maximum possible number of eigenvalues corresponding to noise is utilized, it is enough to process only a small number of image blocks, which allows reduction of the execution time. The blocks to process are selected from image regions with the smallest variance. During our experiments involving seven state of the art methods, the proposed approach was signi_cantly faster than the methods with similar or higher accuracy. Meanwhile, the relative error of our estimator was always less than 15%. We also show that the proposed method can process images without homogeneous areas.

Paper Details

Date Published: 19 February 2013
PDF: 12 pages
Proc. SPIE 8655, Image Processing: Algorithms and Systems XI, 86550K (19 February 2013); doi: 10.1117/12.2000276
Show Author Affiliations
Stanislav Pyatykh, Heidelberg Univ. (Germany)
Lei Zheng, Heidelberg Univ. (Germany)
Jürgen Hesser, Heidelberg Univ. (Germany)

Published in SPIE Proceedings Vol. 8655:
Image Processing: Algorithms and Systems XI
Karen O. Egiazarian; Sos S. Agaian; Atanas P. Gotchev, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?