Computational and Mathematical Methods in Medicine

Volume 2015 (2015), Article ID 232389, 11 pages

http://dx.doi.org/10.1155/2015/232389

## A MRI Denoising Method Based on 3D Nonlocal Means and Multidimensional PCA

^{1}School of Computer Science, Chengdu University, Chengdu 610106, China^{2}Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan, Chengdu, China

Received 14 June 2015; Revised 12 August 2015; Accepted 24 August 2015

Academic Editor: Anne Humeau-Heurtier

Copyright © 2015 Liu Chang 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.

#### Abstract

Recently nonlocal means (NLM) and its variants have been applied in the various scientific fields extensively due to its simplicity and desirable property to conserve the neighborhood information. The two-stage MRI denoising algorithm proposed in this paper is based on 3D optimized blockwise version of NLM and multidimensional PCA (MPCA). The proposed algorithm takes full use of the block representation advantageous of NLM3D to restore the noisy slice from different neighboring slices and employs MPCA as a postprocessing step to remove noise further while preserving the structural information of 3D MRI. The experiments have demonstrated that the proposed method has achieved better visual results and evaluation criteria than 3D-ADF, NLM3D, and OMNLM_LAPCA.

#### 1. Introduction

As a significant imaging technique, magnetic resonance imaging (MRI) provides very important information to research the tissues and organs in the human body with noninvasive style. However, MRI is affected by several artifacts and noise sources. One of them is the random fluctuation of the MRI signal which is mainly due to thermal noise. Such noise seriously degrades the acquisition of any quantitative measurements from the data. Consequently, the denoising techniques are required to improve the quality of MRI.

Generally speaking, MRI denoising techniques can be classified as either filtering, transform, or statistical approach [1]. Filtering methods remove noise with linear or nonlinear filters [2–5]. Transform methods employ some kinds of transformation to denoising MRI including wavelet transform [6] and curvelet transform [7]. Statistical methods estimate the noise with maximum likelihood [8], linear minimum mean square error (LMMSE) [9], Markov random process, and empirical Bayes [10]. In particular, nonlocal means (NLM) filter [11] has been used to denoise MRI image, achieving notable results [12–14]. NLM exploits the redundancy of the neighborhood pixel to remove the noise. The restored pixel is considered as the weighted average of the intensities of all pixels within the neighborhood area. Since MRI image has multichannel nature, NLM has been modified to denoise MRI data where the similarity measure can be considered to combine the relative information between different slices [15]. Nevertheless, the high computational burden has restricted its application for 3D MRI data. Therefore, [12] has proposed an optimized blockwise NLM filter for 3D MRI.

Due to its ability to perform decorrelation, PCA has also been used in image denoising. However, PCA requires that the number of images be bigger than the number of significant components of the image. The drawback has limited the application of PCA in the field of image denoising. The paper [16] has developed a two-stage approach to improve the quality of MRI data. After denoising with optimized* multicomponent* nonlocal mean (OMNLM), the local PCA is conducted over small local windows instead of the whole image to overcome the drawback. Nevertheless, PCA on overlapping windows will reduce the computational efficiency. Furthermore, the vectorization will make the structural information of image lost.

Actually, MRI is naturally a 3D image, which can be considered as tensor data on multidimensional space. From the aspect of super-resolution reconstruction, the noise image can be considered as the degraded version of the original image. Therefore, this paper proposed a multidimensional structure preserving MRI denoising algorithm. The algorithm consists of two stages. On the first stage, the 3D variant of the nonlocal means technique is employed to reduce the noise, which takes full advantage of the neighbor information between different 3D MRI slices and has the capability of exploiting the underlying structure in the multidimensional image. On the second stage, for the result image obtained from the first stage, multidimensional principal component analysis is performed to suppress the remaining noise, which avoids the vectorization to preserve the neighborhood information for MRI image and is helpful to improve the computation cost. According to the experiments on 3D MRI image, the proposed algorithm is superior to restore the original image from noise compared with other state-of-the-art methods.

#### 2. Material and Methods

##### 2.1. The 3D Variant of Nonlocal Mean

For image denoising problem, the noisy data is defined by the original noise free data with some noise :The classical NLM technology has believed that the intensity of the point can be restored from the weighted average of all the point intensities from the noisy image based on the redundant representations of image [13]:where is the weight assigned to point in the restoration of point and is the search area centered at the current point . According to (2), this method has the capability to reconstruct the voxel from all similar voxels in the restricted neighbor volume . Consequently, redundant information from the same MRI image and different slices can be used to reconstruct the current voxel efficiently.

The key issue of NLM is the computation of , which represents the similarity of neighborhood points. Generally speaking, within the search area , the weight is related to the distance , with and being neighborhoods around and as follows [13]:where is a normalization constant with and is a filtering parameter.

However, the basic NLM has a great influence for computational efficiency, especially for 3D MR images. Consequently, [12] has implemented the 3D blockwise version of NLM (NLM3D), which divides the volume into overlapping blocks and treats each block as a point to perform NLM-like restoration. For NLM3D, the and in (3) are 3D patches around points and , and is the similarity of the neighbor volumes between and . Based on the constrution of 3D neighbor blocks, the NLM3D will restore noisy data from neighbor blocks within intraslices and interslices simultaneously which is helpful to preserve the structural information of different slices for MRI. Therefore, compared with classical NLM, the method has not only reduced the complexity of NLM significantly but also achieved superior denoising performance. The NLM3D has already applied ito super-revolution reconstruction of MRI [17] with different preselection step and computation formulation of .

##### 2.2. Multidimensional Principal Component Analysis

Although PCA has been applied in image denoising widely, most denoising algorithms based on PCA assume that data lie on vector space and usually process the vectorization operation to make image into a vector. The vectorization destroys the structural information about the neighborhood.

Instead of data in vector space, any multidimensional data can be considered as tensor data in multidimensional space. Each tensor data will be treated by tensor decomposition [18]. It is helpful to preserve the structural information and enhance the computational efficiency. At present, a large number of tensor algorithms have been presented and have a wide application in computer vision, pattern recognition, and machine learning [19].

Based on PCA on vector space, [20] has developed multidimensional principal component analysis (MPCA) for tensor data and has achieved outstanding performance. For MPCA, a high-dimensional image dataset can be expressed as a tensor dataset , where is a dimensional tensor and is the number of samples in the dataset.

In tensor algebra, any tensor data can be expressed based on Tucker decomposition model as follows [20]:where is an orthogonal matrix. So we can getThe target of MPCA is to compute orthogonal projective matrices to maximize the total scatter tensor of the projected low-dimensional feature as follows:where is the mean of tensor data and .

Due to the difficulty in the computation of orthogonal projective matrices simultaneously, these orthogonal projective matrices can be solved iteratively. Generally speaking, it is assumed that the projective matrices are known; then we can solve the following optimized problem to obtain : where and is the mean of tensor data . is the mode- unfolding matrix of tensor . The paper [19] has proved the vector-based and 2DPCA can be considered as the special cases of MPCA.

##### 2.3. Proposed Method

To the best of our knowledge, this is the first attempt to introduce MPCA to MRI image denoising. It should be noticed that image denoising based on MPCA is different from its application in machine learning.

For MRI denoising, 3D MRI is a 3rd-order tensor , and are the height and width of each MRI slice, respectively, and is the number of slices, so 3D MRI can be considered as an image set . The principal components can be computed by MPCA:where , . Generally speaking, the first principal components conserve most information of images. It is desirable to abandon smaller principal components to remove noise. There are various approaches to determine the value of . The paper specifies a constant to represent the number of the largest principal components corresponding to the largest eigenvalues. After that, the restored image is expressed:where , , and is the restored image. Consequently, the proposed algorithm can be summarized.(1)NLM 3D filtering is applied to denoise and obtain the initial 3D images.(2)Then the initial 3D images are processed by MPCA to remove noise furtherly.

#### 3. Experiments

Several experiments were conducted to compare the proposed methods with related state-of-the-art methods.

In order to illustrate the performance of the proposed method, several experiments were conducted to compare the proposed methods with related state-of-the-art methods, including the 3D version of anisotropic diffusion filtering (3D-ADF) [3, 5], NLM3D [12], and OMNLM_LAPCA [16] on synthetic data and real clinical data. All experiments are performed on MATLAB R2015a.

There are some free parameters that need to be set to obtain optimal performance. For 3D anisotropic diffusion filtering, the integration constant is the maximum value, the number of iterations is 4, and the gradient modulus threshold is 70. For NLM3D and OMNLM_LAPCA, the radius of the search area is 5 and the radius of similarity area is 2. For the proposed method, the number of preserved largest principal components is 140 (see below).

Three kinds of quality measurement are used to evaluate the denoising performance. The first one is the signal-to-noise ratio (SNR), the second one is the peak signal-to-noise ratio (PSNR), and the last one is the structural similarity index (SSIM) [21].

The SNR is computed as follows:where is the original image, is the mean of image , and is the denoised image.

The PSNR is based on the root mean square error (RMSE) between the denoised image and original image:The SSIM is defined as follows:where , , is the dynamic range, , and ; and are the mean of images and , respectively; and are the standard noise variance of images and , respectively; is the covariance of and .

##### 3.1. Synthetic Data

In this part, the 3D T1-weighted MRI image in the well-known BrainWeb [22] dataset is used to evaluate the performance of the proposed method. The size of the dataset is with 1 mm^{3} voxel resolution. To simulate Rician noise, zero mean Gaussian noise with 3–5% standard deviation is added to the real and imaginary parts of the 3D MRI images, as shown in Figure 1.