Issue No. 02 - February (1990 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.44408
<p>A blind noise variance algorithm that recovers the variance of noise in two steps is proposed. The sample variances are computed for square cells tessellating the noise image. Several tessellations are applied with the size of the cells increasing fourfold for consecutive tessellations. The four smallest sample variance values are retained for each tessellation and combined through an outlier analysis into one estimate. The different tessellations thus yield a variance estimate sequence. The value of the noise variance is determined from this variance estimate sequence. The blind noise variance algorithm is applied to 500 noisy 256*256 images. In 98% of the cases, the relative estimation error was less than 0.2 with an average error of 0.06. Application of the algorithm to differently sized images is also discussed.</p>
computerised picture processing; image pyramids; fast parallel algorithm; blind noise variance; noise image; tessellations; outlier analysis; variance estimate sequence; computerised picture processing; estimation theory; noise; parallel processing
J. Jolion, P. Meer and A. Rosenfeld, "A Fast Parallel Algorithm for Blind Estimation of Noise Variance," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 216-223, 1990.