Research Article  Open Access
3D Wavelet Subbands Mixing for Image Denoising
Abstract
A critical issue in image restoration is the problem of noise removal while keeping the integrity of relevant image information. The method proposed in this paper is a fully automatic 3D blockwise version of the nonlocal (NL) means filter with wavelet subbands mixing. The proposed wavelet subbands mixing is based on a multiresolution approach for improving the quality of image denoising filter. Quantitative validation was carried out on synthetic datasets generated with the BrainWeb simulator. The results show that our NLmeans filter with wavelet subbands mixing outperforms the classical implementation of the NLmeans filter in terms of denoising quality and computation time. Comparison with wellestablished methods, such as nonlinear diffusion filter and total variation minimization, shows that the proposed NLmeans filter produces better denoising results. Finally, qualitative results on real data are presented.
1. Introduction
Image denoising can be considered as a component of processing or as a process itself. In the first case, the image denoising is used to improve the accuracy of various image processing algorithms such as registration or segmentation. Then, the quality of the artifact correction influences performance of the procedure. In the second case, the noise removal aims at improving the image quality for visual inspection. The preservation of relevant image information is important, especially in a medical context.
This paper focuses on a new denoising method firstly introduced by Buades et al. [1] for 2D image denoising: the nonlocal (NL) means filter. We propose, to improve this filter with an automatic tuning of the filtering parameter, a blockwise implementation and a mixing of wavelet subands based on the approach proposed in [2]. These contributions lead to a fullyautomated method and overcome the main limitation of the classical NLmeans: the computational burden.
Section 2 presents related works. Section 3 presents the proposed method with details about our contributions. Section 4 shows the impact of our adaptations compared to different implementations of the NLmeans filter and proposes a comparison with wellestablished methods. The validation experiments are performed on a phantom dataset in a quantitative way. Finally, Section 5 shows results on real data.
2. Related Works
Many methods for image denoising have been suggested in the literature, and a complete review of them can be found in [1]. Methods for image restoration aim at preserving the image details and local features while removing the undesirable noise. In many approaches, an initial image is progressively approximated by filtered versions which are smoother or simpler in some sense. Total variation (TV) minimization [3], nonlinear diffusion [4–6], mode filters [7], or regularization methods [3, 8] are among the methods of choice for noise removal. Most of these methods are based on a weighted average of the gray values of the pixels in a spatial neighborhood [9, 10]. One of the earliest examples of such filters has been proposed by Lee [11]. An evolution of this approach has been presented by Tomasi and Manduchi [9] who devised the bilateral filter which includes both a spatial and an intensity neighborhood.
Recently, the relationships between bilateral filtering and local mode filtering [7], local Mestimators [12], and nonlinear diffusion [13] have been established. In the context of statistical methods, the bridge between the Bayesian estimators applied on a Gibbs distribution, resulting with a penalty functional [14] and averaging methods for smoothing, has also been described in [10]. Finally, statistical averaging schemes enhanced via incorporating a variable spatial neighborhood scheme have been proposed in [15–17].
All these methods aim at removing noise while preserving relevant image information. The tradeoff between noise removal and image preservation is performed by tuning the filter parameters, which is not an easy task in practice. In this paper, we propose to overcome this problem with a 3D subbands wavelet mixing. As in [2], we have chosen to combine a multiresolution approach with the NLmeans filter [1], which has recently shown very promising results.
Recently introduced by Buades et al. [1], the NLmeans filter proposes a new approach for the denoising problem. Contrary to most denoising methods based on a local recovery paradigm, the NLmeans filter is based on the idea that any periodic, textured, or natural image has redundancy, and that any voxel of the image has similar voxels that are not necessarily located in a spatial neighborhood. This new nonlocal recovery paradigm allows to improve the two most desired properties of a denoising algorithm: edge preservation and noise removal.
3. Methods
In this section, we introduce the following notations: (i) is the image, where represents the image grid, considered as cubic for the sake of simplicity and without loss of generality ;(ii)for the original voxelwise NLmeans approach, (a) is the intensity observed at voxel , (b) is the cubic search volume centered on voxel of size , , (c) is the cubic local neighborhood of of size , , (d) is the vector containing the intensities of (that we term “patch” in the following),(e) is the restored value of voxel , (f) is the weight of voxel when restoring (see Figure 1(a)); (iii)for the blockwise NLmeans approach, (a) is the block centered on of size , , (b) is the vector containing the intensities of the block , (c) is the vector containing the restored value of , (d) is the weight of block when restoring the block (see Figure 1(b)),(e) the blocks are centered on voxels which represent a subset of the image voxels, equally regularly distributed over (see Figure 2),(f) represents the distance between the centers of the blocks (see Figure 2).
(a)
(b)
3.1. The Nonlocal Means Filter
In the classical formulation of the NL means filter [1], the restored intensity of the voxel , is a weighted average of the voxels intensities in the “search volume” of size : where is the weight assigned to value to restore voxel . More precisely, the weight evaluates the similarity between the intensity of the local neighborhoods and centered on voxels and , such that and (cf., Figure 1, Left).
For each voxel in , the computation of the weight is based on the Euclidean distance between patches and , defined as where is a normalization constant ensuring that , and acts as a filtering parameter controlling the decay of the exponential function.
3.1.1. Automatic Tuning of the Filtering Parameter
As explained in the introduction, denoising is usually the first step of complex image processing procedures. The number and the dimensions of the data to process being continually increasing, each step of the procedures needs to be as automatic as possible. In this section, we propose an automatic tuning of the filtering parameter .
First, it has been shown that the optimal smoothing parameter is proportional to the standard deviation of the noise [1]. Second, if we want the filter independent of the neighborhood size, the optimal must depend on (see, (2)). Thus, the automatic tuning of the filtering parameter amounts to determining the relationship , where is a constant.
Firstly, the standard deviation of the noise needs to be estimated. In case of an additive white Gaussian noise, this estimation can be based on pseudoresiduals as defined in [18, 19]. For each voxel of the volume , let us define being the 6neighborhood at voxel and the constant is used to ensure that in the homogeneous areas. Thus, the standard deviation of noise is computed as Then, in order to make the filter independent of , we used the Euclidean distance normalized by the number of elements: Based on the fact that, in the case of Gaussian noise and with normalized L2norm, the optimal denoising is obtained for [20], (2) can be written as where only the adjusting constant needs to be manually tuned. If our estimation of the standard deviation of the noise is correct, should be close to 1. The optimal choice for will be discussed later.
3.1.2. Blockwise Implementation
The main problem of the NLmeans filter is being its computational time, a blockwise approach can be used to decrease the algorithmic complexity. Indeed, instead of denoising the image at a voxel level, entire blocks are directly restored.
A blockwise implementation of the NLmeans filter consists in (a) dividing the volume into blocks with overlapping supports, (b) performing NLmeanslike restoration of these blocks, and c) restoring the voxels values based on the restored values of the blocks they belong to, as follows. (1)A partition of the volume into overlapping blocks of size is performed, such as , under the constraint that each block intersects with at least one other block of the partition. These blocks are centered on voxels which constitute a subset of . The voxels are equally distributed at positions , where represents the distance between the centers of . To ensure a global continuity in the denoised image, the overlapping support of blocks is nonempty: .(2)For each block , an NLmeanslike restoration is performed as follows: where is a normalization constant ensuring that (see Figure 1, Right).(3) For a voxel included in several blocks , several estimations of the restored intensity are obtained in different . The estimations given by different for a voxel are stored in a vector . The final restored intensity of voxel is then defined as where denotes the element of the vector .
The main advantage of this approach is to significantly reduce the complexity of the algorithm. Indeed, for a volume of size , the global complexity is . For instance, with , the complexity is divided by a factor .
3.1.3. Block Selection
In [21–23], the authors have shown that neglecting the voxels/blocks with small weights (i.e., the most dissimilar patches to the current one) speeds up the filter and significantly improves the denoising results. Indeed, the selection of the most similar patches to the current patch to compute can be viewed as a spatially adaptation of the patch dictionaries. As in [21–23], the preselection of blocks in is based on the mean and the variance of and . The selection tests are given by where and represent, respectively, the mean and the variance of the intensity function for the block centered on the voxel . The new parameters and control the level of rejection related to tests. When and are close to , there is almost no selection and the number of patches taken into account increases: thus the denoised image becomes smoother. The filter is equivalent to the classical NLmeans and the computation time increases. When and are close to , the selection is more severe and the number of patches taken into account decreases: the denoised image is less smoothed and the computation time decreases. This kind of selection tends to better enhance the contrast. In practice, and were chosen as in [21, 22]: and .
3.2. Wavelet Subbands Mixing
3.2.1. Hybrid Approaches
Recently, hybrid approaches coupling the NLmeans filter and a wavelet decomposition have been proposed [2, 24, 25]. In [24], a waveletbased denoising of blocks is performed before the computation of the nonlocal means. The NLmeans filter is performed with denoised version of blocks in order to improve the denoising result. In [25], the NLmeans filter is applied directly on wavelet coefficients in transform domain. This approach allows a direct denoising of compressed images (such as JPEG2000) and a reduction of computational time since smaller images are processed. In [2], a multiresolution framework is proposed to adaptively combine the result of denoising algorithms at different spacefrequency resolutions. This idea relies on the fact that a set of filtering parameters is not optimal over all the spacefrequency resolutions. Thus, by combining to the transform domain the results obtained with different sets of filtering parameters, the denoising is expected to be improved.
3.2.2. Overall Processing
In order to improve the denoising result of the NLmeans filter, we propose a multiresolution framework similar to [2] to implicitly adapt the filtering parameters (, ) over the different spacefrequency resolutions of the image. This adaptation is based on the fact that the size of the patches impacts the denoising properties of the NLmeans filter. Indeed, the weight given to a block depends on its similarity with the block under consideration, but the similarity between the blocks depends on their sizes. Thus, given the size of the blocks, removal or preservation of image components can be favored.
In the transform domain, the main features of the image correspond to lowfrequency information while finer details and noise are associated to high frequencies. Nonetheless, noise is not a pure highfrequency component in most images. Noise is spanned over a certain range of frequencies in the image with mainly middle and high components [2].
In NLmeansbased restoration, large blocks and setting efficiently remove all frequencies of noise but tend to spoil the main features of the image, whereas small blocks and low smoothing parameter tend to better preserve the image components but cannot completely remove all frequencies of noise. As a consequence, we propose the following workflow (see Figure 3). (i)Denoising of the original image using two sets of filtering parameters: one adapted to the noise components removal (i.e., large blocks and ) and the other adapted to the image features preservation (i.e., small blocks and ). This yields two images and . In , the noise is efficiently removed and, conversely, in , the image features are preserved.(ii)Decomposing and into low and highfrequency subbands. The first level decomposition of the images is performed with a 3D discrete wavelet transform (DWT).(iii)Mixing the highestfrequency subbands of and the lowest frequency subbands of .(iv)Reconstructing the final image by an inverse 3D DWT from the combination of the selected high and low frequencies.
In this paper, we propose an implementation of this approach using our optimized blockwise NLmeans filter and the 3D DWT Daubechies8 basis. The latter is implemented in Qccpack (http://qccpack.sourceforge.net) in the form of dyadic subband pyramids. This DWT is widely used in image compression due to its robustness and efficiency.
3.2.3. Selection of Wavelet Subbands
Once the original image has been denoised using two sets of filtering parameters, a 3D DWT at the first level is performed on both and images. For each image, eight subbands are obtained: , , , , , , , and . (i)In the eight wavelet subbands obtained with , the frequencies corresponding to noise are efficiently removed from the high frequencies whereas the low frequencies associated to the main features are spoiled.(ii)In the eight wavelet subbands obtained with , the low frequencies associated to main features are efficiently preserved whereas residual frequencies corresponding to noise are present in high frequencies.
Thus, we select the highest frequencies of (i.e., , , , and ) and the lowest frequencies of (i.e., , , , and ). Then, the 4 lowest subbands of are combined with the 4 highest subbands of . Finally, an inverse 3D DWT is performed on these 8 selected subbands to obtain the final denoised image (see Figure 3).
In [21, 22], the optimal parameters for 3D MRI have been estimated as , , , and . In our experiments, the two sets of parameters used to obtain and were and . Compared to [21, 22], the size of “search volume” was reduced to decrease the computational time. Several sets of parameters have been tested, the mentioned numerical values are satisfying to balance the denoising performance (high PSNR values) and computational burden. Finally, to decrease the computational time, this workflow is parallelized and each version is computed on different CPUs or cores (see Figure 3).
4. Validation on a Phantom Data Set
4.1. Materials
In order to evaluate the performance of the different variants of the NLmeans filter on 3D MR images, tests were performed on the BrainWeb database [26]. Several images were simulated to validate the performance of the denoising on various images: (a) T1w phantom MRI for 4 levels of noise 3%, 9%, 15%, and 21% and (b) T2w phantom MRI with multiple sclerosis (MS) lesions for 4 levels of noise 3%, 9%, 15%, and 21%. A white Gaussian noise was added, and the notations of BrainWeb are used: a noise of is equivalent to , where is the value of the highest voxel intensity of the phantom (150 for T1w and 250 for T2w).
4.2. Comparison with Different NLMeans Filters
In the following, let us define the following. (i)NLmeans: standard voxelwise implementation with automatic tuning of the filtering parameter () [1].(ii)Optimized NLmeans: voxelwise implementation with automatic tuning of the filtering parameter () and voxels selection presented in [21].(iii)Optimized blockwise NLmeans: (This filter can be freely tested at http://www.irisa.fr/visages/bench marks) blockwise implementation with automatic tuning of the filtering parameter () and blocks selection presented in [22].(iv)Optimized blockwise NLmeans with wavelet mixing: proposed filter based on a blockwise implementation, an automatic tuning of the filtering parameter (), a block selection, and a wavelet subbands mixing. The selected filtering parameters for the different implementations were as follows. (i)For the NLmeans and optimized NLmeans filters, the parameters are those used in [21]: ,,,, and .(ii)Concerning the optimized blockwise NLmeans filter, the sets of parameters are those used in [22]: ,,,,, and .(iii)Finally, for the optimized blockwise NLmeans with wavelet mixing filter the parameter are the following: , , ,, and . For 8bit encoded images, the PSNR is defined as follows: where RMSE denotes the root mean square error estimated between the ground truth and the denoised image. For the sake of clarity, the PSNR values are estimated only in the region of interest (cerebral tissues) obtained by removing the background (i.e., the label 0 of the discrete model in Brainweb).
Firstly, we have experimentally verified that the optimal denoising is obtained for for high levels of noise and for low levels of noise. These results account for the error in the estimation of ( at , at , at , and at ) (see Figure 4). The parameter was fixed to 1 for all the experiments.
4.2.1. Quantitative Results
Table 1 shows that the blockwise approach of the NLmeans filter, with and without voxels selection (see (9)), allows to drastically reduce the computational time. With a distance between the block centers corresponding to , the blockwise approach divides the timings by a factor superior to (see Table 1). However, the computational time reduction is balanced with a slight decrease of the PSNR (see Figure 5) compared to the optimized NLmeans filter presented in [21]. Our optimized blockwise NLmeans with wavelet mixing allows to compensate this slight decrease of the PSNR and to divide the computational by a factor compared to the optimized NLmeans filter.

(a)
(b)
4.2.2. Visual Assessment
Visually, the proposed method combines the most important attributes of a denoising algorithm: edge preservation and noise removal. Figure 6 shows that our filter removes noise while keeping the integrity of MS lesions (i.e., no structure appears in the removed noise). Figure 7 focuses on the differences between the optimized blockwise NLM and the optimized blockwise NLM with WM filters. The denoising result obtained with the optimized blockwise NLM with WM filter visually preserves the edges better than the optimized blockwise NLM filter. This is also confirmed by visual inspection of the comparison with the “ground truth”. The images of difference between the phantom and the denoised image (see bottom of Figure 7) show that less structures have been removed with the optimized blockwise NLM with WM filter. Thus, the multiresolution approach allows to better preserve the edges and to enhance the contrast between tissues.
(a)
(b)
(c)
(d)
4.3. Comparison with Other Methods
In this section, we compare the proposed method with two of the most used approaches in MRI domain: the nonlinear diffusion (NLD) filter r [4] and the total variation (TV) minimization [3]. The main difficulty to achieve this comparison is related to the tuning of smoothing parameters in order to obtain the best results for NLD filter and TV minimization scheme. After quantifying the parameter space, we exhaustively tested all possible parameters within a certain range. This allows us to obtain the best possible results for the NLD filter and the TV minimization.
For the optimized blockwise NLM with WM, the same set of parameters and are used for all noise levels. The automatic tuning of adapts the smoothing to the noise level.
For NLD filter, the parameter K varied from to with a step of and the number of iterations varied from to . For TV minimization, the parameter varied from 0.01 to 1 with a step of 0.01 and the number of iterations varied from 1 to 10. The results obtained for a of Gaussian noise are presented in Figure 8, but this screening was performed for the four levels of noise. It is important to underline that the results giving the best PSNR are used, but these results do not necessarily give the best visual output. Actually, the best PSNR value for the NLD filter and TV minimization are obtained for a visually undersmoothed image since these methods tend to spoil the edges. This is explained by the fact that the optimal PSNR is obtained when a good tradeoff is reached between edge preserving and noise removing.
(a)
(b)
4.3.1. Quantitative Results
As presented in Figure 9, our blockoptimized NLmeans with wavelet mixing filter produced the best PSNR values whatever the noise level is. On average, a gain of dB is achieved compared to TV minimization and AD filter. The PSNR value between the noisy image and the ground truth is called “No processing” and is used as a reference.
4.3.2. Visual Assessment
Figure 10 shows the denoising results obtained by the NLD filter, the TV minimization, and our optimized blockwise NLM with WM. Visually, the NLmeansbased approach produced the best denoising. The removed noise (see middle of Figure 10) shows that the proposed method removes significantly less structures than NLD filter or TV minimization. Finally, the comparison with the “ground truth” underlines that the NLmeans restoration gives a result very close to the “ground truth” and better preserves the anatomical structure compared to NLD filter and TV minimization.
5. Experiments on Clinical Data
The T1weighted MR images used for experiments were obtained with T1 sense 3D sequence on 3T Philips Gyroscan scanner. The restoration results, presented in Figure 11, show good preservation of the cerebellum. Fully automatic segmentation and quantitative analysis of such structures are still a challenge, and improving restoration schemes could greatly improve these processings.
(a)
(b)
(c)
6. Discussion and Conclusion
This paper presented a fully automated blockwise version of the nonlocal means filter with subbands wavelet mixing. Experiments were carried out on the BrainWeb dataset [26] and real dataset. The results on phantom shows that the proposed optimized blockwise NLmeans with subbands wavelet mixing filter outperforms the classical implementation of the NLmeans filter and the optimized implementation presented in [21, 22], in terms of PSNR values and computational time. Compared to the classical NLmeans filter, our implementation (with block selection, blockwise implementation, and wavelet subbands mixing) considerably decreases the required computational time (up to a factor of 20) and significantly increases the PSNR of the denoised image. The comparison of the filtering process with and without wavelet mixing shows that the subbands mixing better preserves edges and better enhances the contrast between the tissues. This multiresolution approach allows to adapt the smoothing parameters along the frequencies by combining several denoised images. The comparison with wellestablished methods such as NLD filter and TV minimization shows that the NLmeansbased restoration produces better results. Finally, the impact of the proposed multiresolution approach based on wavelet subbands mixing should be investigated further, for instance, when combined to the nonlinear diffusion filter [4] and the total variation minimization [3].
References
 A. Buades, B. Coll, and J.M. Morel, “A review of image denoising algorithms, with a new one,” Multiscale Modeling & Simulation, vol. 4, no. 2, pp. 490–530, 2005. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 A. Lukin, “A multiresolution approach for improving quality of image denoising algorithms,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '06), vol. 2, pp. 857–860, Toulouse, France, 2006 May. View at: Publisher Site  Google Scholar
 L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,” Physica D, vol. 60, no. 1–4, pp. 259–268, 1992. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 P. Perona and J. Malik, “Scalespace and edge detection using anisotropic diffusion,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 629–639, 1990. View at: Publisher Site  Google Scholar
 M. J. Black and G. Sapiro, “Edges as outliers: anisotropic smoothing using local image statistics,” in Proceedings of the 2nd International Conference on ScaleSpace Theories in Computer Vision (ScaleSpace '99), pp. 259–270, Corfu, Greece, 1999 September. View at: Publisher Site  Google Scholar
 D. Tschumperlé, “Curvaturepreserving regularization of multivalued images using PDE's,” in Proceedings of the 9th European Conference on Computer Vision (ECCV '06), pp. 295–307, 2006 May. View at: Publisher Site  Google Scholar
 J. van de Weijer and R. van den Boomgaard, “Local mode filtering,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '01), vol. 2, pp. 428–433, 2001 December. View at: Publisher Site  Google Scholar
 D. Mumford and J. Shah, “Optimal approximations by piecewise smooth functions and variational problems,” Communications on Pure and Applied Mathematics, vol. 42, no. 5, pp. 577–685, 1989. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 C. Tomasi and R. Manduchi, “Bilateral filtering for gray and color images,” in Proceedings of the 6th IEEE International Conference on Computer Vision (ICCV '98), pp. 839–846, IEEE Computer Society, Bombay, India, January 1998. View at: Publisher Site  Google Scholar
 M. Elad, “On the origin of the bilateral filter and ways to improve it,” IEEE Transactions on Image Processing, vol. 11, no. 10, pp. 1141–1151, 2002. View at: Publisher Site  Google Scholar  PubMed  MathSciNet
 J. S. Lee, “Digital image smoothing and the sigma filter,” Computer Vision, Graphics and Image Processing, vol. 24, no. 2, pp. 255–269, 1983. View at: Publisher Site  Google Scholar
 G. Winkler, V. Aurich, K. Hahn, A. Martin, and K. Rodenacker, “Noise reduction in images: some recent edgepreserving methods,” Pattern Recognition and Image Analysis, vol. 9, pp. 749–766, 1999. View at: Google Scholar
 D. Barash, “A fundamental relationship between bilateral filtering, adaptive smoothing, and the nonlinear diffusion equation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 6, pp. 844–847, 2002. View at: Publisher Site  Google Scholar
 S. Geman and D. Geman, “Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, pp. 721–741, 1984. View at: Google Scholar
 J. Polzehl and V. G. Spokoiny, “Adaptive weights smoothing with applications to image restoration,” Journal of the Royal Statistical Society: Series B, vol. 62, no. 2, pp. 335–354, 2000. View at: Publisher Site  Google Scholar  MathSciNet
 V. Katkovnik, K. Egiazarian, and J. Astola, “Adaptive window size image denoising based on intersection of confidence intervals (ICI) rule,” Journal of Mathematical Imaging and Vision, vol. 16, no. 3, pp. 223–235, 2002. View at: Publisher Site  Google Scholar  MathSciNet
 C. Kervrann, “An adaptive window approach for image smoothing and structures preserving,” in Proceedings of the 8th European Conference on Computer Vision (ECCV '04), vol. 3023, part III, pp. 132–144, 2004 May. View at: Google Scholar
 T. Gasser, L. Sroka, and C. J. Steinmetz, “Residual variance and residual pattern in nonlinear regression,” Biometrika, vol. 73, no. 3, pp. 625–633, 1986. View at: Publisher Site  Google Scholar  MathSciNet
 J. Boulanger, C. Kervrann, and P. Bouthemy, “Adaptive spatiotemporal restoration for 4D fluorescence microscopic imaging,” in Proceedings of the 8th International Conference on Medical Image Computing and ComputerAssisted Intervention (MICCAI '05), pp. 893–901, Palm Springs, Calif, USA, 2005 October. View at: Publisher Site  Google Scholar
 A. Buades, B. Coll, and J.M. Morel, “Image and movie denoising by nonlocal means,” Tech. Rep. 25, CMLA, Cachan cédex, France, 2006. View at: Google Scholar
 P. Coupé, P. Yger, and C. Barillot, “Fast non local means denoising for 3D MR images,” in Proceedings of the 9th International Conference on Medical Image Computing and ComputerAssisted Intervention (MICCAI '06), R. Larsen, M. Nielsen, and J. Sporring, Eds., vol. 4191 of Lecture Notes in Computer Science, pp. 33–40, Springer, Copenhagen, Denmark, October 2006. View at: Google Scholar
 P. Coupé, P. Yger, S. Prima, P. Hellier, C. Kervrann, and C. Barillot, “An optimized blockwise non local means denoising filter for 3D magnetic resonance images,” in press. View at: Google Scholar
 C. Kervrann, J. Boulanger, and P. Coupé, “Bayesian nonlocal means filter, image redundancy and adaptive dictionaries for noise removal,” in Proceedings of the 1st International Conference on Scale Space and Variational Methods in Computer Vision (SSVM '07), pp. 520–532, 2007 MayJune. View at: Publisher Site  Google Scholar
 K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image denoising with blockmatching and 3D filtering,” in Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning, vol. 6064 of Proceedings of SPIE, pp. 1–12, 2006 January. View at: Publisher Site  Google Scholar
 W. Souidene, A. Beghdadi, and K. AbedMeraim, “Image denoising in the transformed domain using non local neighborhoods,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '06), vol. 2, pp. 869–872, 2006 May. View at: Publisher Site  Google Scholar
 D. L. Collins, A. P. Zijdenbos, V. Kollokian et al., “Design and construction of a realistic digital brain phantom,” IEEE Transactions on Medical Imaging, vol. 17, no. 3, pp. 463–468, 1998. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2008 Pierrick Coupé 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.