Research Article | Open Access
Nonlocal Mean Image Denoising Using Anisotropic Structure Tensor
We present a novel nonlocal mean (NLM) algorithm using an anisotropic structure tensor to achieve higher accuracy of imaging denoising and better preservation of fine image details. Instead of using the intensity to identify the pixel, the proposed algorithm uses the structure tensor to characterize the boundary information around the pixel more comprehensively. Meanwhile, similarity of the structure tensor is computed in a Riemannian space for more rigorous comparison, and the similarity weight of the pixel (or patch) is determined by the intensity and structure tensor simultaneously. The proposed algorithm is compared with the original NLM algorithm and a modified NLM algorithm that is based on the principle component analysis. Quantitative and qualitative comparisons of the three NLM algorithms are presented as well.
Image denoising is a key preprocessing step for higher level of processes such as image segmentation and pattern recognition. The most straightforward denoising approach is the direct application of spatial coherence which assumes noisy samples in a local area of a given pixel follow the same distribution of that pixel . Although many efforts have been done dedicatedly to overcome it such as anisotropic filtering  and total variation minimization , this kind of algorithms comes with a common drawback of image blurring due to smoothing effect in both homogeneous regions and at object boundaries. Besides denoising methods in spatial domain, removing noise in transformation domain is also well developed, such as DCT transform  and wavelet .
In contrast to spatial coherence based image smoothing, nonlocal means (NLM) denoising algorithms have been recently proposed, which average pixel intensities weighted by the similarity of pixel gray level in a certain neighborhood . This kind of pixel selection scheme makes NLM significantly outperform traditional denoising methods such as anisotropic filtering , total variation , and bilateral filtering , which has enabled it to be used in various applications such as computer vision and statistical nonparametric regression [8, 9]. Extension of the original approach including scale and rotation invariance for the data patches used to define the weights is well studied [10–13].
However, as proposed in local denoising methods before , the pixel intensity itself cannot fully characterize the information contained in the image. Besides this, this kind of pointwise mean will cause large flat zones and spurious contours which are called “staircasing” effects. To overcome this, higher order information, which is derived from image gradients and can provide better description of image structure, is involved in NLM for more robust or sensitive measures of pixel similarity. For instance, Buades et al. [15, 16] employ a nonlocal polynomial model to attenuate the “staircasing” effect. Chatterjee and Milanfar  resort to a similar higher order NLM where the polynomial approximations up to a second order are used. Other traditional techniques such as singular value decomposition  and principle component analysis [19–21] have also been used to characterize high-order information and project image neighborhood vectors to a lower dimensional subspace. One of these methods which are referred to as principal neighborhood dictionary (PND) NLM results in a significant computational saving together with increased estimation accuracy .
In this paper, a novel NLM denoising algorithm based on the concept of anisotropic structure tensor is proposed. Inferred from the anisotropic filter , the structure tensor encapsulates structure information of the pixel (or patch), which is used in conjunction with image intensity to compute similarity weights in this work. Moreover, current algorithms (such as PND) commonly treat a patch as a vector whose components correspond to the pixel intensities in it and define the similarity weight as a mean Euclidean distance between the individual components. In the proposed algorithm, we improve upon the simplistic weighting scheme by computing the similarity distance between structure tensors in a Riemannian space and comparing the structure information of the pixel as an ensemble. It is anticipated that this new method will effectively increase the accuracy of similarity comparisons and thus will significantly enhance the performance of image denoising.
The structure of the letter is as follows. Section 2 describes the proposed algorithm in detail. Section 3 provides denoising experiments using the proposed algorithm, the PND, and the original NLM. Section 4 concludes some key contributions of this work.
The original NLM image denoising algorithm introduced by Buades et al.  smoothes images according to a weighted mean with the weights defined by the intensity similarity in a predetermined neighborhood. Specifically, for a position , a filtered intensity is computed as follows: where , are the positions of image pixels, is the noised image, and is a neighborhood of with a reasonable size. The parameter is a weighting factor computed as where is an Euclidean distance between vectors whose elements are the gray levels of neighboring pixels centered around and with a fixed size, controls the rate of decay of the exponential function, and is a normalizing factor as follows
According to the equations above, the estimated value of is a weighted average of pixels in the neighborhood , and the pixels with a more similar gray level will be assigned larger weights. However, as pointed out earlier, using gray level alone does not fully capture the structure information contained in a neighborhood of pixels.
To capture the structure information, the concept of structure tensor can be used. The structure tensor encapsulates the predominant direction of the intensity gradient in a given neighborhood and the degree to which those directions are spatially coherent . The 2D structure tensor can be written as a matrix as follows where is a summation index ranging over a finite set (the “window,” typically for a constant ), is a fixed weight depending on , such that the sum of all weights is 1, and is a matrix-valued array as follows: where and are mean derivatives with respect to and coordinates.
As seen in (4) and (5), the structure tensor characterizes intensity variations of the pixels in a neighborhood, so comparisons between structure tensors at different pixel locations can provide more structure information which can be used to enhance the weighting scheme of NLM.
Similar to the Euclidean distance of intensities between pixels and , the similarity of structure tensor and can be defined using Euclidean distance of individual element of the tensor. However, since the structure tensor resides in a non-Euclidean space, this Euclidean type of operation is quite problematic due to the widely recognized swelling effect which tends to blend the orientation and diffusivity feature . To circumvent this issue, affine-invariant Riemannian metrics have been proposed as more rigorous and general frameworks for tensor comparisons [24–26]. In this paper, a Riemannian metric called Log-Euclidean metric is used for its nice theoretical properties along with simple and fast computations . According to this framework, the similarity between structure tensors and is computed as follows:
As alluded to before, comparing pixels in terms of distances in both gray level and its derivatives simultaneously provides more accurate estimation of similarity in the local image structure. Therefore, we redefine the weighting factor in (2) to include both the gray level similarity and structure similarity below: where the weighting parameter regulates a trade-off between the image intensity and structure tensor. This weighting scheme reduces to the original NLM scheme when is assigned to 0. The corresponding normalizing factor is re-defined accordingly as
In this section, we first present experimental findings on the effects of the weighting parameter on the performance of the proposed algorithm and then quantitatively and qualitatively compare the performance of the proposed algorithm with that of the PND algorithm  and the original NLM algorithm . It should be pointed out that selections of other parameters including the smoothing kernel , the subspace dimensionality, and search-window size are not the primary concern of this work. Therefore these parameters are defined according to literature reports [6, 21]. As suggested in , the parameter is used according to the noise level (), and the subspace dimensionality and the search-window size are and , respectively, which have been discussed in  as a relatively optimal selection.
The weighting parameter in (7) controls relative contributions of gray level similarity and structure tensor similarity. To examine the effects of , experiments using four different images (House, Coins, Lena, and Cameraman) corrupted by additive Gaussian noise with standard deviation were conduct. Figure 1 shows variations of the peak signal-to-noise ratio (PSNR) with the value of this parameter. It can be seen that, in general, the PSNR in all four images increases as the parameter increases from 0 to 20, beyond which the PSNR oscillates irregularly and tends to decline as approaches 50. Based on the observations in Figure 1, the trend of these curves implicates different roles of the gray level similarity and structure tensor similarity. Briefly, when there is a large intensity difference between the pixels under comparison, the overall similarity is mainly given by the intensity difference. On the other hand, when the difference in the intensity between two pixels is small, the structure tensor similarity will have a dominant role. Given these and the observations from Figure 1, the parameter is set to 20 in all the following experiments.
To compare the performance of the proposed algorithm with that of the PND and the NLM, the same four test images corrupted by additive Gaussian noise but with different standard deviation (, 25, and 50) were used, each of which was denoised with the three denoising algorithms above. Comparisons were made with three criteria that included: visual assessment, PSNR, and mean structure similarity index map (MSSIM) , with each measuring a specific aspect of the denoising effect. Among them, visual assessment (Figure 2) qualitatively demonstrates how well the denoised images can be visually interpreted, the weighting distribution of pixel similarity is demonstrated in Figure 3, the PSNR (Table 1) quantitatively measures the extent to which noise has been suppressed, and the MSSIM (Table 2) gauges the clarity of detail and boundary definition after denoising.
Figure 2 presents the denoised images using the proposed algorithm, the PND, and the NLM. Among different noise levels, only the images with the highest noise standard deviation () are demonstrated in order to emphasize the differences among the algorithms. It can be seen that even in this relatively high noise standard, the denoising effects of the three algorithms are quite reasonable, except for a little blurring in the output of the NLM (the last column). Careful observations of the denoised images by the proposed algorithm (the second column) and the PND algorithm (the third column) reveal that denoised images by the proposed algorithm appear clearer (e.g., the declaration of the hat in Lena) and boundaries are much better defined (e.g., the upper edge of the roof in House). This phenomenon is reasonable because the proposed algorithm incorporates full structure information into the weighting scheme, and the comparisons are made in a Riemannian space, which provides more accurate evaluation of the tensor.
Figure 3 compares the weighting distribution between NLM and the proposed algorithm. It can be seen that the weighting distributions of both algorithms are approximately same in uncorrupted image. In noised image (Figure 3(d)), NLM lost a great number of pixels with high similarity because of the gray intensity variation caused by noise (Figure 3(e)). On the other hand, the proposed algorithm uses both gray level and structure tensor to weight the similarity and keep most of the high similarity pixels (Figure 3(f)) thus will be a great benefit for the further denoising process.
To quantitatively evaluate the denoising effects, PSNR and MSSIM of the four images corrupted by zero mean Gaussian noise with different levels and then denoised by the three algorithms are calculated, with results shown in Tables 1 and 2, respectively. In general, the proposed algorithm and the PND outperform the original NLM, though the denoising effects of the three algorithms are almost identical when the noise level is low (). And compared with the PND, the PSNR is comparable for the two algorithms (each with 6 better measures than the other), but the MSSIM is superior for the proposed algorithm (with 8 better measures). Similar to the qualitative assessment, the performance gained by the proposed algorithm is attributable to the new similarity measure defined and tensor computation in the Riemannian space.
Computational efficiency of the proposed algorithm mainly depends on the size of image. Under the parameter setting in this letter and on a notebook computer with an Intel Core i7 CPU and 4 GB RAM, the proposed algorithm uses approximately 12 seconds to denoise a image compared with 9 seconds of NLM and 5 seconds of PND.
In this paper, a novel NLM denoising algorithm simultaneously using intensity and structure information was proposed. Following the concept of anisotropic filtering, structure information around an image pixel is characterized by structure tensor more comprehensively. Moreover, similarity of the structure tensor is compared in a Riemannian space with a Log-Euclidean metrics. This method evaluates the structure tensor as an ensemble, which is anticipated to yield better comparison. The weighting scheme of the proposed method represents a reasonable trade-off between pixel intensity and structure tensor: when the pixels under comparison have a large difference in the intensity, the weight is mainly determined by the gray level; when the pixels have similar gray level, the structure information characterized by the structure tensor will dominate the weight. In sum, the proposed method fully utilizes the intensity and its derivative information to weight the compared pixels (or patches). This improvement can increase the accuracy of pixel comparisons and weighting significantly, thus enhancing the performance of NLM denoising both qualitatively and quantitatively.
This study was supported by National Natural Science Foundation of China (NSFC) Grant 81201158 and 61271330.
- V. Katkovnik, A. Foi, K. Egiazarian, and J. Astola, “From local kernel to nonlocal multiple-model image denoising,” International Journal of Computer Vision, vol. 86, no. 1, pp. 1–32, 2010.
- P. Perona and J. Malik, “Scale space and edge detection using anisotropic diffusion,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, pp. 629–639, 1990.
- L. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,” Physica D, vol. 60, no. 1–4, pp. 259–268, 1992.
- A. Foi, V. Katkovnik, and K. Egiazarian, “Pointwise shape-adaptive DCT for high-quality denoising and deblocking of grayscale and color images,” IEEE Transactions on Image Processing, vol. 16, no. 5, pp. 1395–1411, 2007.
- J. Portilla, V. Strela, M. J. Wainwright, and E. P. Simoncelli, “Image denoising using scale mixtures of Gaussians in the wavelet domain,” IEEE Transactions on Image Processing, vol. 12, no. 11, pp. 1338–1351, 2003.
- A. Buades, B. Coll, and J. M. Morel, “A review of image denoising algorithms, with a new one,” Multiscale Modeling and Simulation, vol. 4, no. 2, pp. 490–530, 2005.
- C. Tomasi and R. Manduchi, “Bilateral filtering for gray and color images,” in Proceedings of the IEEE International Conference on Computer Vision, pp. 839–846, Bombay, India, 1998.
- C. Kervrann and J. Boulanger, “Local adaptivity to variable smoothness for exemplar-based image regularization and representation,” International Journal of Computer Vision, vol. 79, no. 1, pp. 45–69, 2008.
- A. Buades, B. Coll, and J. M. Morel, “Nonlocal image and movie denoising,” International Journal of Computer Vision, vol. 76, no. 2, pp. 123–139, 2008.
- Y. Lou, X. Zhang, S. Osher, and A. Bertozzi, “Image recovery via nonlocal operators,” Journal of Scientific Computing, vol. 42, no. 2, pp. 185–197, 2010.
- S. Zimmer, S. Didas, and J. Weickert, “A rotationally invariant block matching strategy improving image denoising with nonlocal means,” in Proceedings of the International Workshop on Local and Nonlocal Approximation in Image Processing, LNLA, Lausanne, Switzerland, 2008.
- S. Grewenig, S. Zimmer, and J. Weickert, “Rotationally invariant similarity measures for nonlocal image denoising,” Journal of Visual Communication and Image Representation, vol. 22, no. 2, pp. 117–130, 2011.
- L. Manjon, P. Coupe, A. Buades, D. L. Collins, and M. Robles, “New methods for MRI denoising based on sparseness and self-similarity,” Medical Image Analysis, vol. 16, pp. 18–27, 2012.
- V. Katkovnik, K. Egiazarian, and J. Astola, Local Approximation Techniques in Signal and Image Processing, SPIE Press, Bellingham, Wash, USA, 2006.
- A. Buades, B. Coll, and J. M. Morel, “The staircasing effect in neighborhood filters and its solution,” IEEE Transactions on Image Processing, vol. 15, no. 6, pp. 1499–1505, 2006.
- A. Buades, B. Coll, and J. M. Morel, “Neighborhood filters and PDE's,” Numerische Mathematik, vol. 105, no. 1, pp. 1–34, 2006.
- P. Chatterjee and P. Milanfar, “A generalization of Non-Local Means via kernel regression,” in Proceedings of the Computational Imaging VI, San Jose, Calif, USA, January 2008.
- J. Orchard, M. Ebrahimi, and A. Wong, “Efficient nonlocal-means denoising using the SVD,” in Proceedings of the IEEE International Conference on Image Processing (ICIP '08), pp. 1732–1735, San Diego, Calif, USA, October 2008.
- N. Azzabou, N. Paragios, and F. Guichard, “Image denoising based on adapted dictionary computation,” in Proceedings of the 14th IEEE International Conference on Image Processing (ICIP '07), pp. III109–III112, San Antonio, Tex, USA, September 2007.
- T. Tasdizen, “Principal components for non-local means image denoising,” in Proceedings of the IEEE International Conference on Image Processing (ICIP '08), pp. 1728–1731, San Diego, Calif, USA, October 2008.
- T. Tasdizen, “Principal neighborhood dictionaries for nonlocal means image denoising,” IEEE Transactions on Image Processing, vol. 18, no. 12, pp. 2649–2660, 2009.
- J. Weickert, Anisotropic Diffusion in Image Processing, Teubner, Hildesheim, Germany, 1998.
- C. Chefd'hotel, D. Tschumperlé, R. Deriche, and O. Faugeras, “Regularizing flows for constrained matrix-valued images,” Journal of Mathematical Imaging and Vision, vol. 20, no. 1-2, pp. 147–162, 2004.
- X. Pennec, P. Fillard, and N. Ayache, “A riemannian framework for tensor computing,” International Journal of Computer Vision, vol. 66, no. 1, pp. 41–66, 2006.
- P. T. Fletcher and S. Joshi, “Riemannian geometry for the statistical analysis of diffusion tensor data,” Signal Processing, vol. 87, no. 2, pp. 250–262, 2007.
- V. Arsigny, P. Fillard, X. Pennec, and N. Ayache, “Log-Euclidean metrics for fast and simple calculus on diffusion tensors,” Magnetic Resonance in Medicine, vol. 56, no. 2, pp. 411–421, 2006.
- Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image quality assessment: from error visibility to structural similarity,” IEEE Transactions on Image Processing, vol. 13, no. 4, pp. 600–612, 2004.
Copyright © 2013 Xi Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.