A splitting algorithm for a novel regularization of Perona-Malik and application to image restoration

Abstract

In this paper, we focus on a numerical method of a problem called the Perona-Malik inequality which we use for image denoising. This model is obtained as the limit of the Perona-Malik model and the p-Laplacian operator with p→∞. In Atlas et al., (Nonlinear Anal. Real World Appl 18:57–68, 2014), the authors have proved the existence and uniqueness of the solution of the proposed model. However, in their work, they used the explicit numerical scheme for approximated problem which is strongly dependent to the parameter p. To overcome this, we use in this work an efficient algorithm which is a combination of the classical additive operator splitting and a nonlinear relaxation algorithm. At last, we have presented the experimental results in image filtering show, which demonstrate the efficiency and effectiveness of our algorithm and finally, we have compared it with the previous scheme presented in Atlas et al., (Nonlinear Anal. Real World Appl 18:57–68, 2014).

1 Introduction

Image denoising is one of the fundamental challenges in the field of image processing and computer vision. The aim is to remove noise while preserving edges, boundaries, and textures. To handle this problem, partial differential equations [1–7], variational models [8–11], energy minimization, bilateral filtering [12, 13], and wavelet thresholding [14, 15] have been proposed depending on the domain of applications. Generally, the partial differential equations use a nonlinear anisotropic diffusion to restore a degraded image which they seek to improve its quality by removing noise while preserving details and even enhancing edges.

In 1990, Perona-Malik [2] proposed a nonlinear diffusion equation that succeeded in image denoising. Although, this model is an ill-posed problem in analytical point of view, besides, the numerical simulations produce the staircase effect. This paradoxical result has been named as the Perona-Malik Paradox [16]. Motivated by the ill-posedness of the Perona-Malik model, many works (see for instance [17–19]) suggest to introducing the regularization in space and/or time. Using the spatial convolution inside the anisotropic diffusion and replacing the diffusivity by a slight variation, new modified models have been proposed, but they produce an undesirable blurring effect. Otherwise, some new class of backward-forward regularizations has been introduced. In [20], the authors combine the Perona-Malik with a Laplacian operator and develop a new effective model, and they make a generalization of their results by replacing the Laplacian with a nonlinear p-Laplacian operator for p∈(1,2] (cf. [21]). Recently, in [22], the authors proposed a new regularization based on the previous interpolation of Perona-Malik and p-Laplacian with large value of p. Their model is well posed, it reduces the staircase effect and avoids creating new features in the image, they have also done a study of the limiting problem. For a numerical purpose, the authors used an explicit finite difference scheme which is unstable and the condition of stability depends on the parameter p.

In this paper, we develop a numerical semi-implicit method approaching the Perona-Malik inequality by using a splitting method [23]. The idea is to decompose the limit problem into two operators:

• The Perona-Malik operator which will be treated by the additive operator schemes [24].

• The second is called the sub-differential flow, where we use the Euler implicit discretization as well as we develop a dual formulation associated to the minimization problem [25].

The rest of this paper is organized as follows. In the next Section 2, we provide reviews of some previous works that are Perona-Malik model, p-Laplacian equation and their interpolation. In Section 3, we present a new numerical scheme using an operator splitting algorithm that splits the Perona-Malik inequality in two sub-models treated by additive operator schemes and dual formulation, respectively. Finally, some numerical simulations are given to demonstrate the effectiveness of the proposed algorithm.

2 Reviews of some previous works

In this section, we recall some previous models. Let T>0 be a fixed time, f the intensity of the noisy image, u the desired clean image that was corrupted with the noise n such that f = u + n, and let Ω be a bounded picture domain with smooth boundary Γ.

2.1 Perona-Malik model

The Perona-Malik model is a powerful model and widely used in image denoising. Hence, the idea behind this model is to improve the results obtained by the PDE heat and to change the equation by introducing the edge detection process (the diffusivity coefficient). Perona-Malik problem is obtained by solving the following anisotropic diffusion equation with a Neumann boundary condition:

$$\left\{ \begin{array}{ll} u_{t} - \:\text{div} \left(g\:(|\nabla u|) \nabla u\right)=0 \quad & \text{in}\,\,Q:=(0,T)\times \Omega, \\ \nabla u.\vec n=0 & \text{in}\,\,\Sigma:=(0,T)\times \Gamma, \\ u(x,0)=f & \text{in}\,\, \Omega. \end{array} \right. $$

The diffusion function g is an edge indicator function that controls the diffusion process by reducing the effect of diffusion near edges and behaves locally as the heat equation. Typical choices of g are:

$$g(t)=\frac{1}{1+\left(\frac{t}{\lambda}\right)^{2}} \qquad \text{or}\qquad g(t)=\exp\left(-\frac{t^{2}}{2\:\lambda^{2}}\right), $$

where λ>1 is a threshold parameter that determines the size of the gradients which will be preserved and g is a decreasing function worth λ where |∇u| is close to 0 and tend to 0 for large |∇u|. Note that if g(.)≡1, we recover the heat equation. For the diffusivity function g, it follows the flux function Φ(t)=tg(t) which satisfies Φ ^′(t)≥0 for |t|≤λ and Φ ^′(t)≥0 for |t|≤λ.

We observe from the Fig. 1 b that the Perona–Malik model is a forward parabolic type for |t|≥λ and a backward parabolic type for |t|≤λ. This model is an ill-posed problem from the mathematical point of view and produces an unwanted phenomena well known by staircase effect.

Fig. 1

a Left: diffusivity g(t). b Right: flux function Φ(t)

2.2 The p-Laplacian equation

To obtain the p-Laplacian equation, we merely replace the diffusion function g of the Perona–Malik equation by g(t)=t ^p−2. The p-Laplacian equation has been proposed and studied by many authors (see for instance [26]). It plays an important role in the modeling of many phenomena in different areas such as image processing [27], sandpile [28, 29], and fluid mechanic [30]. The evolutionary p-Laplacian equation can be written as:

$$ \qquad \qquad \left\{ \begin{array}{ll} u_{t} - \text{div} \left(\: |\nabla u|^{p-2} \nabla u\right)=0 \quad &\text{in}\,\,Q, \\ \nabla u.\vec n=0 & \text{in}\,\,\Sigma, \\ u(x,0)=f & \text{in}\,\, \Omega. \end{array} \right. $$

We recall that the case p = 2, the model corresponds to a well-known heat equation. For p = 1, the equation is called total variation and for a large p, the model is known as the infinite Laplacian.

2.3 Perona-Malik and p-Laplacian model

The staircasing phenomena is a manifestation of the forward-backward nature of the Perona-malik equation which appears in its discretization. In order to escape the backward regime, a novel kind of regularization [20–22] of the classical Perona-Malik model is proposed for image processing. This regularization still allows gradient growth while controls its maximal size which is done by combining two classical models, Perona-Malik and p-Laplacian.

Indeed, the following regularization reduces the size of the backward region and the solutions can flee the backward region simply by developing small and large gradients:

$$ \left\{ \begin{array}{ll} u_{t} - \:\text{div} \left(g\:(|\nabla u|) \nabla u\right) - \frac{1}{\lambda^{p}}\text{div} \left(\: |\nabla u|^{p-2} \nabla u\right)=0 \quad &\text{in}\,\,Q, \\ \nabla u.\vec n =0 & \text{in}\,\, \Sigma, \\ u(x,0)=f & \text{in}\,\, \Omega. \end{array} \right. $$

(1)

This problem is well posed for a large p, and the existence and uniqueness of the asymptotic behavior as p→∞ are established in [22]. Letting p→∞, the problem (1) converges to the following model:

$$\begin{array}{@{}rcl@{}} \left\{ \begin{array}{ll} u_{t} - \text{div} \left(g\:(|\nabla u|) \nabla u\right) +\partial I_{K}(u) \ni 0 \quad & \text{in}\,\,Q \\ \nabla u.\vec n =0 & \text{in}\,\, \Sigma,\\ u(x,0)=f & \text{in}\,\, \Omega, \end{array}\right. \end{array} $$

(2)

where

$$K=\left\{ \phi \in W^{1,r}(\Omega) \: :\: |\:\nabla \phi \:| \leq \lambda \: \text{a.e. in} \Omega \right\},$$

and I _K (.) denotes the indicator functional of the set K, for all u∈W ^1,r(Ω) I _K is defined by:

$$I_{K}(u)=\left\{ \begin{array}{ll} 0 & \text{if} \quad u \in K, \\ +\infty & \text{if} \quad u \notin K.\\ \end{array}\right. $$

Thanks to Remark 3.2 of [22], for p>λ ²+1, the problem (1) has a unique weak solution u _p and

$$\begin{aligned} &\text{for} \ p\rightarrow\infty,\ u_{p} \rightarrow u\ \text{weakly in}\ L^{r}(0,T,W^{1,r}(\Omega)) \\ &\text{for all} \ r>1. \end{aligned} $$

Moreover, $u \in \mathcal {W} \cap \mathcal {K}^{t}$ is the unique solution of (2) in the following sense:

$$ \int_{0}^{T} \left \langle \frac{\partial u}{\partial t}, u-\phi \right\rangle dt+\int_{0}^{T} \int_{\Omega} g(|\nabla u|)\nabla u \nabla(u-\phi)\leq 0, $$

for any $\phi \in \mathcal {K}^{t} = \{\xi \in L^{r}(0,T;W^{1,r}(\Omega)):\xi (t) \in K\},$ having

$$\begin{aligned} \mathcal{W}&= \left\{ \phi \in L^{r}\left(0,T;W^{1,r}(\Omega)\right): \frac{\partial \phi}{\partial t}\right.\\ &\quad\left.\in L^{r'}\left(0,T;(W^{1,r}(\Omega))'\right) \right\}, r>1. \end{aligned} $$

For further details and another sophisticated notion of solutions, we refer to [22]. We remark that the limiting problem can be rewritten as:

$$ \left\{ \begin{array}{ll} u_{t}- \text{div} \left(g\:(|\nabla u|) \nabla u\right) -f \leq 0, \qquad |\nabla u|\leq \lambda, \\ \left(u_{t}- \text{div} \left(g\:(|\nabla u|) \nabla u\right) -f\right)(|\nabla u|-\lambda)=0, \end{array} \right. $$

which is equivalent to solving the Perona-Malik problem in the region where the norm of the gradient is less than λ.

3 An operator splitting algorithm

The operator splitting methods are very useful to derive fast algorithms. It is worthwhile to be used when the problem we want to solve has an additive structure, the main idea is to split the problem into sub-problems that are easier to solve by treating its summands separately in each iteration of the algorithm. To achieve this goal, we use of the operator splitting algorithm that splits the proposed model into two equations. The first one corresponds to solve the following Perona-Malik model:

$$\begin{array}{@{}rcl@{}} \left\{ \begin{array}{ll} u_{t}- \text{div} \left(g\:(|\nabla u|) \nabla u\right)=0 \quad &\text{in}\,\,Q, \\ \nabla u.\vec{n}=0 & \text{in}\,\,\Sigma,\\ u(x,0)=f & \text{in}\,\, \Omega. \end{array} \right. \end{array} $$

(3)

The second is a diffusion equation associated to the infinity Laplacian that is given by:

$$\begin{array}{@{}rcl@{}} \left\{ \begin{array}{ll} u_{t} + \partial I_{K}(u) \ni 0 \quad &\text{in}\,\,Q, \\ \nabla u.\vec{n}=0 & \text{in}\,\,\Sigma, \\ u(x,0)=f & \text{in}\,\, \Omega. \end{array} \right. \end{array} $$

(4)

Let N > 0 be given, τ = T/N be the time step, t ⁿ = n τ, n = 0,…,N, and let us consider u ⁿ an approximation of u(t ⁿ) for all n = 0,…,N.

The basic idea is to discretize the Eq. (2) by using an implicit scheme for linear terms and an explicit scheme for the remaining terms. The goal is to reduce the execution time required to solve the equations by splitting up the terms in such a way that the stable time step for the explicit discretization is significantly smaller than the largest stable time step for the semi-implicit one.

After discretizing (2) with a semi-implicit first order scheme, we should find u ^{n + 1} satisfying:

$$\begin{array}{@{}rcl@{}} \left\{ \begin{array}{ll} \frac{ u^{n+1}- u^{n}}{\tau} -\text{div} \left(g\:(|\nabla u^{n}|) \nabla u^{n+1}\right)+ \partial I_{K}(u^{n+1}) \ni 0,\\ \nabla u^{n+1}.\vec n=0,\\ u^{n}=f. \end{array} \right. \end{array} $$

(5)

The corresponding discretization of the time splitting scheme (3)–(4) consists on finding at each time step, $v^{n~+~\frac {1}{2}}$ satisfying:

$$\begin{array}{@{}rcl@{}} \qquad \left\{ \begin{array}{ll} \frac{ v^{n~+~\frac{1}{2}}- v^{n}}{\tau} -\text{div} \left(g\:(|\nabla v^{n}|) \nabla v^{n~+~\frac{1}{2}}\right)=0,\\ \nabla v^{n~+~\frac{1}{2}}.\vec n=0,\\ v^{n}~=~f, \end{array} \right. \end{array} $$

(6)

followed by finding w ^{n + 1} satisfying:

$$\begin{array}{@{}rcl@{}} \qquad \left\{ \begin{array}{ll} \frac{ w^{n~+~1}-w^{n~+~\frac{1}{2}} }{\tau} + \partial I_{K}(w^{n~+~1}) \ni 0 \\ \nabla w^{n~+~1}.\vec n=0\\ w^{n~+~\frac{1}{2}}~=~v^{n~+~\frac{1}{2}}. \end{array} \right. \end{array} $$

(7)

The Perona-Malik operator has been solved by different numerical methods and techniques and methods. To improve computational efficiency, we discretize (3) by (6) and we use the additive operator splitting scheme in the numerical implementation. On the other hand, the sub-differential Eq. (4), discretized by (7), is formulated as a minimization that will be solved by the dual formulation [25]. In the sequel, the two numerical methods are presented.

3.1 Perona-Malik operator

The simplest discretization of the m-dimensional Eq. (6) with reflecting boundary conditions is given by:

$$\begin{array}{@{}rcl@{}} \frac{u_{i}^{n~+~\frac{1}{2}}-u_{i}^{n}}{\tau}=\!\sum\limits_{l~=~1}^{m} \sum\limits_{j\in \mathcal{N}_{l}(i)} \frac{g_{i}^{n}~+~g_{j}^{n}}{2.h^{2} }\left(\!u_{j}^{n~+~\frac{1}{2}}-u_{i}^{n~+~\frac{1}{2}}\right), \end{array} $$

(8)

where pixel i represents some location x _i , $u_{i}^{n}$ and $g_{i}^{n}$ denote, respectively, the approximation of u(x _i ,t _n ) and g(|∇u(x _i ,t _n )|), m is the dimension size and $\mathcal {N}_{l}(i)$ consists of the two neighbors of pixel i along the l direction for all l = 1,…,m. In vector-matrix, notation (8) becomes:

$$ \frac{u^{n~+~\frac{1}{2}}-u^{n}}{\tau}=\sum\limits_{l~=~1}^{m} A_{l}(u^{n})u^{n~+~\frac{1}{2}}. $$

The system matrix A _l (u ⁿ) is defined as $A_{l}(u^{n})~=~\left [a^{l,n}_{\mathcal {I},\mathcal {J}}\right ]$, where

$$ a^{l,n}_{\mathcal{I},\mathcal{J}}=\left\{ \begin{array}{ll} - g^{n}_{\mathcal{J}\sim \mathcal{I}} &\quad [\mathcal{J}\in \mathcal{N}_{l}(\mathcal{I})],\\ \sum\limits_{{\mathcal{J} \in \mathcal{N}_{l}^{-}(\mathcal{I})} \atop {\mathcal{J} \in \mathcal{N}_{l}^{+}(\mathcal{I})}} g^{n}_{\mathcal{J}\sim \mathcal{I}} &\quad (\mathcal{J}~=~\mathcal{I}), \\ 0 &\quad \text{(otherwise).} \end{array} \right. $$

Therefore, we have:

$$\begin{array}{@{}rcl@{}} u^{n~+~\frac{1}{2}}~=~\left(I-\tau.\sum\limits_{l~=~1}^{m} A_{l}(u^{n})\right)^{-1}u^{n}. \end{array} $$

(9)

The modification applied to (9) has been introduced firstly by [24] named as additive operator splitting (AOS) scheme which leads us to:

$$\begin{array}{@{}rcl@{}} u^{n~+~\frac{1}{2}}~=~\frac{1}{m}\sum\limits_{l~=~1}^{m}(I-\tau.m.A_{l}(u^{n}))^{-1}u^{n}. \end{array} $$

(10)

3.2 The sub-differential flow

The discretization of the problem (7) can be written as:

$$\begin{array}{@{}rcl@{}} w^{n~+~1}+ \partial I_{K}(w^{n~+~1}) \ni w^{n~+~\frac{1}{2}} \ \text{for} \ n~=~0,\ldots,N. \end{array} $$

(11)

where ∂ f denotes the sub-differential of a given function f.

Thanks to [25], we focus our attention on the projection $w^{n~+~1}~=~{P}_{K}\left (w^{n~+~\frac {1}{2}}\right).$ Indeed,

$$\begin{array}{@{}rcl@{}} J\left(w^{n+1}\right)=\frac{1}{2} \left\| w^{n+1}-w^{n+\frac{1}{2}}\right\|_{L^{2}(\Omega)}^{2}={\min}_{z\in K} J(z), \end{array} $$

(12)

with $J(z)~=~\frac {1}{2}\left \|z-w^{n~+~\frac {1}{2}}\right \|_{L^{2}(\Omega)}^{2}$.

The dual formulation has been used to deal with this minimization problem. The dual problem associated with (12) is given by the following functional:

$$\begin{array}{@{}rcl@{}} G(z)=\int_{\Omega}(\text{div}(z))^{2}~+~\int_{\Omega} w^{n~+~\frac{1}{2}} \text{div}(z)~+~\lambda \int_{\Omega} |z|. \end{array} $$

(13)

In order to find the numerical solution of the functional (13), we denote by z _h a minimizer of this functional and G _h (z _h ) the approximation of G(z) (see [25] for instance):

$$\begin{array}{@{}rcl@{}} G_{h}(z_{h})&=&\int_{\Omega}(\text{div}(z_{h}))^{2}+\int_{\Omega} w_{h}^{n~+~\frac{1}{2}} \text{div}(z_{h})\\ &&+ \lambda \sum\limits_{\tau \in T_{h}} |\tau ||z_{h}(P_{\tau})|, \end{array} $$

(14)

where τ represents simplex of the partitioning of T _h , |τ| is the area of simplex τ, and P _τ is one of the vertices of τ. In image processing, |τ| could be seen as discretization step h ² = 1.

In view of the fact that G _h is nondifferentiable, we use a relaxation algorithm (see for instance [31] and the references therein) to minimize the functional (14) that can be summarized as follows:

• 1. Initiate the algorithm with vector q ⁰, set k = 0, choose a canonical direction e _j ∈R ⁿ.

• 2. Solving the one-dimensional sub-problems $\underset {t \in R }{\min } \Psi _{jk}(t)$ where Ψ _jk is defined as:

  $$\begin{array}{@{}rcl@{}} \begin{array}{ll} \Psi_{jk}:& R \rightarrow R\\ &t \rightarrow G_{h}\left(q^{k}+t e_{j}\right). \end{array} \end{array} $$

  (15)

• 3. Taking q ^{k + 1} = q ^k+ω t _jk , where ω>0 is an over-relaxation parameter.

• 4. We can use Newton algorithm to find t _jk , when Ψ _jk is differentiable. Else, it can be computed directly.

• 5. The condition to stop this algorithm is $\|q^{k}-q^{k~+~1}\|_{l^{2}({R}^{n})}\leq \varepsilon$, for a given convergence tolerance ε.

At last, in the next section, results of numerical simulations are given.

4 Numerical results and simulations

This section is devoted to extensive numerical experimentations. The program will stop when it achieves our goal. Most algorithm parameters are chosen heuristically for the algorithms to perform their best. We set, the spatial size h = 1 and the parameter ω = 1,2 of the relaxation algorithm. First, we illustrate the efficiency of our proposed numerical algorithm (cf. Figs. 2, 3, 4, and 5) for filtering the images corrupted with noise. As a second experiment, we will keep the same values of the previous parameters and we test the explicit scheme of the Perona-Malik and p-Laplacian (PMPL) proposed in [22] for different values of p Fig. 6. We remark that the PMPL scheme depends on the parameter p and for a large p, the restored image has been damaged. In order to avoid numerical instability, we must take a very small time step. So that, the needed simulation takes more time due to the nature of data. For that, in the third test, we evaluate the performance of our algorithm compared to PMPL scheme by using CPU time. The last experiment aims to show the dependence also of the PMPL scheme to the threshold parameter λ.

Fig. 2

Images corrupted by Gaussian noise with zero mean and variance σ ² = 0.025

Fig. 3

Restored images by using our method

Fig. 4

Left column, original images; middle column, noisy images corrupted by poissonian noise; right column restored images with λ = 60

Fig. 5

Left to right: noisy Barbara image, restored Barbara image by our algorithm, noisy rice image, restored rice image by our algorithm

Fig. 6

Left to right: noisy Barbara image, restored image by PMPL with p = 12.5,16.5, and 18.5, respectively

For the improvements tests, we present the restorations and the results of our algorithm by choosing the parameter λ = 20.

The restored images are clearly better than the noisy ones; to obtain an objective evaluation of the proposed method, the peak signal-to-noise ratio (PSNR) is used to measure the quality of the restoration results which is defined as:

$$ \text{PSNR}=10 \log_{10}\left(\frac{255^{2} M N}{||u_{0}-u||^{2}_{2}}\right)dB, $$

where u ₀, u, and M × N are the original image, the restored image and the size of the image, respectively. To qualify the restoration capacity of the method under consideration, the signal-to-noise ratio (SNR) is applied and denoted by:

$$ \text{SNR}=\log_{10}\left(\frac{\sigma_{u}}{\sigma_{n}}\right)dB, $$

where σ _u and σ _n are the signal and noise standard deviations, respectively. The value of these statistical measures indicates the strength of signal in restored images. Therefore, the value increases as the restored version of the image approaches the original one. In order to better evaluate the restoration process, PSNR and SNR values are shown in the Table 1.

Table 1 PSNR and SNR values for the noisy and recovered images corresponding to the experiments shown in Figs. 2 and 3

Now, we are testing our method on Barbara and Rice images corrupted by Gaussian noise with zero mean and variance σ ²=0.03 and using the same parameters (Fig. 5).

The previous tests show the efficiency of our method. To argue the usage of the proposed algorithm, we will test, in the second experiment, the PMPL model using the explicit scheme proposed in [22] by using the same parameters of the previous test. We take different values of p to study its impact on the image restoration.

Figure 6 shows that the PMPL method has restored the image, but when p becomes large, the images are damaged due to the problem of stability which depends on the value of the parameters p and λ as well as the initial data. In order to repair the image and avoid numerical instability, we increase the value of the parameter λ and decrease the time step size dt until finding a suitable value for which the image will not get damaged. In this case, the PMPL scheme becomes stable for d t = 10⁻³ and λ = 60. In Figs. 7 and 8, we will fix λ = 60 and we present the comparison between our algorithm with d t = 0.1 and the PMPL method with d t = 10⁻³ (Fig. 6).

Fig. 7

Left to right: noisy image, restored Barbara image by our method, image obtained by PMPL model with p = 20, the difference image

Fig. 8

Left to right: noisy image, restored rice image by our algorithm, image obtained by PMPL method with p = 20, the difference image

The Figs. 7 and 8 show that the two methods give similar results. But in this experiment, our algorithm has restored the images in fewer time compared to the PMPL method (Table 2).

Table 2 CPU time of our algorithm and PMPL method for the Barbara and rice images

In the last test, we keep the same parameters employed in the previous experiment and change the value of the threshold λ (Figs. 9 and 10).

Fig. 9

Top row, restored Barbara image by PMPL method; bottom row, restored images by our algorithm; first column, noisy images; two right columns, recovered with λ = 40.98 and λ = 40.97, respectively

Fig. 10

Top row, restored Rice image by PMPL method; bottom row, restored images by our algorithm; first column, noisy images; two right columns, recovered with λ=29.05 and λ=29, respectively

In this experiment, the proposed algorithm proves to be performing better than the explicit scheme where the restored images are damaged when we took a λ small and/or p large (Fig. 9). The results of this section confirm the usefulness of our method that overcomes the condition of stability; whereas, we remark that for the explicit scheme, the stability criterion is given by d t≤f(p,λ) where f is a decreasing function with respect to p and a nondecreasing with respect to λ such that

$${f(p, \lambda)} \longrightarrow 0 \; \text{as}\ p\rightarrow\infty \; \text{and}\; {f(p, \lambda)} \longrightarrow 0 \; \text{as}\ \lambda \rightarrow 0.$$

5 Conclusions

Perona and Malik proposed one of the pioneering model which represents an efficient and effective tool for image denoising. However, the numerical simulations produce a phenomenon known as the staircase effect, which causes images to look blocky. To overcome this, in [22], we have proposed a regularized model which is an interpolation of two classical models, Perona-Malik and p-Laplacian with p→∞. We have also demonstrate the efficiency and effectiveness of this model compared with the method most frequently used (see [22] for more detail). However, a major drawback for the numerical scheme is that the stability condition is strongly dependent to the parameters p, λ, and dt. For that, in this work, we develop a novel algorithm based on fractional step methods. Combining the classical additive operator splitting and a nonlinear relaxation algorithm, the numerical experiments demonstrate that the proposed algorithm is accurate and effective for images restoration. Comparing with the classical explicit schemes presented in [22] which strongly depends on the regularization methods and the model parameters, our algorithm controls the problem of stability and is significantly faster.