About this Journal Submit a Manuscript Table of Contents 
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 242043, 14 pages
doi:10.1155/2012/242043
Research Article

A Multiplicative Noise Removal Approach Based on Partial Differential Equation Model

Bo Chen, Jin-Lin Cai, Wen-Sheng Chen, and Yan Li

College of Mathematics and Computational Science, Shenzhen University, Shenzhen 518060, China

Received 26 February 2012; Accepted 23 March 2012

Academic Editor: Ming Li

Copyright © 2012 Bo Chen 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

Multiplicative noise, also known as speckle noise, is signal dependent and difficult to remove. Based on a fourth-order PDE model, this paper proposes a novel approach to remove the multiplicative noise on images. In practice, Fourier transform and logarithm strategy are utilized on the noisy image to convert the convolutional noise into additive noise, so that the noise can be removed by using the traditional additive noise removal algorithm in frequency domain. For noise removal, a new fourth-order PDE model is developed, which avoids the blocky effects produced by second-order PDE model and attains better edge-preserve ability. The performance of the proposed method has been evaluated on the images with both additive and multiplicative noise. Compared with some traditional methods, experimental results show that the proposed method obtains superior performance on different PSNR values and visual quality.

1. Introduction

Image denoising plays an important role in the areas of image processing. A real recorded image may be distorted by many expected or unexpected random factors, of which random noise is an unavoidable one [1, 2]. The objective of image denoising or filtering is to recover the true image from the noisy one. One of the challenges during the denoising process is to preserve and enhance the important features. For images, edge is one of the most universal and crucial features. Denoising via linear filters normally does not give satisfactory performance since both noises and edges contain high frequencies. Therefore, some nonlinear filters [3–18] have been proposed. Median filter [1] is one of the classical examples. Wavelet-based image filters [19–22] are developing quickly. PDE-based nonlinear diffusion filters [23–26] also make a hit on image denoising. One of PDE-based methods is the famous total variation model (TVM) [27–35]. TVM has been improved in theory and algorithm continuously. Recently, Kim [23] proposed a model called 𝛼 𝛽 𝜔 (ABO)-model by hybridizing a nonconvex variant of the TVM, the motion by mean curvature (MMC) [29], and Perona-Malik model [4] to deal with the mixture of the impulse and Gaussian noises reliably. In [23], they apply the essentially nondissipative difference (ENoD) schemes [5, 6] for the MMC component to eliminate the impulse noise with a minimum (ideally no) introduction of dissipation. Many denoising methods are also employed in medical image processing [36–39].

Due to the coherent nature of some complicated image acquisition processes, such as ultrasound imaging, synthetic aperture radar (SAR) and sonar (SAS), and laser imaging, the standard additive noise model, so prevalent in image processing, is inadequate. Instead, multiplicative noise models, that is, in which the noise field is multiplied by (not added to) the original image, provide an accurate description of coherent imaging systems [40–42]. Multiplicative noise is naturally dependent on the image data. Various adaptive filters [43, 44] for multiplicative noise removal have been proposed. Experiments have shown that filtering methods work well when the multiplicative noise is weak.

In this paper, a new fourth-order PDE model is introduced by improving the original fourth-order PDE model [24] in order to get high fidelity of the denoised images. To solve the model efficiently and reliably, we suggest a simple and symmetrical difference schemes. Median filter is exploited to alleviate the speckle effects in the processed image. At the same time, a new multiplicative noise removal algorithm based on fourth-order PDE model is proposed for the restoration of noisy image. To apply the proposed model for removal of multiplicative noise, the Fourier transform is used to change convolution into product; meanwhile, the logarithmic transformation is used to convert multiplicative noise into additive one. Experimental results show that the proposed method gets nice result in restoring images, especially in edge preservation and enhancement.

The rest of this paper is organized as follows. In Section 2 we investigate a general model of multiplicative noise. Total variation model and its discretization are introduced in Section 3. In order to avoid the blocky effects of second-order PDE model and preserve edges, a new fourth-order PDE denoising model is proposed in Section 4. Section 5 is devoted to a study of multiplicative noise removal method, and an algorithm based on fourth-order PDE model is developed. Numerical results are presented in Section 6. We summarize our conclusions in Section 7.

2. Multiplicative Noise Model

Noise removal or reduction is very important in image processing community. The objection of image denoising or filtering is to recover the true image from a noisy one. There are different noise types in real world. Multiplicative noise is common beside additive noise. Quality of images may degenerate while images’ obtaining, transferring, and storage. The movement of objects, the defects of the imaging system, the noise of the inherent record equipment, and external disturbance also cause the image noise. Under the assumption that imaging system is linear translation invariance system, we can use the following degradation model to describe the multiplicative noise images: 𝑢 0 ( 𝑥 , 𝑦 ) = ℎ 𝑑 ( 𝑥 , 𝑦 ) ∗ 𝑓 ( 𝑥 , 𝑦 ) + 𝑛 ( 𝑥 , 𝑦 ) , ( 2 . 1 ) where 𝑓 is the ideal image, 𝑢 0 is the noised image, 𝑛 denotes the additive noise with mean 0 and variance 𝜎 2 , * denotes convolution operation, ℎ 𝑑 denotes the point spread function (PSF), andGaussian function can be considered as one of the classical PSF: 𝐺 𝑑 − 𝑥 ( 𝑥 , 𝑦 ) = e x p 2 + 𝑦 2 2 𝜎 2 , ( 2 . 2 )

Therefore, the synthesized images with multiplicative noise in this paper are generated for ideal images convolution with 2D Gaussian kernels and then noised with additive Gaussian white noise. An example is shown in Figure 1. ℎ 𝑑 in (2.1) is chosen as (2.2), namely Gaussian function templates. 3 × 3 Gaussian function template 𝑇 3 = ( 1 / 1 6 ) × 1 2 1 2 4 2 1 2 1 is employed here.

fig1
Figure 1: Multiplicative noise images. (a) Original “Lena” image; (b) image convolution with template 3 × 3 of (a); (c) image with Gaussian white noise of mean 0 and variance 0.01; (d) image with Gaussian white noise of mean 0 and variance 0.05; (e) original “vegetables” image; (f) image convolution with template 3 × 3 of (a); (g) image with Gaussian white noise of mean 0 and variance 0.01; (h) image with Gaussian white noise of mean 0 and variance 0.05.

3. Total Variation Model

In order to recover the true image 𝑓 as much as possible and/or to find a new image 𝑢 in which the information of interest such as object boundary in the image is more obvious and/or more easily extracted, we will discuss PDE-based image denoising in this section. Second-order PDE models have been studied as a useful tool for image denoising. The classical model of them is total variation model (TVM) [27], and we will introduce it.

TVM was first proposed by Rudin et al. [27]. It is now one of the most successful tools in image restoration. TVM has a simple fixed filter structure. In terms of the mathematical foundation, unlike most statistical filters, TVM is based on functional analysis and geometry. The additive noise removal problem is converted to energy function minimization problem as below: 𝐸 𝑢 = a r g m i n T V 𝐸 ( 𝑢 ) T V ( 𝑢 ) = Ω | | | | 𝜆 ∇ 𝑢 𝑑 𝑥 𝑑 𝑦 + 2 Ω 𝑢 0 − 𝑢 2 𝑑 𝑥 𝑑 𝑦 , ( 3 . 1 ) where Ω denotes image domain, and 𝜆 is Lagrange multiplier. The selection of the parameter 𝜆 is very important for the smoothing result. The corresponding Euler-Lagrange equation is − ∇ ⋅ ∇ 𝑢 | | | | ∇ 𝑢 + 𝜆 𝑢 − 𝑢 0 = 0 , ( 3 . 2 ) and the steepest descent marching gives 𝜕 𝑢 𝜕 𝑡 = ∇ ⋅ ∇ 𝑢 | | | | ∇ 𝑢 − 𝜆 𝑢 − 𝑢 0 . ( 3 . 3 )

To avoid singularities in flat regions or at local extreme, | ∇ 𝑢 | in (3.2) is regularized to | ∇ 𝑢 | 𝜀 = √ | ∇ 𝑢 | 2 + 𝜀 2 for a small positive parameter 𝜀 . Chan et al. [30] deduce discrete iterative equation of TV model as follows: 𝑢 𝛼 𝑛 + 1 = 𝛽 ∈ 𝑁 ( 𝛼 ) ℎ 𝛼 𝛽 𝑢 𝑛 𝛽 + ℎ 𝛼 𝛼 𝑢 0 𝛼 , ( 3 . 4 ) where 𝑢 0 𝛼 denotes the pixel value at node 𝛼 in the noisy image, 𝑛 denotes iteration times, 𝑢 𝑛 𝛼 denotes the image pixel value after 𝑛 + 1 iterations, 𝑁 ( 𝛼 ) denotes field of node 𝛼 (see Figure 2). The filter coefficients ℎ 𝛼 𝛼 and ℎ 𝛼 𝛽 are given by ℎ 𝛼 𝛼 = 𝜆 ∑ 𝜆 + 𝛽 ∈ 𝑁 ( 𝛼 ) 𝑤 𝛼 𝛽 , ℎ 𝛼 𝛽 = 𝑤 𝛼 𝛽 ∑ 𝜆 + 𝛽 ∈ 𝑁 ( 𝛼 ) 𝑤 𝛼 𝛽 , 𝑤 ( 3 . 5 ) 𝛼 𝛽 = 𝑔 𝑛 𝛼 + 𝑔 𝑛 𝛽 2 ℎ 2 , 𝑔 𝑛 𝛼 = 1 | | ∇ 𝑢 𝑛 𝛼 | | , | | ( 3 . 6 ) ∇ 𝑢 𝑛 𝛼 | | ≈ 1 2 ℎ 2 𝛽 ∈ 𝑁 ( 𝛼 ) 𝑢 𝑛 𝛽 − 𝑢 𝑛 𝛼 2 . ( 3 . 7 )

242043.fig.002
Figure 2: Four neighboring image structure.

Here, for any node 𝛼 ℎ 𝛼 𝛼 + ∑ 𝛽 ∈ 𝑁 ( 𝛼 ) ℎ 𝛼 𝛽 = 1 .

In conclusion, TV denoising algorithm steps can be summarized as follows:(1)to assign parameter 𝜆 and 𝑎 ;(2)compute the local variation | ∇ 𝑢 𝑛 𝛼 | by (3.7);(3)compute respectively 𝑔 𝑛 𝛼 and 𝑤 𝑛 𝛼 𝛽 (3.6);(4)compute the filter coefficients ℎ 𝛼 𝛼 and ℎ 𝛼 𝛽 by (3.5);(5)calculate iterative equation (3.4).

For TV filtering process, the computational cost can be reduced by the algorithm. TVM not only can remove noise but also can keep the image edge information. Some experimental results are shown in Figure 3. TVM is better than the traditional denoising methods not only in PSNR values but also in visual quality.

fig3
Figure 3: Detail of restoring noisy Elaine image (512 × 512) with different filters. (a) Original image; (b) noisy image, PSNR = 20.0742; (c) median, PSNR = 26.4554; (d) averaging, PSNR = 27.6876; (e) wiener, PSNR = 26.7866; (f) TVM, PSNR = 30.0919.

4. A New Fourth-Order PDE Denoising Model

In order to avoid the blocky effects (seen in Figure 3(f) and Figure 4(f)) widely seen in images processed by anisotropic diffusion while preserve edges, You and Kaveh [24] proposed a fourth-order PDE for noise removal. Motivated by [24] and TVM, we proposed a novel model in [25, 26]. The new approach combines the advantages of the famous TVM and original fourth-order PDE model. It can avoid the blocky effects and get high fidelity (improve the quality of the processed image), which is important for image filter application (see Figure 4).

fig4
Figure 4: Detail of the denoising medical image with different methods. (a) A slice of an MRI brain image; (b) image with Gaussian white noise of mean 0 and variance 0.01, P S N R = 2 1 . 0 9 8 0 ; (c) denoised with median filter (template: 3 × 3), P S N R = 2 7 . 3 7 7 4 ; (d) denoised with averaging filter (template: 3 × 3), P S N R = 2 7 . 7 7 0 1 ; (e) denoised with Wiener filter (template: 5 × 5), P S N R = 2 7 . 8 0 6 1 ; (f) denoised with TVM ( 𝜆 = 0 . 0 1 , 10 iterations), P S N R = 2 4 . 9 2 0 0 ; (g) results with the original fourth-order PDE model, P S N R = 2 7 . 6 7 3 0 ; (h) denoised (g) with Median filter, P S N R = 2 7 . 7 7 4 3 ; (i) results with the new fourth-order PDE model, P S N R = 2 6 . 9 9 0 2 ; (j) denoised (i) with median filter, P S N R = 2 8 . 4 7 4 6 .

Consider the energy function as follows: 𝐸 ( 𝑢 ) = Ω 𝑓 | | ∇ 2 𝑢 | | + 𝜆 2 | | 𝑢 − 𝑢 0 | | 2 𝑑 𝑥 𝑑 𝑦 , ( 4 . 1 ) where Ω is the image domain and 𝜆 > 0 is a parameter similar as in TVM. 𝑢 0 is the noisy image. ∇ 2 denotes Laplacian operator and we require 𝑓 is an increasing function and bigger than zero. Therefore, the minimization of the functional is equivalent to smoothing the image as measured by | ∇ 2 𝑢 | .

The corresponding Euler-Lagrange equation is ∇ 2 𝑓 | | ∇ 2 𝑢 | | ∇ s i g n 2 𝑢 + 𝜆 ⋅ 𝑢 − 𝑢 0 = 0 , ( 4 . 2 ) where s i g n is the signed distance function, so (4.2) can be written as ∇ 2 𝑓 | | ∇ 2 𝑢 | | ∇ 2 𝑢 | | ∇ 2 𝑢 | | + 𝜆 ⋅ 𝑢 − 𝑢 0 = 0 . ( 4 . 3 )

If we define 𝑐 ( 𝑠 ) = 𝑓 ( 𝑠 ) / 𝑠 , which is ∇ 2 𝑐 | | ∇ 2 𝑢 | | ∇ 2 𝑢 + 𝜆 ⋅ 𝑢 − 𝑢 0 = 0 , ( 4 . 4 ) therefore, the Euler equation may be solved through the following gradient descent procedure: 𝜕 𝑢 𝜕 𝑡 = − ∇ 2 𝑐 | | ∇ 2 𝑢 | | ∇ 2 𝑢 − 𝜆 ⋅ 𝑢 − 𝑢 0 . ( 4 . 5 ) So we can discretize and iterate to solve the equation.

To solve the model in (4.5) efficiently and reliably, we propose a simple symmetric difference algorithm based on four neighboring systems (seen in Figure 2).

We calculate Laplacian of the image intensity function as ∇ 2 𝑢 ∣ 𝑖 , 𝑗 = 𝑢 𝑖 + 1 , 𝑗 + 𝑢 𝑖 − 1 , 𝑗 + 𝑢 𝑖 , 𝑗 + 1 + 𝑢 𝑖 , 𝑗 − 1 − 4 𝑢 𝑖 , 𝑗 ℎ 2 , ( 4 . 6 ) where ℎ is space grid size. Given a time step Δ 𝑡 , (4.5) can be discretized as 𝑢 𝑛 + 1 = 𝑢 𝑛 ∇ − Δ 𝑡 2 𝑐 | | ∇ 2 𝑢 𝑛 | | ∇ 2 𝑢 𝑛 𝑢 + 𝜆 𝑛 − 𝑢 0 . ( 4 . 7 )

Similar as [24], we define 1 𝑐 ( 𝑠 ) = 1 + ( 𝑠 / 𝑘 ) 2 , ( 4 . 8 ) where 𝑘 is a parameter.

So the symmetric fourth-order PDE denoising algorithm is as follows.

Step 1. Initialization: select the constants 𝜆 , 𝑘 , ℎ , Δ 𝑡 and choose an initial function (image) 𝑢 .

Step 2. Compute ∇ 2 𝑢 and | ∇ 2 𝑢 | using (4.6).

Step 3. Compute 𝑐 ( | ∇ 2 𝑢 𝑛 | ) using (4.8).

Step 4. Update 𝑢 using (4.7).

Step 5. Repeat Steps 2 and 4 until convergence.

Figure 4 shows the results for a medical image with Gaussian white noise of mean 0 and variance 0.01. Median filter is applied to alleviating the speckle effects in the processed image. We can see from Figure 4 that the new fourth-order PDE method obtains the biggest PSNR values in all filter method and can avoid the block effect in Figure 4(f). At the same time, the last result of the new method (Figure 4(j), P S N R = 2 8 . 4 7 4 6  dB) is better than the original fourth-order PDE method (Figure 4(b), P S N R = 2 7 . 7 7 4 3  dB) not only in PSNR values but also in visual quality.

5. Multiplicative Noise Removal Algorithm Based on Fourth-Order PDE Model

Objective of most traditional algorithms is to deal with additive noise, but the result is not ideal for the big multiplicative noise. This paper proposes a new multiplicative noise removal algorithm and combines the denoising algorithm with image frequency domain. The whole process is as follows.

Firstly, remove the additive noise 𝑛 in model (2.1) by denoising algorithm, then the model is simplified as 𝑢 0 ( 𝑥 , 𝑦 ) = ℎ 𝑑 ( 𝑥 , 𝑦 ) ∗ 𝑓 ( 𝑥 , 𝑦 ) . ( 5 . 1 )

Secondly, convolution in (5.1) changes to product according to fast Fourier transform (FFT): 𝑈 ( 𝑢 , 𝑣 ) = 𝐻 𝑑 ( 𝑢 , 𝑣 ) ⋅ 𝐹 ( 𝑢 , 𝑣 ) , ( 5 . 2 ) where 𝑈 ( 𝑢 , 𝑣 ) , 𝐻 𝑑 ( 𝑢 , 𝑣 ) , and 𝐹 ( 𝑢 , 𝑣 ) denote FFT of 𝑢 0 ( 𝑥 , 𝑦 ) ,   ℎ 𝑑 ( 𝑥 , 𝑦 ) , and 𝑓 ( 𝑥 , 𝑦 ) , respectively.

Thirdly, (5.2) can be rewritten by logarithmic transformation (LN) as follows: l n 𝑈 ( 𝑢 , 𝑣 ) = l n 𝐹 ( 𝑢 , 𝑣 ) + l n 𝐻 𝑑 ( 𝑢 , 𝑣 ) . ( 5 . 3 )

Fourthly, l n 𝐻 𝑑 ( 𝑢 , 𝑣 ) in (5.3) can be regarded as additive noise in image frequency domain, and we can remove it by some additive denoising algorithms, such as TVM and fourth-order PDE model. Therefore, l n 𝑈 ( 𝑢 , 𝑣 ) = l n 𝐹 ( 𝑢 , 𝑣 ) . ( 5 . 4 )

Fifthly, by exponential transform (EXP), (5.4) is rewritten as 𝑈 ( 𝑢 , 𝑣 ) = 𝐹 ( 𝑢 , 𝑣 ) . ( 5 . 5 )

Sixthly, by inverse fast Fourier transform for (5.5), we can get 𝑢 = 𝑓 , ( 5 . 6 ) where 𝑢 in (5.6) is considered as the denoised image got by our algorithm. There are two denoising processes in the multiplicative noise removal framework, that is, the first step and the fourth step, if we select the denoising methods all as TVM removal framework of all as TVM, structure of multiplicative noise removal algorithm can be seen below.

In Figure 5, multiplicative noise removal algorithm considers the natural image noise as two parts, convolution changes to product by Fourier transform and product changes to summation by logarithm, then noise can be removal according to total variation model and the image is rebuilt.

242043.fig.005
Figure 5: Structure of multiplicative noise removal algorithm based on the total variational model.

6. Experimental Results

We use MATLAB 7.10 (R2010a) as the tool to carry out all algorithms a PC equipped with an Intel Core i3-2330 M CPU at 2.20 GHz and 4G RAM memory and Windows 7 operating system. Denoising performance is evaluated using the PSNR (peak signal-to-noise ratio) in dB which defined by P S N R = 1 0 ⋅ l o g 1 0 𝑅 2 𝑀 ⋅ 𝑁 [ ] 𝑓 ( 𝑥 , 𝑦 ) − 𝑢 ( 𝑥 , 𝑦 ) 2 , ( 6 . 1 ) where 𝑢 ( 𝑥 , 𝑦 ) denotes the restored image with respect to the original image 𝑓 ( 𝑥 , 𝑦 ) , 𝑅 = 2 5 5 , and 𝑀 and 𝑁 are the wide and high of image.

The effectiveness of the new multiplicative noise removal algorithm is based on the total variation model (MNRATV) shown in Table 1, Figures 6 and 7. The sizes of the noisy “Lena” and “vegetables” images is all 5 1 2 × 5 1 2 . The numerical results are listed in Table 1 and compared in Figure 6. Visual quality is shown in Figure 7. Experimental results show that the new method is available. It is better than the traditional denoising algorithm not only in PSNR values but also in visual quality.

tab1
Table 1: PSNR values obtained with difference filters (template 3 × 3).
fig6
Figure 6: PSNR values in Table 1 plotted together. (a) Lena image; (b) vegetables image.
fig7
Figure 7: Results of difference noise removal algorithms for noisy “Lena” and “vegetables” images. (a) The multiplicative noisy image; (b) results of Median filter algorithm; (c) results of Averaging filter algorithm; (d) results of TVM; (e) results of MNRATV.

We can see from Table 1 and Figure 6 that the PSNR values of the restored images by MNRATV are higher than restored images by all the other methods. It is little bigger than those by TVM when the noise level is lower. The results of MNRATV and TVM are shown in Figure 8.

fig8
Figure 8: Results of MNRATV and TVM. Column 1 is the multiplicative noise with variance 0.05, 0.10, 0.15, and 0.20; respectively, Column 2 is the corresponding results with TVM, and Column 3 is the corresponding results with MNRATV.

There are two denoising methods in the first step and fourth step of the multiplicative noise removal framework; we can call it denoising method 1 and denoising method 2. If they are all chosen as TVM, then the whole framework in Figure 5 is called MNRA1 method, which is called MNRATV before. TVM and fourth-order PDE (FPDE) model which we introduced in Section 4 constitutes four methods. Details are shown in Table 2.

tab2
Table 2: Different multiplicative noise removal method constructed with exist model.

Different methods are employed to remove the noisy Lena image with different variance. PSNR values are shown in Table 3. Seen from Table 3, TVM or FPDE directly is not good because of the multiplicative noise type. Median filter cannot be exploited as denoising method 2 since complex number is generated by the Fourier transform. Denoising method 1 is selected as FPDE in MNRA2, and it gets better results.

tab3
Table 3: PSNR values obtained with difference algorithm for Lena image.

7. Conclusion

PDE models have been widely applied in image processing community especially in image denoising. However, traditional PDE-based methods have some drawbacks unless the governing equations are both incorporating appropriate parameters and discretized by suitable numerical schemes. In this paper, a new fourth-order PDE model is introduced by improving the original fourth-order one [24] in order to avoid the blocky effect. To solve the model efficiently and reliably, we suggest a symmetrically difference schemes. Median filtering is exploited to alleviate the speckle effects in the processed image in succession. Accordingly, a new multiplicative noise removal algorithm based on the proposed fourth-order PDE model is presented. To remove the multiplicative noise, the convolution is changed into a product by applying the Fourier transform. Furthermore, the multiplicative noise is converted into the additive one by using a logarithmic transformation. Then the noise can be removed by applying the proposed PDE model. Experimental results have shown the effectiveness of the proposal.

Acknowledgments

This paper is partially supported by NSFC (61070087, 61105130), the Natural Science Foundation of Guangdong Province (S2011040000433, S2011040004017), the Science & Technology Planning Project of Shenzhen City (JC200903130300A, JYC200903250175A), and the Opening Project of Guangdong Province Key Laboratory of Computational Science of Sun Yat-Sen University (201106002) and Teaching Reform and Research Project for Young Teachers of Shenzhen University (JG2010118). The authors would like to thank the Key Laboratory of Medical Image Processing in Southern Medical University for providing original medical images.

References

  1. Q. Y. Ruan and Y. Z. Ruan, Digital Image Processing, Publishing House of Electronics Industry, Beijing, China, 2nd edition, 2004.
  2. Q. H. Chang and T. Yang, “A lattice Boltzmann method for image denoising,” IEEE Transactions on Image Processing, vol. 18, no. 12, pp. 2797–2802, 2009. View at Publisher · View at Google Scholar
  3. C. Chaux, L. Duval, A. Benazza-Benyahia, and J.-C. Pesquet, “A nonlinear Stein-based estimator for multichannel image denoising,” IEEE Transactions on Signal Processing, vol. 56, no. 8, part 2, pp. 3855–3870, 2008. View at Publisher · View at Google Scholar
  4. P. Perona and J. Malik, “Scale-space and edge detection using anisotropic diffusion,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 629–639, 1990.
  5. S. Osher and J. A. Sethian, “Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations,” Journal of Computational Physics, vol. 79, no. 1, pp. 12–49, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. S. Osher and C. W. Shu, “High-order essentially nonoscillatory schemes for Hamilton-Jacobi equations,” SIAM Journal on Numerical Analysis, vol. 28, no. 4, pp. 907–922, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. B. Chen, Y. Li, and J.-L. Cai, “Noisy image segmentation based on nonlinear diffusion equation model,” Applied Mathematical Modelling, vol. 36, no. 3, pp. 1197–1208, 2012.
  8. Z. Liao, S. Hu, and W. Chen, “Determining neighborhoods of image pixels automatically for adaptive image denoising using nonlinear time series analysis,” Mathematical Problems in Engineering, vol. 2010, Article ID 914564, 14 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. S. Hu, Z. Liao, D. Sun, and W. Chen, “A numerical method for preserving curve edges in nonlinear anisotropic smoothing,” Mathematical Problems in Engineering, vol. 2011, Article ID 186507, 14 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. M. Li, “Fractal time series—a tutorial review,” Mathematical Problems in Engineering, vol. 2010, Article ID 157264, 26 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. Z. Shang, L. Zhang, S. Ma, B. Fang, and T. Zhang, “Incomplete time series prediction using max-margin classification of data with absent features,” Mathematical Problems in Engineering, vol. 2010, 14 pages, 2010.
  12. M. Freiberger, H. Egger, and H. Scharfetter, “Nonlinear inversion schemes for fluorescence optical tomography,” IEEE Transactions on Biomedical Engineering, vol. 57, no. 11, pp. 2723–2729, 2010.
  13. Z. Liao, S. Hu, D. Sun, and W. Chen, “Enclosed Laplacian operator of nonlinear anisotropic diffusion to preserve singularities and delete isolated points in image smoothing,” Mathematical Problems in Engineering, vol. 2011, Article ID 749456, 15 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. M. Li and W. Zhao, “Visiting power laws in cyber-physical networking systems,” Mathematical Problems in Engineering, vol. 2012, Article ID 302786, 13 pages, 2012. View at Publisher · View at Google Scholar
  15. M. Li, C. Cattani, and S. Chen, “Viewing sea level by a one-dimensional random function with long memory,” Mathematical Problems in Engineering, vol. 2011, Article ID 654284, 13 pages, 2011. View at Publisher · View at Google Scholar
  16. F. Zhang, Y. M. Yoo, L. M. Koh, and Y. Kim, “Nonlinear diffusion in laplacian pyramid domain for ultrasonic speckle reduction,” IEEE Transactions on Medical Imaging, vol. 26, no. 2, pp. 200–211, 2007.
  17. M. Ceccarelli, V. De Simone, and A. Murli, “Well-posed anisotropic diffusion for image denoising,” IEE Proceedings: Vision, Image and Signal Processing, vol. 149, no. 4, pp. 244–252, 2002.
  18. M. Li, M. Scalia, and C. Toma, “Nonlinear time series: computations and applications,” Mathematical Problems in Engineering, vol. 2010, Article ID 101523, 5 pages, 2010.
  19. L. X. Shen, M. Papadakis, I. A. Kakadiaris, et al., “Image denoising using a tight frame,” IEEE Transaction on Image Processing, vol. 15, no. 5, pp. 1254–1263, 2006.
  20. B. Chen and W.-S. Chen, “Noisy image segmentation based on wavelet transform and active contour model,” Applicable Analysis, vol. 90, no. 8, pp. 1243–1255, 2011. View at Publisher · View at Google Scholar
  21. T. Celik and K. Ma, “multitemporal image change detection using undecimated discrete wavelet transform and active contours,” IEEE Transactions on Geoscience and Remote Sensing, vol. 49, no. 2, pp. 706–716, 2011.
  22. T. Celik and K. Ma, “Unsupervised change detection for satellite images using dual-tree complex wavelet transform,” IEEE Transactions on Geoscience and Remote Sensing, vol. 48, no. 3, pp. 1199–1210, 2010.
  23. S. Kim, “PDE-based image restoration: a hybrid model and color image denoising,” IEEE Transaction on Image Processing, vol. 15, no. 5, pp. 1163–1170, 2006.
  24. Y.-L. You and M. Kaveh, “Fourth-order partial differential equations for noise removal,” IEEE Transactions on Image Processing, vol. 9, no. 10, pp. 1723–1730, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  25. B. Chen, W.-S. Chen, L.-W. Zhang, et al., “Image restoration based on fourth-order PDE model,” in Proceedings of the IEEE International Conference on Natural Computation, vol. 5, pp. 549–554, Jinan, China, 2008.
  26. B. Chen, P.-C. Yuen, J.-H. Lai, and W.-S. Chen, “Image segmentation and selective smoothing based on variational framework,” Journal of Signal Processing Systems, vol. 54, pp. 145–158, 2009.
  27. L. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removel algorithms,” Physica D, vol. 60, pp. 259–268, 1992.
  28. S. D. Babacan, R. Molina, and A. Katsaggelos, “Variational bayesian blind deconvolution using a total variation prior,” IEEE Transactions on Image Processing, vol. 18, no. 1, pp. 12–26, 2009.
  29. L. Rudin and S. Osher, “Total variation based image restoration with free local constraints,” in Proceedings of the 1st IEEE International Conference on Image Processing, vol. 1, pp. 31–35, 1994.
  30. T. F. Chan, S. Osher, and J. H. Shen, “The digital TV filter and Nonlinear Denoising,” IEEE Transaction on Image Processing, vol. 10, no. 2, pp. 231–241, 2001.
  31. A. Beck and M. Teboulle, “Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems,” IEEE Transactions on Image Processing, vol. 18, no. 11, pp. 2419–2434, 2009. View at Publisher · View at Google Scholar
  32. C. Drapaca, “A nonlinear total variation-based denoising method with two regularization parameters,” IEEE Transactions on Biomedical Engineering, vol. 56, no. 3, pp. 582–586, 2009.
  33. M. Kumar and S. Dass, “A total variation-based algorithm for pixel-level image fusion,” IEEE Transactions on Image Processing, vol. 18, no. 9, pp. 2137–2143, 2009. View at Publisher · View at Google Scholar
  34. P. Rodríguez and B. Wohlberg, “Efficient minimization method for a generalized total variation functional,” IEEE Transactions on Image Processing, vol. 18, no. 2, pp. 322–332, 2009. View at Publisher · View at Google Scholar
  35. T. Zeng and M. Ng, “On the total variation dictionary model,” IEEE Transactions on Image Processing, vol. 19, no. 3, pp. 821–825, 2010. View at Publisher · View at Google Scholar
  36. B. C. Vemuri, M. Liu, S. Amari, et al., “Total bregman divergence and its applications to DTI analysis,” IEEE Transactions on Medical Imaging, vol. 30, no. 2, pp. 475–483, 2011.
  37. S. Ramani, P. Thevenaz, and M. Unser, “Regularized interpolation for noisy images,” IEEE Transactions on Medical Imaging, vol. 29, no. 2, pp. 543–558, 2010.
  38. J. Yao, J. Chen, and C. Chow, “Breast tumor analysis in dynamic contrast enhanced MRI using texture features and wavelet transform,” IEEE Journal of Selected Topics in Signal Processing, vol. 3, no. 1, pp. 94–100, 2009.
  39. M. Zibetti and A. R. De Pierro, “A new distortion model for strong inhomogeneity problems in Echo-Planar MRI,” IEEE Transactions on Medical Imaging, vol. 28, no. 11, pp. 1736–1753, 2009.
  40. J. M. Bioucas-Dias and M. A. T. Figueiredo, “Multiplicative noise removal using variable splitting and constrained optimization,” IEEE Transactions on Image Processing, vol. 19, no. 7, pp. 1720–1730, 2010. View at Publisher · View at Google Scholar
  41. L. Rudin, P. Lions, and S. Osher, “Multiplicative denoising and deblurring: theory and algorithms,” in Geometric Level Set Methods in Imaging, Vision, and Graphics, S. Osher and N. Paragios, Eds., pp. 103–120, Springer, New York, NY, USA, 2003.
  42. J. Goodman, “Some fundamental properties of speckle,” Journal of the Optical Society of America, vol. 66, pp. 1145–1150, 1976.
  43. Y. Yu and S. T. Acton, “Speckle reducing anisotropic diffusion,” IEEE Transactions on Image Processing, vol. 11, no. 11, pp. 1260–1270, 2002. View at Publisher · View at Google Scholar
  44. K. Krissian, C.-F. Westin, R. Kikinis, and K. G. Vosburgh, “Oriented speckle reducing anisotropic diffusion,” IEEE Transactions on Image Processing, vol. 16, no. 5, pp. 1412–1424, 2007. View at Publisher · View at Google Scholar