
The problem of interest in this paper is the mathematical and numerical analysis of a new non-variational model based on a high order non-linear PDE system resulting from image denoising. This model is motivated by involving the decomposition approach of H−1 norm suggested by Guo et al. [
Citation: Abdelmajid El Hakoume, Lekbir Afraites, Amine Laghrib. An improved coupled PDE system applied to the inverse image denoising problem[J]. Electronic Research Archive, 2022, 30(7): 2618-2642. doi: 10.3934/era.2022134
[1] | Ruini Zhao . Nanocrystalline SEM image restoration based on fractional-order TV and nuclear norm. Electronic Research Archive, 2024, 32(8): 4954-4968. doi: 10.3934/era.2024228 |
[2] | Huimin Qu, Haiyan Xie, Qianying Wang . Multi-convolutional neural network brain image denoising study based on feature distillation learning and dense residual attention. Electronic Research Archive, 2025, 33(3): 1231-1266. doi: 10.3934/era.2025055 |
[3] | Souad Ayadi, Ozgur Ege . Image restoration via Picard's and Mountain-pass Theorems. Electronic Research Archive, 2022, 30(3): 1052-1061. doi: 10.3934/era.2022055 |
[4] | John Daugherty, Nate Kaduk, Elena Morgan, Dinh-Liem Nguyen, Peyton Snidanko, Trung Truong . On fast reconstruction of periodic structures with partial scattering data. Electronic Research Archive, 2024, 32(11): 6481-6502. doi: 10.3934/era.2024303 |
[5] | Lili Zhang, Chengbo Zhai . An existence result for a new coupled system of differential inclusions involving with Hadamard fractional orders. Electronic Research Archive, 2024, 32(11): 6450-6466. doi: 10.3934/era.2024301 |
[6] | Wenya Shi, Xinpeng Yan, Zhan Huan . Faster free pseudoinverse greedy block Kaczmarz method for image recovery. Electronic Research Archive, 2024, 32(6): 3973-3988. doi: 10.3934/era.2024178 |
[7] | Messoud Efendiev, Vitali Vougalter . Linear and nonlinear non-Fredholm operators and their applications. Electronic Research Archive, 2022, 30(2): 515-534. doi: 10.3934/era.2022027 |
[8] | Haiyan Song, Fei Sun . A numerical method for parabolic complementarity problem. Electronic Research Archive, 2023, 31(2): 1048-1064. doi: 10.3934/era.2023052 |
[9] | Xiang Xu . Recent analytic development of the dynamic $ Q $-tensor theory for nematic liquid crystals. Electronic Research Archive, 2022, 30(6): 2220-2246. doi: 10.3934/era.2022113 |
[10] | Yazhuo Fan, Jianhua Song, Yizhe Lu, Xinrong Fu, Xinying Huang, Lei Yuan . DPUSegDiff: A Dual-Path U-Net Segmentation Diffusion model for medical image segmentation. Electronic Research Archive, 2025, 33(5): 2947-2971. doi: 10.3934/era.2025129 |
The problem of interest in this paper is the mathematical and numerical analysis of a new non-variational model based on a high order non-linear PDE system resulting from image denoising. This model is motivated by involving the decomposition approach of H−1 norm suggested by Guo et al. [
Currently, Image restoration is one of the outstanding challenging problems in both image processing and computer vision with numberless applications. Its goal is to remove noise from a degraded image to restore the original one. Generally, given a noisy image function defined on Ω, with Ω⊂R2 an open and bounded domain, the image denoising process can be modelled as f=u+n where f represents the observed noisy image, u is the true image, and n is the noise component. To solve this inverse problem, there are several approaches such as PDE based technique [3,4], wavelet based technique [5], stochastic approach [6], patch based technique [7].
PDE based denoising models can be classified in two categories, namely variational and non variational PDE models. In variational PDE models, the solution is obtained as the steady-state solution of an evolution equation corresponding to the Euler–Lagrange equation of the energy functional. In non-variational PDE models, the PDE is proposed directly on the diffusion equations (systems), without thinking of any energy. Whatever the used approach, one should consider a certain diffusion equation (system).
In recent years, partial differential equations (PDEs) have become one of the most effective tools for image processing. Among them, the ROF model, which was first introduced by Rudin et al. [8], is one of the most popular and given by
minuE(u)=∫Ω|∇u|+λ‖u−f‖2L2(Ω), | (1.1) |
where λ>0 is parameter regularization, ‖u−f‖2L2(Ω) is a fidelity term, and ∫Ω|∇u| is a regularization term. The corresponding PDE which the evolution of the Euler-Lagrange equation for E(u) is given by following equation
{∂u∂t=div(∇u|∇u|)+2λ(f−u)inΩ,⟨∇u,n⟩=0on∂Ω, | (1.2) |
This last model is named TV model, it has been the subject of several studies (see [9,10]) and has successfully contributed to preserve edges during the restoration process. Given the success of TV-based diffusion, various modifications have been investigated (see [11,12]). Though the TV model performs very well for image denoising and edge protecting, it may also destroy small details, such as textures (see [13]). To overcome this drawback, Meyer [14] proposed a new minimization method by introducing a weaker norm which is more appropriate to represent the oscillatory patterns and small details in the textured image. Subsequently, Osher et al. [13] proposed the following 4th order denoising model which used the H−1 norm with the TV minimization. The minimization energy has the form
minEH−1(u)=∫Ω|∇u|+λ‖u−f‖2H−1(Ω). | (1.3) |
The corresponding PDE associated to Euler-Lagrange is given by the following equation :
{∂u∂t=Δ(div(∇u|∇u|))+2λ(f−u)inΩ,⟨∇(div(∇u|∇u|)),n⟩=⟨∇u,n⟩=0on∂Ω, | (1.4) |
This model is called the TV−H−1 denoising model. This model is a highly nonlinear PDE and its numerical solution is not obvious. To solve this problem, Guo et al. [1] suggested a reaction-diffusion system applied to image restoration and image decomposition into cartoon and texture. This idea is introduced by [12] where the initial image f is decomposed into carton part u and texture or noise (f−u). The Euler-Lagrange of the functional energy (1.3) becomes
Δ−1(f−u)=12λdiv(∇u|∇u|), | (1.5) |
To overcome the difficulty of 4th order degrees in (1.5), the authors transform it into the following two coupled second order equations:
{−Δv+(f−u)=0inΩ,−div(∇u|∇u|)+2λv=0inΩ,⟨∇u,n⟩=⟨∇v,n⟩=0on∂Ω, | (1.6) |
and the evolutionary form of the steady system (1.6) is given by the following PDE system:
{∂v∂t=Δv−(f−u)inΩ×(0,T),∂u∂t=div(∇u|∇u|)−2λvinΩ×(0,T),⟨∇u,n⟩=⟨∇v,n⟩=0on∂Ω×(0,T),u(0,x)=finΩ,v(0,x)=0inΩ. | (1.7) |
Recently, Atlas et al. [15] proposed a new model based on a nonlinear fractional reaction-diffusion system. This model is based on the following minimization procedure:
minEH−s(u)=∫Ω|∇u|+λ‖u−f‖2H−s(Ω), | (1.8) |
where the norm H−s,s>0 is introduced by Giga [16]. The corresponding PDE associated of its Euler-Lagrange will be
2λ(f−u)=(−Δ)s(div(∇u|∇u|)). | (1.9) |
where H−s is negative Hilbert-Sobolev space with s∈(0,1] For the nonlinear regularization term, the authors propose an Orlicz-operator and generalize Eq (1.9), which becomes:
2λ(f−u)=(−Δ)s(div(Aμ(x)(x,|∇|)∇u|∇u|)). | (1.10) |
where the function Aμ(x):Ω×R→R is chosen to be monotonically close to 1 when t tends to infinity (for more details see [15]). To solve the problem (1.10), the authors follow the decomposition suggested in [1,2] introducing the following coupled system
{−div(Aμ(x)(x,|∇|)∇u|∇u|)+2λv=0,(−Δ)sv+(f−u)=0, | (1.11) |
furthermore, the authors consider the solution (u,v) of system (1.11) as a steady state of an evolutionary fractional reaction-diffusion system investigated in [15].
More recently, Halim et al. [17] proposed a non-variational denoising model by modifying the TV−TV2 model introduced in [18]. They proposed the following model:
∂u∂t=−αΔ(div(∇u|∇u|))+β(div(∇u|∇u|))+λ(f−u). | (1.12) |
This model called TV−L2−H−1, it contains the diffusion terms of TV−L2 and TV−H−1 model. However, it still suffers from the staircasing effect and the combination between the second and fourth-order diffusion terms leads to over-smooth homogeneous areas.
To overcome these limitations, we propose a nonlinear high order system, using the Weickert model [19], which is more efficient in reducing high noise intensity, combined with a decomposition suggested by Guo et al. [1] to control the diffusivity in smooth areas. This model corrects the disadvantages (staircasing phenomenon and over smoothing) of the diffusion term proposed in Eq (1.12). We can see that in the Figure 1, where a denoising example is carried-out using the two diffusion operators. However, since the Weickert operator is strongly nonlinear, the computation of the solution using classical numerical approximation generates some blur effect. Hence, the introduction of the decomposition procedure, which will facilitate the treatment of the nonlinear part of the Weickert operator. However this decomposition is in general ill-posed and existence of the looked for solution is not ensured. In this work, we will check the existence and uniqueness of the solution in a suitable functional space inspired by the well-known Schauder fixed point theorem.
The organization of the main paper is given as follows. In section 2, we describe the new proposed model. Section 3 is devoted to the existence and uniqueness results of the solution to the proposed equation using Schauder fixed point theorem. After, we give a brief discretization part of the proposed coupled model PDE. At last, section 4 is devoted to numerical results and comparative experiments to improve our model.
In this section, we have proposed a denoising model of non-variational type by modifying the diffusion term in Eq (1.12) to overcome its drawbacks. To take advantage of both the Perona-Malik model [20] and the Weickert model [19], we propose the new model given by the following equation:
{12λ(div(D(Jρ(∇uσ))∇u))=Δ−1(f−u)inΩ,⟨D(Jρ(∇uσ))∇u,n⟩=0on∂Ω, | (2.1) |
where D is an anisotropic diffusion tensor and Jρ is the structure tensor defined by
Jρ(∇Xσ)=Kρ∗(∇Xσ⊗∇Xσ). | (2.2) |
where ∗ is the convolution product and ⊗ is the outer product defined such as ∇Xσ⊗∇Xσ=∇Xσ(∇Xσ)t. Here Xσ is constructed using a convolution of X with a Gaussian kernel, while Kρ and Kσ represent two Gaussian convolution kernels such as Kτ(x)=12πτ2exp(−|x|22τ2). The function D is calculated using the tensor Jρ eigenvalues and the eigenvectors as follows
D:=φ+(υ+,υ−)θ+θT++φ−(υ+,υ−)θ−θT−, | (2.3) |
where υ+/− and θ+/− are respectively the eigenvalues and the eigenvectors of the tensor structure Jρ, the eigenvalues υ+/− are calculated as
υ+/−=12(trace(Jρ)±√trace2(Jρ)−4det(Jρ)). | (2.4) |
While the functions φ+ and φ− represent the isotropic or anisotropic behavior of the smoothing on the image regions. Recently, an efficient choice of these functions is introduced in [21], where the authors consider the behavior of the Weickert model according to the two directions θ+ and θ−. The proposed coefficients take into account the diffusion in the vicinity of the contours and corners where the eigenvalues υ+ and υ− are very high. This choice is proposed as follows:
{φ+(υ+,υ−)=exp(−υ+k1),φ−(υ+,υ−)=exp(−υ−k2)(1−exp(−υ+k1)), | (2.5) |
where k1 and k2 are two thresholds defining the diffusion with respect to the directions θ+ and θ−, respectively.
Equation (2.1) is a highly nonlinear PDE and therefore its numerical solution is a non-trivial task. To overcome this difficulty, we follow the decomposition suggested in [1], introducing a splitting into the coupled system:
{div(D(Jρ(∇uσ))∇u)=αvinΩ,Δv=f−uinΩ,⟨D(Jρ(∇uσ))∇u,n⟩=⟨∇v,n⟩=0on∂Ω, | (2.6) |
Moreover, the solution (u,v) of system (2.6) is a stable state of the following evolutionary reaction-diffusion system
{∂u∂t−div(D(Jρ(∇uσ))∇u)+αv=0inΩ×(0,T),∂v∂t−Δv+f−u=0inΩ×(0,T),⟨D(Jρ(∇uσ))∇u,n⟩=⟨∇v,n⟩=0on∂Ω×(0,T),u(x,0)=f,v(x,0)=0inΩ. | (2.7) |
In order to establish the existence of the solution u associated to the problem (2.7), we introduce the following set of hypotheses (H) :
H1- The tensors D in C∞(R2×2,R2×2), positive-definite matrix and coercive with the coercivity constant is β.
H2- The initial condition f in L2(Ω).
H3- The constants β, α, τ, ρ, σ, k1 and k2 are positives.
In this section, we give the variational formulation of the problem (2.7) and a priori estimations of the solution (u,v). Indeed, the variational formulation of the problem (2.7) is stated as follows
{Find(u,v)∈(L2(0,T;H1(Ω)))2and(∂u∂t,∂v∂t)∈(L2(0,T;H1(Ω)′))2suchthat{⟨∂u∂t,ϕ⟩+∫ΩD(Jρ(∇uσ))∇u∇ϕ+∫Ωαvϕ=0,⟨∂v∂t,ϕ⟩+∫Ω∇v∇ϕ+∫Ωfϕ−∫Ωuϕ=0,∀ϕ∈H1(Ω). | (3.1) |
Inspired by the techniques employed by Catté et al. [22], for a nonlinear equation, we will show the existence result for our coupled problem of two equations. The following lemma gives some a priori estimations of the solution.
Lemma 1. Assume that assumptions (H) are satisfied, then there exists a positive constant C, such that the weak solution of the problem (3.1) satisfies the following estimations
∣∣u∣∣L∞(0,T;L2(Ω))+∣∣u∣∣L2(0,T;H1(Ω))+∣∣∂tu∣∣L2(0,T;H1(Ω)′)≤C, |
∣∣v∣∣L∞(0,T;L2(Ω))+∣∣v∣∣L2(0,T;H1(Ω))+∣∣∂tv∣∣L2(0,T;H1(Ω)′)≤C, |
Proof. We take ϕ=u in the first equation of (3.1) and ϕ=v in the second, we get
{ddt∣∣u(t)∣∣2L2(Ω)+∫ΩD(Jρ(∇uσ))∇u∇u+∫Ωαvu=0,ddt∣∣v(t)∣∣2L2(Ω)+∫Ω∇v∇v+∫Ωfv−∫Ωuv=0, | (3.2) |
We integrate for t∈(0,τ] with τ∈(0,T], then we have
{12∣∣u(τ)∣∣2L2(Ω)+∫τ0∫ΩD(Jρ(∇uσ))∇u∇u+∫τ0∫Ωαvu=12∣∣u(0)∣∣2L2(Ω),12∣∣v(τ)∣∣2L2(Ω)+∫τ0∫Ω∇v∇v+∫τ0∫Ωfv−∫τ0∫Ωuv=12∣∣v(0)∣∣2L2(Ω), | (3.3) |
Multiplying the second equation of (3.3) by α and using the initial data v(0)=0 and u(0)=f, then the equation becomes
{12∣∣u(τ)∣∣2L2(Ω)+∫τ0∫ΩD(Jρ(∇uσ))∇u∇u+∫τ0∫Ωαvu=12∣∣f∣∣2L2(Ω),α2∣∣v(τ)∣∣2L2(Ω)+α∫τ0∫Ω∇v∇v+α∫τ0∫Ωfv−α∫τ0∫Ωuv=0, | (3.4) |
we add the two equations of (3.4), we get
12∣∣u(τ)∣∣2L2(Ω)+α2∣∣v(τ)∣∣2L2(Ω)+∫τ0∫ΩD(Jρ(∇uσ))∇u∇u+α∫τ0∫Ω∇v∇v+∫τ0∫Ωαfv=12∣∣f∣∣2L2(Ω), | (3.5) |
On the one hand, applying Young's inequality we have
∣∫τ0∫Ωαfv∣≤αT2∫Ωf2dx+α2∫τ0∫Ωv2dxdt, | (3.6) |
On the other hand, thanks to the coercivity of D, we see that
∫τ0∫ΩD(Jρ(∇uσ))∇u∇u≥β∫τ0∫Ω∇u∇u | (3.7) |
Using (3.7) and (3.6), Eq (3.5) becomes
12∣∣u(τ)∣∣2L2(Ω)+α2∣∣v(τ)∣∣2L2(Ω)+β∫τ0∫Ω∇u∇u+α∫τ0∫Ω∇v∇v | (3.8) |
≤αT+12∫Ωf2dx+α2∫τ0∫Ωv2dxdt, | (3.9) |
Setting K(τ)=∫Ωv(τ)2, we see that
K(τ)≤αT+1α∫Ωf2dx+∫τ0K(t). |
Using the Gronwall's inequality, we get
K(τ)≤αT+1α∣∣f∣∣2L2(Ω)exp(τ), |
which implies that
∫Ωv(τ)2≤C |
where the constant depends on T, we deduce that v is bounded in L∞(0,T;L2(Ω)). Hence
∣∣u∣∣L∞(0,T;L2(Ω))+∣∣v∣∣L∞(0,T;L2(Ω))+β∫τ0∫Ω∇u∇u+α∫τ0∫Ω∇v∇v≤C. |
By taking Eq (3.8) and by adding the term β∫τ0∫Ωu2+α∫τ0∫Ωv2 to both sides we get
12∣∣u(τ)∣∣2L2(Ω)+α2∣∣v(τ)∣∣2L2(Ω)+β(∫τ0∫Ω∇u∇u+u2)+α(∫τ0∫Ω∇v∇v+v2) |
≤αT+12∫Ωf2dx+3α2∫τ0∫Ωv2dxdt+∫τ0∫Ωu2dxdt, |
which means that:
{∣∣u∣∣L∞(0,T;L2(Ω))≤C,∣∣u∣∣L2(0,T;H1(Ω))≤C,∣∣v∣∣L∞(0,T;L2(Ω))≤C,∣∣v∣∣L2(0,T;H1(Ω))≤C. | (3.10) |
Let's prove now the estimation of ∂u∂t and ∂v∂t. For that, let's back to Eq (3.1), we have for all ϕ
{∣⟨∂u∂t,ϕ⟩∣=∣∫ΩD(Jρ(∇uσ))∇u∇ϕ−∫Ωαvϕ∣,∣⟨∂v∂t,ϕ⟩∣=∣∫Ω∇v∇ϕ−∫Ωfϕ+∫Ωuϕ∣, | (3.11) |
using hypotheses H1 and Hölder inequality we get
{∣⟨∂u∂t,ϕ⟩∣≤∣∣D(Jρ(∇uσ))∣∣L∞(Ω)∣∣∇u∣∣L2(Ω)∣∣∇ϕ∣∣L2(Ω)+α∣∣v∣∣L2(Ω)∣∣ϕ∣∣L2(Ω),∣⟨∂v∂t,ϕ⟩∣≤∣∣∇v∣∣L2(Ω)∣∣∇ϕ∣∣L2(Ω)+∣∣f∣∣L2(Ω)∣∣ϕ∣∣L2(Ω)+∣∣u∣∣L2(Ω)∣∣ϕ∣∣L2(Ω), | (3.12) |
or ∣∣∇ϕ∣∣L2(Ω)≤∣∣ϕ∣∣H1(Ω) and ∣∣ϕ∣∣L2(Ω)≤∣∣ϕ∣∣H1(Ω), then the previous equation becomes
{∣⟨∂u∂t,ϕ⟩∣≤∣∣D(Jρ(∇uσ))∣∣L∞(Ω)∣∣∇u∣∣L2(Ω)∣∣ϕ∣∣H1(Ω)+α∣∣v∣∣L2(Ω)∣∣ϕ∣∣H1(Ω),∣⟨∂v∂t,ϕ⟩∣≤∣∣∇v∣∣L2(Ω)∣∣ϕ∣∣H1(Ω)+∣∣f∣∣L2(Ω)∣∣ϕ∣∣H1(Ω)+∣∣u∣∣L2(Ω)∣∣ϕ∣∣H1(Ω), | (3.13) |
this means
{∣∣∂u∂t∣∣(H1(Ω))′≤∣∣D(Jρ(∇uσ))∣∣L∞(Ω)∣∣∇u∣∣L2(Ω)+α∣∣v∣∣L2(Ω),∣∣∂v∂t∣∣(H1(Ω))′≤∣∣∇v∣∣L2(Ω)+∣∣f∣∣L2(Ω)+∣∣u∣∣L2(Ω), | (3.14) |
integrating over t∈(0,T], we find
{∣∣∂u∂t∣∣L2(0,T;H1(Ω)′)≤∣∣D(Jρ(∇uσ))∣∣L∞(0,T;L∞(Ω))∣∣∇u∣∣L2(0,T;L2(Ω))+α∣∣v∣∣L2(0,T;L2(Ω)),∣∣∂v∂t∣∣L2(0,T;H1(Ω)′)≤∣∣∇v∣∣L2(0,T;L2(Ω))+T∣∣f∣∣L2(Ω)+∣∣u∣∣L2(0,T;L2(Ω)), | (3.15) |
and according to estimates in (11), we conclude that
{∣∣∂u∂t∣∣L2(0,T;H1(Ω)′)≤C,∣∣∂v∂t∣∣L2(0,T;H1(Ω)′)≤C. | (3.16) |
which ends the proof.
The following theorem shows the existence and uniqueness of a solution to the proposed model
Theorem 1. Let f∈L2(Ω) and T>0, under the assumptions above, the problem (2.7) admits a unique weak solution (u,v)∈C(0,T;L2(Ω))∩L2(0,T;H1(Ω)).
For the proof of existence, we use the classical Schauder fixed point theorem [23,theorem 2.A,p. 56]. To define the fixed point operator, we introduce first these spaces
V(0,T)={w∈L2(0,T;H1(Ω)),∂tw∈L2(0,T;H1(Ω)′)} |
which is a Hilbert space equipped with the norm
∣∣w∣∣V(0,T)=∣∣w∣∣L2(0,T;H1(Ω))+∣∣∂tw∣∣L2(0,T;H1(Ω)′) |
and
V0={w∈V(0,T):∣∣w∣∣L∞(0,T;L2(Ω))≤C,∣∣w∣∣L2(0,T;H1(Ω))≤C, |
∣∣∂tw∣∣L2(0,T;H1(Ω)′))≤C,andw(0)=f} |
which is a nonempty, convex and weakly compact subset of V(0,T). The estimations introduced in the functional space V0 are deduced from the precedent lemma 1.
The Schauder's fixed point operator is given as follows
L:V0→V0w↦L(w)=uw |
where uw is the solution associated to (w,v) for the following problem
{⟨∂u∂t,ϕ⟩+∫ΩD(Jρ(∇wσ))∇u∇ϕ+∫Ωαvϕ=0,⟨∂v∂t,ψ⟩+∫Ω∇v∇ψ+∫Ωfψ−∫Ωuψ=0,∀ϕ,ψ∈(H1(Ω))2,u(0)=fandv(0)=0. | (3.17) |
which is now linear in u. As a result and using the theoretical existence of parabolic equations results [24,Theorem 3,p. 356], we ensure that the problem (3.17) has a unique solution (uw,v) in V(0,T). The existence of a weak solution for the problem (3.1) is equivalent to the existence of a fixed point for the operator L. For this reason, we apply Schauder's fixed point theorem, which requires only to prove that the mapping L is weakly continuous. For that, let (wn)n∈N be a sequence in V0 such that wn⇀w in V0, and un=L(wn), we should prove that
un=L(wn)⇀uw=L(w)inV0. |
Using the compact inclusions of Sobolev spaces [25] and by estimations established in lemma 1, there exists a subsequence noted also (wn,vn)n∈N and (un,vn) such that
{∂un∂t⇀∂u∂tand∂vn∂t⇀∂v∂tinL2(0,T;H1(Ω)′)un→uandvn→vinL2(0,T;L2(Ω))∇un⇀∇uand∇vn⇀∇vin(L2(0,T;L2(Ω)))2wn→winL2(0,T;L2(Ω))D(Jρ(∇wnσ))→D(Jρ(∇wσ))inL2(0,T;L2(Ω))un(0)→u(0)inH1(Ω)′ | (3.18) |
Using these convergences and by the uniqueness of the solution of (3.17), we have
un=L(wn)⇀u=L(w)inV0. |
This proves that L is weakly continuous. Finally from the Schauder fixed point theorem, the operator L admits a fixed point solution to the problem (3.1). Moreover, since u,v∈L2(0,T;H1(Ω)) and ∂u∂t,∂v∂t∈L2(0,T;H1(Ω)′), by Aubin's theorem [26], we deduce that u,v∈C(0,T;L2(Ω)).
In order to show that the solution of (2.7) is unique, we consider two different solutions (u1,v1) and (u2,v2) to the problem (2.7). Then we have
{⟨∂u1∂t,ϕ⟩+∫ΩD(Jρ(∇u1σ))∇u1∇ϕ+∫Ωαv1ϕ=0,⟨∂v1∂t,ϕ⟩+∫Ω∇v1∇ϕ+∫Ωfϕ−∫Ωu1ϕ=0, | (3.19) |
and
{⟨∂u2∂t,ϕ⟩+∫ΩD(Jρ(∇u2σ))∇u2∇ϕ+∫Ωαv2ϕ=0,⟨∂v2∂t,ϕ⟩+∫Ω∇v2∇ϕ+∫Ωfϕ−∫Ωu2ϕ=0, | (3.20) |
By subtracting both variational formulation of (u1,v1) and (u2,v2), we obtain
{⟨∂(u1−u2)∂t,ϕ⟩+∫Ω(D(Jρ(∇u1σ))∇u1−D(Jρ(∇u2σ))∇u2)∇ϕ+∫Ωα(v1−v2)ϕ=0,⟨∂(v1−v2)∂t,ϕ⟩+∫Ω∇(v1−v2)∇ϕ−∫Ω(u1−u2)ϕ=0, | (3.21) |
We take ϕ=u1−u2 in the first equation of (3.21) and ϕ=v1−v2 in the second, we get
{d2dt∣∣u1(t)−u2(t)∣∣2L2(Ω)+∫Ω(D(Jρ(∇u1σ))(∇(u1(t)−u2(t)))2+∫Ω(D(Jρ(∇u1σ))−D(Jρ(∇u2σ)))∇u2∇(u1(t)−u2(t))+∫Ωα(v1−v2)(u1−u2)=0,d2dt∣∣v1(t)−v2(t)∣∣2L2(Ω)+∫Ω(∇(v1−v2))2−∫Ω(u1−u2)(v1−v2)=0, | (3.22) |
Now, multiplying the second equation of (3.22) by α and adding the two equations we get
d2dt∣∣u1(t)−u2(t)∣∣2L2(Ω)+αd2dt∣∣v1(t)−v2(t)∣∣2L2(Ω)+∫Ω(D(Jρ(∇u1σ))(∇(u1(t)−u2(t)))2+∫Ω(D(Jρ(∇u1σ))−D(Jρ(∇u2σ)))∇u2∇(u1(t)−u2(t))+α∫Ω(∇(v1−v2))2=0 |
Thanks to the coercivity of D, we have
d2dt∣∣u1(t)−u2(t)∣∣2L2(Ω)+αd2dt∣∣v1(t)−v2(t)∣∣2L2(Ω)+β∣∣∇(u1(t)−u2(t))∣∣2L2(Ω)+α∣∣∇(v1(t)−v2(t))∣∣2L2(Ω)≤∣∣D(Jρ(∇u1σ))−D(Jρ(∇u2σ))∣∣L∞(Ω)∫Ω∣∇u2(t)∣∣∇(u1(t)−u2(t))∣ |
Since the operator D(Jρ) is smooth enough, we have
∣∣D(Jρ(∇u1σ))−D(Jρ(∇u2σ))∣∣L∞(Ω)≤c∣∣u1(t)−u2(t)∣∣L2(Ω) | (3.23) |
Using (3.23) and hypothesis (H1), and Holder inequality, we have
d2dt∣∣u1(t)−u2(t)∣∣2L2(Ω)+αd2dt∣∣v1(t)−v2(t)∣∣2L2(Ω)+β∣∣∇(u1(t)−u2(t))∣∣2L2(Ω)+α∣∣∇(v1(t)−v2(t))∣∣2L2(Ω)≤c∣∣u1(t)−u(t)∣∣L2(Ω)∣∣∇u2(t)∣∣L2(Ω)∣∣∇(u1(t)−u2(t))∣∣L2(Ω) |
Integrating over [0,s) with s∈(0,T] and applying Young's inequality for enough epsilon, we have
12∣∣u1(s)−u2(s)∣∣2L2(Ω)+(β−ε2)∫s0∣∣∇(u1(t)−u2(t))∣∣2L2(Ω)dt |
≤c2ε∫s0∣∣u1(t)−u2(t)∣∣2L2(Ω)∣∣∇u2(t)∣∣2L2(Ω)dt |
For ε<2β, we have
12∣∣u1(s)−u2(s)∣∣2L2(Ω)≤c2ε∫s0∣∣u1(t)−u2(t)∣∣2L2(Ω)∣∣∇u2(t)∣∣2L2(Ω)dt. |
Using Gronwall's inequality we have
u1=u2. |
Now back to the second equation of (3.22), we have
d2dt∣∣v1(t)−v2(t)∣∣2L2(Ω)+∫Ω(∇(v1−v2))2=0 |
which means that v1=v2,
Hence
(u1,v1)=(u2,v2). |
In this section, we are interested in the numerical approximation of the proposed model. In fact, to compute numerically the problem (2.7), we carry out a fully discretization of the model using finite difference method.
Assume k to be the time step size and h the spatial grid size, we discretize time and space as follows:
tn=nk,n=0,1,2....,xi=ih,i=0,1,2,...,M,yj=jh,j=0,1,2,...,N. |
Denote uni,j, vni,j and fi,j the approximations of u(tn,xi,yj), v(tn,xi,yj) and f(x,y) respectively, then we define the discrete approximations :
∂u(t,x,y)∂t=un+1i,j−uni,jkand∂v(t,x,y)∂t=vn+1i,j−vni,jk |
Δvni,j=vni,j−1+vni,j+1−4vni,j+vni−1,j+vni+1,jh2 |
it remains now to discretize the term of diffusion div(D(Jρ(∇uσ))∇u), to do so, we consider the method represented by Weickert [19,Chapter 3], which consists of acting by convolution on the discrete image in any pixel with kernel, called a non-negative stencil. For that we write the diffusion tensor such as (abbc) which is calculated by the structure tensor Jρ(∇uσ), then the term of diffusion can be rewritten as
div(D(Jρ(∇uσ))∇u)=div[(abbc)(∂xu∂yu)]=∂x(a∂x(u))+∂x(b∂y(u))+∂y(b∂x(u))+∂y(c∂y(u)) | (4.1) |
Hence, the discretization of the diffusion term is given by
[div(D(Jρ(∇uσ))∇un)]i,j=(∂xa)i,j(∂xun)i,j+ai,j(∂xxun)i,j+(∂xb)i,j(∂yun)i,j+bi,j(∂xyun)i,j+(∂yb)i,j(∂xun)i,j+bi,j(∂yxun)i,j+(∂yc)i,j(∂yun)i,j+ci,j(∂yyun)i,j | (4.2) |
then this standard discretization is equivalent to acting by convolution on the image u at any point (i,j) by a matrix of size 3×3 called by the Stencil matrix denoted by S [19,Chapter 3,p. 95], if A(u) indicates the matrix containing the elements of term div(D(Jρ(∇uσ))∇u) after the discretization, then an element of A(u) is calculated by
[A(un)]i,j=uni−1,j−1s11+uni−1,js12+uni−1,j+1s13+uni,j−1s21+uni,js22+uni,j+1s23+uni+1,j−1s31+uni+1,js32+uni+1,j+1s33 |
Finally, the discrete explicit scheme of the problem (2.7) could be written as
{un+1i,j=uni,j+k([A(un)]i,j−αvni,j),vn+1i,j=vni,j+k(Δvni,j−fi,j+uni,j),u0i,j=fi,j,v0i,j=0. | (4.3) |
for all k≥0, 0≤i≤N and 0≤j≤M.
In this section, we illustrate the performance of the proposed model for image denoising. For a fair comparison, these methods are implemented using Matlab 2012a on the platform: 3 GHz dual-core CPU and 8 Gbytes RAM. We use the relative error (Er) as a stopping criteria of the following numerical simulations, which is defined by
Er=‖un+1−un‖L2‖un‖L2<10−5, |
where un is the restored image at the iteration n.
We have tested the proposed multi-frame SR method on a large database image using different applications, we present in the following experiments only some of them. Two commonly used quality measures are considered to evaluate the denoising performance, i.e., PSNR and the SSIM indexes. For the following tests we fix the parameters of our method such as k=0.15, α=0.01, ρ=1.4 σ=1.6 and maxIter=500. While the values of k1 and k2 are chosen with respect to the best PSNR values. For the following tests, we chose k1∈[30,150] and k2∈[10,250], respectively.
In order to validate our model in computing the component u and v, we begin with validation tests, where we select four noisy images (with different standard deviation σ). In Figure 2, we have presented the restored image u and the computed component v for each test. From this figure it is clear that our model is able to recover image features even if the noise level is high.
For a convenient comparison, we compare our method with some competitive denoising methods, among them: the TV-H−1 [13], the telegraph coupled partial differential equation (TCPDE) proposed in [27], TV-L2-H−1 [17], the fourth-order PDE (FOPDE) [28] and also the nonlinear fractional reaction-diffusion system (NFAD) [15]. Note that concerning the chosen parameters for the proposed algorithm, we take k1=55, k2=45, k=0.1, α=0.01, ρ=3.2, time step size k=0.1, σ=2.2 and maxIter=1000. In contrast, the used parameters for the compared methods are chosen inspired from the given parameters in numerical results of their respective papers. In fact, the used parameters for these methods (including the proposed one) corresponding to the following tests are depicted in Table 1.
Parameters | Method | |||||
FOPDE | TV-H−1 | TV-L2-H−1 | TCPDE | NFAD | Our Method | |
Iteration number N | 1000 | 1000 | 1000 | 1000 | 1000 | 1000 |
The time step size Δt | 0.1 | 0.001 | 1 | 0.1 | — | 0.1 |
The parameter α1 | 0.06 | — | — | 0.02 | 0.065 | — |
Spatially decaying effect (k1,k2) | (100,44) | — | — | — | — | (35,35) |
The fractional order derivative β | — | — | — | — | 1.77 | — |
Regularization parameter η | — | 0.01 | 0.01 | 0.01 | — | — |
The parameter λ | — | 1 | 10 | — | — | — |
● Firstly, we consider the " Motif" image and we configure a simulated test. We add a Gaussian noise with parameter σ=30. The restored images using different denoising approaches are shown in Figure 3 and the associated 3D surfaces in Figure 4. We can see that the proposed reaction-diffusion equation outperforms the other methods and we can see the difference better in the smooth areas, where the staircasing effect is efficiently avoided.
● The next experiments deals with Drop image, which is contaminated by a Gaussian noise with standard deviation σ=40. The aim is to restore the clean image and compare it with the other denoising methods. The obtained results for the three tests are shown in Figure 5. As the previous test, the proposed PDE-constrained equation gives the better result. We can see the difference better in the 3D plots, where we show the image region surfaces of each restored image in Figure 6. As a result, it is quite visible that the proposed method demonstrates clearly it performance as seen in the restored image: edges are efficiently preserved, homogeneous areas are free from noise and low-contrast objects are quite visible. This conforms the fact, that the idea of computing the couple u and v with the tensor diffusion deals with the competitive image denoising techniques.
● For the third test we use Brain image, we added a Gaussian noise with σ=50. In Figure 7, we present the restored image using different enhancement methods. Once again, we can see clearly the robustness of the proposed PDE compared with the other ones. This also confirmed in Figure 8, where we present the respective 3D surfaces. A we can see the image regions recovered by our method look very close to the ones of the original image, which is not the case of the compared methods.
To give a fair and quantitative comparison with the other methods, we use the PSNR and SSIM measures. Effectively, we show the evolution of the PSNR and SSIM with respect to the first 1000 iterations for the proposed and compared methods in Figure 9. We can see once again that always our approach reaches the best PSNR and SSIM values for the three tests.
Finally, we propose two real MRI tests downloaded from*, where the images are corrupted by unknown noise supposed to be of Poisson type. The aim is to recover a clean image with strong edges and considerable contrast. Figure 8 illustrated the recovered MRI Head using different denoising approaches, while Figure 11 presents the obtained clean image u for the real MRI Knee image with comparison to other methods. The final two results obtained using the proposed equation clearly indicates that the significant edges and textures are recovered with less blurring and staircasing. As a conclusion, from these real images, it is easy to observe that the proposed PDE is more efficient to remove almost all noise particles with effective structure preservation without information about the noise type.
In this paper, we have proposed a coupled PDE denoising model. This PDE is based on a diffusive tensor with efficient diffusion properties along contours. The well-posedness study of the proposed PDE is also achieved using the Schauder theorem. Finally, experiment results demonstrate the ability of the proposed model compared with the results of some competitive models. Since the two parametersk1 and k2 affect the smoothing phenomena near strong edges, an optimization procedure will be of interest to compute these parameters, which will help the model to control the diffusion tackled by the tensor term.
The authors are grateful to the two reviewers for their valuable comments, which improved the readability of this paper.
The authors declare that they have no conflict of interest.
[1] |
Z. Guo, J. Yin, Q. Liu, On a reaction-diffusion system applied to image decomposition and restoration, Math. Comput. Model., 53 (2011), 1336–1350. https://doi.org/10.1016/j.mcm.2010.12.031 doi: 10.1016/j.mcm.2010.12.031
![]() |
[2] |
Z. Guo, Q. Liu, J. Sun, B. Wu, Reaction-diffusion systems with p(x)-growth for image denoising, Nonlinear Anal. Real World Appl., 12 (2011), 2904–2918. https://doi.org/10.1016/j.nonrwa.2011.04.015 doi: 10.1016/j.nonrwa.2011.04.015
![]() |
[3] |
A. Hadri, H. Khalfi, A. Laghrib, M. Nachaoui, An improved spatially controlled reaction–diffusion equation with a non-linear second order operator for image super-resolution, Nonlinear Anal. Real World Appl., 62 (2021), 103352. https://doi.org/10.1016/j.nonrwa.2021.103352 doi: 10.1016/j.nonrwa.2021.103352
![]() |
[4] |
M. Lysaker, A. lundervold, X. Tai, Noise removal using fourth-order partial differential equation with applications to medical magnetic resonance images in space and time, IEEE Trans. Image Process, 12 (2003), 1579–1590. https://doi.org/10.1109/TIP.2003.819229 doi: 10.1109/TIP.2003.819229
![]() |
[5] |
S. G. Chang, B. Yu, M. Vetterli, Adaptive wavelet thresholding for image denoising and compression, IEEE Trans. Image Process, 9 (2000), 1532–1546. https://doi.org/10.1109/83.862633 doi: 10.1109/83.862633
![]() |
[6] | G. Gimel'farb, Image Textures and Gibbs Random Fields, Kluwer Academic Publishers, 1999. |
[7] |
A. Buades, B. Coll, J. Morel, A non-local algorithm for image denoising, IEEE Comput. Vis. Pattern Recognit, 2 (2005), 60–65. https://doi.org/10.1109/CVPR.2005.38 doi: 10.1109/CVPR.2005.38
![]() |
[8] |
L. Rudin, S. Osher, E. Fatemi, Nonlinear total variation based noise removal algorithms, Physica D, 60 (1992), 259–268. https://doi.org/10.1016/0167-2789(92)90242-F doi: 10.1016/0167-2789(92)90242-F
![]() |
[9] |
R. Acar, C. Vogel, Analysis of bounded variation penalty methods for ill-posed problems, Inverse Probl., 10 (1994), 1217–1229. https://doi.org/10.1088/0266-5611/10/6/003 doi: 10.1088/0266-5611/10/6/003
![]() |
[10] |
A. Chambolle, P. Lions, Image recovery via total variation minimization and related problems, Numer. Math., 76 (1997), 167–188. https://doi.org/10.1007/s002110050258 doi: 10.1007/s002110050258
![]() |
[11] |
A. Hadri, A. Laghrib, H. Oummi, An optimal variable exponent model for magnetic resonance images denoising, Pattern Recognit. Lett., 151 (2021), 302–309. https://doi.org/10.1016/j.patrec.2021.08.031 doi: 10.1016/j.patrec.2021.08.031
![]() |
[12] | L. Vese, S. Osher, Modeling textures with total variation minimization and oscillating patterns in image processing, J. Sci. Comput., 19 (2003), 553–572. |
[13] |
S. Osher, A. Solé, L. Vese, Image decomposition and restoration using total variation minimization and the H-1 norm, Multiscale Model. Simul., 1 (2003), 349–370. https://doi.org/10.1137/S1540345902416247 doi: 10.1137/S1540345902416247
![]() |
[14] | Y. Meyer, Oscillating Patterns in Image Processing and Nonlinear Evolution Equations, in: Univ. Lecture Ser., AMS, 2002. |
[15] |
A. Atlas, M. Bendahmane, F. Karami, D. Meskine, O. Oubbih, A nonlinear fractional reaction-diffusion system applied to image denoising and decomposition, Discrete Contin. Dyn. Syst. Ser. B, 26 (2021), 4963. https://doi.org/10.3934/dcdsb.2020321 doi: 10.3934/dcdsb.2020321
![]() |
[16] |
M. M. Y. Giga, P. Rybka, A duality based approach to the minimizing total variation flow in the space Hs, Jpn. J. Ind. Appl. Math., 36 (2019), 261–286. https://doi.org/10.1007/s13160-018-00340-4 doi: 10.1007/s13160-018-00340-4
![]() |
[17] |
A. Halim, B. R. Kumar, A TV- L2- H- 1 PDE model for effective denoising, Comput. Math. with Appl., 80 (2020), 2176–2193. https://doi.org/10.1016/j.camwa.2020.09.009 doi: 10.1016/j.camwa.2020.09.009
![]() |
[18] |
K. Papafitsoros, C. B. Schoenlieb, B. Sengul, Combined first and second order total variation inpainting using split bregman, Image Process. Line, 3 (2013), 112–136. https://doi.org/10.5201/ipol.2013.40 doi: 10.5201/ipol.2013.40
![]() |
[19] | J. Weickert, Anisotropic Diffusion in Image Processing, Teubner, Stuttgart, 1998. |
[20] |
P. Perona, J. Malik, Scale-space and edge detection using anisotropic diffusion, IEEE Trans. Pattern Anal. Mach. Intell., 12 (1990), 629–639. https://doi.org/10.1109/34.56205 doi: 10.1109/34.56205
![]() |
[21] |
I. El Mourabit, M. El Rhabi, A. Hakim, A. Laghrib, E. Moreau, A new denoising model for multi-frame super-resolution image reconstruction, Signal Process., 132 (2017), 51–65. https://doi.org/10.1016/j.sigpro.2016.09.014 doi: 10.1016/j.sigpro.2016.09.014
![]() |
[22] |
F. Catté, P.-L. Lions, J.-M. Morel, T. Coll, Image selective smoothing and edge detection by nonlinear diffusion, SIAM J. Numer. Anal., 29 (1992), 182–193. https://doi.org/10.1137/0729012 doi: 10.1137/0729012
![]() |
[23] | E. Zeidler, Nonlinear Functional Analysis Vol.1: Fixed-Point Theorems, Springer-Verlag Berlin and Heidelberg GmbH and Co. K, 1986. |
[24] | L. C. Evans, Partial differential equations, volume 19. Rhode Island, USA, 1998. |
[25] | H. Attouch, G. Buttazzo, G. Michaille, Variational analysis in Sobolev and BV spaces: applications to PDEs and optimization, SIAM, 2014. |
[26] | J.-P. Aubin, Un théoreme de compacité, CR Acad. Sci. Paris, 256 (1963), 5042–5044. |
[27] |
S. Majee, S. K. Jain, R. K. Ray, A. K. Majee, On the development of a coupled nonlinear telegraph-diffusion model for image restoration, Comput. Math. with Appl., 80 (2020), 1745–1766. https://doi.org/10.1016/j.camwa.2020.08.010 doi: 10.1016/j.camwa.2020.08.010
![]() |
[28] |
A. Laghrib, A. Hadri, A. Hakim, An edge preserving high-order PDE for multiframe image super-resolution, J. Franklin Inst., 356 (2019), 5834–5857. https://doi.org/10.1016/j.jfranklin.2019.02.032 doi: 10.1016/j.jfranklin.2019.02.032
![]() |
1. | Abdelmajid El Hakoume, Ziad Zaabouli, Amine Laghrib, Lekbir Afaites, 2023, Chapter 9, 978-3-031-33068-1, 137, 10.1007/978-3-031-33069-8_9 | |
2. | Z. Zaabouli, A. El Hakoume, L. Afraites, A. Laghrib, A novel coupled p ( x ) and fractional PDE denoising model with theoretical results , 2024, 101, 0020-7160, 1300, 10.1080/00207160.2024.2394860 | |
3. | A. El Hakoume, Z. Zaabouli, L. Afraites, A. Laghrib, On a Mathematical Analysis of a Coupled System Adapted to MRI Image Denoising, 2023, 33, 0938-8974, 10.1007/s00332-023-09969-z |
Parameters | Method | |||||
FOPDE | TV-H−1 | TV-L2-H−1 | TCPDE | NFAD | Our Method | |
Iteration number N | 1000 | 1000 | 1000 | 1000 | 1000 | 1000 |
The time step size Δt | 0.1 | 0.001 | 1 | 0.1 | — | 0.1 |
The parameter α1 | 0.06 | — | — | 0.02 | 0.065 | — |
Spatially decaying effect (k1,k2) | (100,44) | — | — | — | — | (35,35) |
The fractional order derivative β | — | — | — | — | 1.77 | — |
Regularization parameter η | — | 0.01 | 0.01 | 0.01 | — | — |
The parameter λ | — | 1 | 10 | — | — | — |
Parameters | Method | |||||
FOPDE | TV-H−1 | TV-L2-H−1 | TCPDE | NFAD | Our Method | |
Iteration number N | 1000 | 1000 | 1000 | 1000 | 1000 | 1000 |
The time step size Δt | 0.1 | 0.001 | 1 | 0.1 | — | 0.1 |
The parameter α1 | 0.06 | — | — | 0.02 | 0.065 | — |
Spatially decaying effect (k1,k2) | (100,44) | — | — | — | — | (35,35) |
The fractional order derivative β | — | — | — | — | 1.77 | — |
Regularization parameter η | — | 0.01 | 0.01 | 0.01 | — | — |
The parameter λ | — | 1 | 10 | — | — | — |