782
Views
4
CrossRef citations to date
0
Altmetric
Research Article

Nonlinear conjugate gradient method for identifying Young's modulus of the elasticity imaging inverse problem

ORCID Icon, ORCID Icon & ORCID Icon
Pages 2165-2185 | Received 30 Dec 2018, Accepted 08 Mar 2021, Published online: 02 Apr 2021

Abstract

Application of elasticity imaging inverse problem to identify Young's modulus in the elasticity problems in human's life is an interesting research area. In this study, we identify the modulus of elasticity for solving elasticity imaging inverse problem using a modified output least-squares method. Numerical convergence in the displacements of the direct problem for elasticity is investigated. To study the elasticity imaging inverse problem in an optimization framework, we utilize the sensitivity and adjoint problems to conceptualize a new model for computing the gradient of the minimizer. Discrete formulae in the model are then used to devise a scheme for an efficient computation gradient of the modified output least-squares objective function using the nonlinear conjugate gradient method. Numerical experiments demonstrate the effectiveness of the proposed technique.

2010 Mathematics Subject Classifications:

1. Introduction

Elasticity imaging inverse problem (EIIP) is an innovative approach that makes use of the varying elastic features of healthy and diseased tissues to detect lesions. The basic principle is to exert a small external and quasi-static compression force on the tissue to measure the displacement field or overall motion of the tissue. From this measurement, a tumour can be determined by reconstructing the Young's modulus and/or Poisson's ratio. This is otherwise known as an inverse problem of determining the tissue's elastic properties. Several researchers have proposed elastic imaging methods e.g. Smyl et al. [Citation1] studied a quasi-static EIIP for determining inhomogeneous orthotropic elastic properties using distributed displacement measurements obtained from digital image correlation. A MATLAB-based Quasi-Static Elasticity Imaging (QSEI) package was presented by Smyl et al. [Citation2] for solving the QSEI problem. Raghavan and Yagle [Citation3] studied the reconstruction of elasticity from measured strains and the equations of equilibrium in a framework of an inverse problem. In their contribution, the equations of equilibrium were solved by the finite difference schemes. Doyley et al. [Citation4] employed a modified Newton–Raphson based iterative scheme for solving the inverse optimization problem. These studies focused on the computation of the Young's modulus (E). Andrei [Citation5] applied the variational method to determine the elastic modulus distribution of the constitutive equations. This method is mainly based on the error decomposition of the constitutive law for reconstructing the eigenelastic moduli and utilized especially on isotropic or cubic material symmetry, where the minimum number of elastic modulus can be directly related to the eigenelastic constants.

Dominguez et al. [Citation6] employed the adjoint method to compute the gradient in ultrasonic target detection. This method was also carried out by Knopoff et al. [Citation7] to solve tumour growth PDE-constrained optimization problem. Similarly, Oberai et al. [Citation8] applied the first-order adjoint method for solving the EIIP. Lozano [Citation9] started on some issues related to the discrete adjoint approach in a viscid flow problem. Furthermore, Jadamba et al. [Citation10] studied the numerical analysis of the EIIP and a conjugate gradient trust-region method was implemented for identifying the Lamé parameter. Parker et al. [Citation11] utilized a low-frequency mechanical vibration to a phantom for measuring the elasticity modulus coupled with a computational framework based on finite element methods. Fehrenbach et al. [Citation12] recovered spatial distribution of E under an assumption that the input data have directional displacements in a plane domain under a small quasi-static compression force. This serves as the basis for proposing a method to reconstruct elastic modulus spatial distribution up to some multiplicative factors in related works. An example is Arnold et al. [Citation13] where a clustering method was considered as a numerical procedure for identifying E. The works listed above dealt with the static approach only. Meanwhile, [Citation14,Citation15] and the references therein are exemplar studies that considered dynamic approaches to this problem. Peltz and Cacuci [Citation16,Citation17] introduced a predictive modelling methodology considering the model-parameter uncertainties (i.e. experimental and computational covariance matrices) that executed for the forward and inverse predictions.

Researchers have sought more quantitative approaches based on the elastic properties of soft tissue, giving rise to elasticity imaging methods for tumour detection (see [Citation18] and references cited therein). Recently, Jadamba et al. [Citation19] implemented both first- and second-order adjoint methods for the EIIP of detecting Young's modulus. Babaniyi et al. [Citation20] showed how to recover the displacement vector in the quasi-static elastography problem based on the sparse relaxation of momentum equation under the plane stress conditions. Computer simulations were conducted to demonstrate the relative merits of recovering tissue elasticity by using measurements of displacement vector and stress boundary conditions. On the other hand, simultaneously identification of two unknown parameters using a modified conjugate gradient method was introduced by Abdelhamid et al. [Citation21–23]. A fully discrete finite element method was established to solve the inverse optimization problem. Some other important developments can be found in [Citation8,Citation24].

In this paper, we propose a modified output least-squares method (MOLS) and implement the nonlinear conjugate gradient technique with some regularization incorporated in the variational formulation to identify the modulus of elasticity. A systematic mathematical and numerical justification of the algorithm is introduced. A thorough theoretical and numerical analysis of the EIIP for identifying the modulus of elasticity such as that occur in the soft tissue in the presence of tumors are investigated.

The outline of this paper is set as follows: In Section 2, we introduce the new mathematical model that describes the general equations of elasticity problem in 2-dimensional space and derive the variational formulation of the system. In Section 3, a new MOLS function is introduced and analyzed for solving the EIIP. In Section 4, the adjoint problem is derived using Lagrangian multipliers. In Section 5, we introduce the discrete gradient computation by using direct and adjoint approaches. In Section 6, we describe a numerical algorithm based on the nonlinear conjugate gradient method for solving the EIIP. In Section 7, numerical examples and results are presented to show the efficiency of the proposed method. In addition, performance analysis and comparisons are discussed. Finally, concluding remarks are provided in Section 8.

2. Mathematical formulation

The EIIP builds upon a combination of mathematical, computational and experimental techniques based on linear elasticity models. In the most existing literature on EIIP, soft tissue is modelled as a nearly incompressible elastic object. The tissue is assumed to be nearly incompressible, isotropic and continuous so that the following linear elasticity equations hold. The Young's modulus is assumed to be a function of the position i.e. E(x,y) and Poisson's ratio is known and constant ν=0.48, which could offer an accurate prediction of the elastic modulus in elastography [Citation20,Citation25,Citation26]. This assumption simplifies the identification process as there is only one parameter to be identified. The underlying mathematical model is a system of partial differential equations of a body (ΩRn,n=2 or 3) fixed along a portion of its boundary and describes the response of an elastic object to certain body forces and traction applied to its boundary. (1) {σxx+τxyy+fx=0in Ω,τxyx+σyy+fy=0in Ω,σxnx+τxyny=qxon Γi,τxynx+σyny=qyon Γi,andu=v=u0on Γc.(1) We assume that the boundary Ω consists of two parts, i.e. Ω=ΓiΓc. In this setting, the direct problem for (Equation1) is to find the displacement u=(u,v) when the body forces fx and fy are given on Ω. The traction vectors qx and qy are defined as Neumann boundary conditions on a part of the boundary denoted by Γi and n=(nx,ny) is the unit outward normal to Γi. The boundary Γi is defined on the left, top and right edges of Ω, respectively, while Γc is defined on the bottom edge of Ω and it is taken as a constant Dirichlet condition. For more details about the theory of elasticity, see [Citation27,Citation28]. The relationship between the stresses and strains is represented by (2) σ=EDκ,(2) where D is the material property matrix. The displacement field should be small enough so that a linear relationship holds. The stresses σ={σxσyτxy}T, τxy is the shear stress and strains are represented by κ={κxκyγxy}T. Then, we can rewrite (Equation2) in the following form: (3) [σxσyτxy]=ED[κxκyγxy].(3) The body's deformation can be approximated by applying an approximation of the plane stress condition. This leads to replacing D by the following material property matrix Dσ: (4) Dσ=ρ1[1ν0ν1000ρ2],(4) such that ρ1=11ν2 and ρ2=1ν2 are certain constants. Now, we introduce the relation between the strains and displacements using the kinematic equations. (5) [κxκyγxy]=[uxvyuy+vx].(5) In (Equation5), the vector-valued function u represents the displacement of the elastic object in the x and y directions, respectively. As mentioned above, using ultrasound, one can measure displacements in human tissue. Since cancerous tumors differ in their elastic properties from the surrounding healthy tissue, these tumors are then located by solving the inverse problem of identifying the variable parameters that describe the elastic properties of the tissue. In some engineering applications, the corresponding inverse problem is to identify Lamé parameters in linear elasticity, which are related to the more familiar E and ν [Citation29,Citation30]. The main technical challenge in the current study of EIIP is to identify E when certain measurements z of u are available. In order to develop the finite element formulation for the elasticity problem and overcome the locking effect, the Galerkin method is implemented. In the literature, other strategies have been adopted to deal with the looking effect. For example the least-squares finite element methods [Citation31], the discontinuous Galerkin methods [Citation32] and the mixed finite element methods [Citation33]. The space of test functions denoted by U is given by U={w=(w1,w2)H1(Ω):w=0onΓc}.To determinate (u,v)U, we apply the weighted residual method to the linear elasticity Equation (Equation1), such that: (6) Ω[w1(σxx+τxyy)w2(τxyx+σyy)]dΩ+Ω[w1fxw2fy]dΩ=0,(6) where w1 and w2 are the basis functions. By applying the integration by parts for the first term of (Equation6) and using the Green's identity, we obtain: (7) Ω[w1xσx+w1yτxyw2xτxy+w2yσy]dΩ+Ω[w1fxw2fy]dΩ+Γi[w1qxw2qy]dΓi=0,(7) where Γi is the boundary for natural conditions given in (Equation1). The variational formulation (Equation7) can be rewritten as follows: (8) Ω[w1x0w1y0w2yw2x][σxσyτxy]dΩ=Ω[w1fxw2fy]dΩ+Γi[w1qxw2qy]dΓi.(8) By substituting from (Equation3) and (Equation5) into (Equation8), the forward problem can be solved to find the displacement field (u,v) of (Equation1). The direct problem of elasticity can be considered as a saddle point problem as in [Citation10] and references therein.

3. Regularization approach for the elasticity problem

For the EIIP of identifying E, we introduce and analyse a new MOLS objective function for the variational problem (Equation8). The most challenging issue in using the MOLS function for the inverse problem is how to compute the derivatives of the parameters to displacements which are computationally expensive. The common output least-squares method for solving the inverse problems is given by: J(E)=12u(E)zηL2(Ω)2,where z=(zu,zv) is the measured data of noise order η and u is the solution of the direct problem (Equation1) that corresponds to E. Hence: (9) u(E~)zηL2(Ω)η,(9) where E~ is the exact parameter. Given two positive constants E0 and E1, the admissible set K for E can be taken as follows: K={EH1(Ω):E0E(x,y)E1<,a.e. inΩ}.Let the regularization term R(E) be the H1-regularization operator and defined by R(E)=EL2(Ω)2+EL2(Ω)2. We introduce a new MOLS objective function based on the linear elasticity problem and add some noise to the measured data as follows: (10) J(E)=ρ12Ω[uzuvzv]T[x(E((uzu)x+ν(vzv)y))+ρ2y(E((uzu)y+(vzv)x))ρ2x(E((uzu)y+(vzv)x))+y(E(ν(uzu)x+(vzv)y))]dΩ+βR(E).(10) Furthermore, we suppose that the identification parameter E(x,y) is perturbed by a small amount E+δE, such that δE is any direction in L(Ω): u(E+δE)u(E)+u(E)δE+O(δEL(Ω)2),and v(E+δE)v(E)+v(E)δE+O(δEL(Ω)2).Denote the sensitivity problem for u1u(E)δEL2(Ω) and v1v(E)δEL2(Ω). In the forward problem (Equation1) we replace each E by E+δE, each u(E) by u(E+δE), and each v(E) by v(E+δE). The next step, subtracting the forward problem from the new equation and neglecting the terms of second order, we obtain: (11) {σx1x+τxy1y=[σ~xx+τ~xyy]in\ Ω,τxy1x+σy1y=[τ~xyx+σ~yy]in\ Ω,σx1nx+τxy1ny=[σ~xnx+τ~xyny]on\ Γi,τxy1nx+σy1ny=[τ~xynx+σ~yny]on\ Γi,u1=v1=u0on\ Γc.(11) We can represent the relation between the stresses and strains for the sensitivity equation by: (12) [σx1σy1σxy1]=EDσ[u1xv1yu1y+v1x].(12) Similarly, the right-hand side of (Equation11), can be rewritten as follows: (13) [σ~xσ~yσ~xy]=δEDσ[uxvyuy+vx].(13) Applying the variational formulation to (Equation11), we obtain: (14) Ω[σx1w1x+τxy1w1yτxy1w2x+σy1w2y]dΩ+Ω[w1(σ~xx+τ~xyy)w2(τ~xyx+σ~yy)]dΩΓi[w1(σ~xnx+τ~xyny)w2(τ~xynx+σ~yny)]dΓi=0.(14) By applying the integration by parts for the second term of (Equation14), we obtain: (15) Ω[σx1w1x+τxy1w1yτxy1w2x+σy1w2y]dΩΩ[σ~xw1x+τ~xyw1yτ~xyw2x+σ~yw2y]dΩ=0,(15) Then, (16) Ω[σx1w1x+τxy1w1yτxy1w2x+σy1w2y]dΩ=Ω[σ~xw1x+τ~xyw1yτ~xyw2x+σ~yw2y]dΩ.(16) Equation (Equation16) can be rewritten as: (17) Ω[w1x0w1y0w2yw2x]EDσ[u1xv1yu1y+v1x]dΩ=Ω[w1x0w1y0w2yw2x]δEDσ[uxvyuy+vx]dΩ.(17) Hence, the sensitivity u1 and v1 are given as the solution of the linearized state equation. Meanwhile, the following steps are required to compute the directional derivative δE via the sensitivity approach. Similarly, we have to compute u1 and v1 by solving (Equation17). Thus, compute the gradient of the objective functional (Equation10). This procedure is expensive if the whole derivative JEδE is required. That is, for a basis φl of Ω, all the directional derivatives have to be computed. Each of them requires the solution of one linearized state Equation (Equation17). Moreover, solving the sensitivity problem will later help to find the step length.

4. Lagrange multipliers and adjoint problem

In this section, we begin with introducing the Lagrangian multipliers L. Consider the problem: (18) minEKJ(u,v,E),subject tocx(u,v,E)=0in Ω,cy(u,v,E)=0in Ω,B.Ccx=0on Γi,B.Ccy=0on Γi,(18) where cx and cy represent the state equations in x and y directions, respectively. Hence B.Ccx and B.Ccy define the Neumann boundary conditions on Γi corresponding to cx and cy, respectively. The Lagrangian can be represented by (19) L(u,v,E,λu,λv)=J(u,v,E)+Ωλucx(u,v,E)dΩ+Ωλvcy(u,v,E)dΩΓi(λuB.Ccx+λvB.Ccy)dΓi.(19) Here, (λu,λv) plays the role of Lagrange multiplier. The differential of L is given by: (20) Luδu=Juδu+Ωλuu[σxx+τxyy+fx(σxnx+τxyny)]δudΩ+Ωλvu[τxyx+σyy+fy(τxynx+σyny)]δudΩ,(20) and (21) Lvδv=Jvδv+Ωλuv[σxx+τxyy+fx(σxnx+τxyny)]δvdΩ+Ωλvv[τxyx+σyy+fy(τxynx+σyny)]δvdΩ.(21) Such that, Luδu=0 and Lvδv=0 to find the adjoint system. Here, δu means a change in the displacement field corresponding to a change in Young's modulus from E to E+δE. From (Equation20)–(Equation21) and using the integration by parts two times, we obtain the following adjoint system: (22) σxx+τxyy=ρ1xE(uzu)x+ν(vzv)y+ρ2yE(uzu)y+(vzv)xin Ω,τxyx+σyy=ρ1ρ2xE(uzu)y+(vzv)x++yEν(uzu)x+(vzv)yin Ω,σxnx+τxyny=0on Γi,τxynx+σyny=0on Γi,λu=λv=λ0on Γc.(22) Where, (u,v) satisfies the original elasticity problem (Equation1) and λ0 is given initial condition. We can represent the relation between stresses σ and solution of the adjoint equation as follows: (23) [σxσyσxy]=EDσ[λuxλvyλuy+λvx].(23) Applying the variational formulation to (Equation22), we obtain: (24) Ωσxw1x+τxyw1yτxyw2x+σyw2ydΩ+Γiw1(σxnx+τxyny)w2(τxynx+σyny)dΓi+Ωw1ρ1xE(uzu)x+ν(vzv)y+ρ2yE(uzu)y+(vzv)xw2ρ1ρ2xE(uzu)y+(vzv)x+yEν(uzu)x+(vzv)ydΩ=0,(24) Then, (25) Ωσxw1x+τxyw1yτxyw2x+σyw2ydΩ=Ωρ1E(uzu)x+ν(vzv)yw1x+ρ1ρ2E(uzu)y+(vzv)xw1yρ1ρ2E(uzu)y+(vzv)xw2x+ρ1Eν(uzu)x+(vzv)yw2ydΩ.(25) Here, the variational form (Equation25) can be rewritten as follows: (26) Ω[w1x0w1y0w2yw2x]EDσ[λuxλvyλuy+λvx]dΩ=Ω[ρ1E((uzu)x+ν(vzv)y)w1x+ρ1ρ2E((uzu)y+(vzv)x)w1yρ1ρ2E((uzu)y+(vzv)x)w2x+ρ1E(ν(uzu)x+(vzv)y)w2y]dΩ.(26)

5. Gradient computation by the adjoint method

We give a scheme for computing the gradient formula by the first-order adjoint approach. Here (u,v) and (λu,λv) are the solutions of the direct problem (Equation1) and adjoint problem (Equation26), respectively.

5.1. Gradient computation by the direct approach

We consider the following discrete analogue optimization problem of the above functional to identify EK by solving: (27) J(E)=ρ12Ω[UZηVZη]T×[E(w1xw2x+ρ2w1yw2y)E(νw1xw2y+ρ2w1yw2x)E(νw1yw2x+ρ2w1xw2y)E(w1yw2y+ρ2w1xw2x)]×[UZηVZη]dΩ+βR(E).(27) Hence, w1 and w2 are test functions those can be defined as w1=Hi(i=1,2,,k) and w2=Hj(j=1,2,,k), respectively, (Equation27) can be rewritten as follows: (28) J(E)=12(UZη)TA(E)(UZη)+βR(E).(28) Where Ωe is the element area, U=(U,V), and the variable A(E) is defined as follows. (29) A(E)=ρ1Ω[E(w1xw2x+ρ2w1yw2y)E(νw1xw2y+ρ2w1yw2x)E(νw1yw2x+ρ2w1xw2y)E(w1yw2y+ρ2w1xw2x)]dΩ.(29) Hence, the first-order derivative of the above functional (Equation27) is derived as follows: (30) DJ(E)(δE)=12[δU(δE)TA(E)(UZη)+(UZη)TA(δE)(UZη)+(UZη)TA(E)δU(δE)]+βδR(E)(δE)=δU(δE)TA(E)(UZη)+12(UZη)TA(δE)(UZη)+βδR(E)(δE).(30) Where A is a symmetric matrix and δU=(δU,δV) solves the variational (sensitivity) equation in the discrete form: (31) A(E)δU(δE)=A(δE)U.(31) Therefore, the Jacobian U=(U,V) is computed by solving m equations: (32) A(E)iU=A(U)i,i=1,2,,m.(32) Then, Equation (Equation30) can be rewritten as follows: (33) J(E)=UTA(E)(UZη)+12(UZη)A(UZη)+βR(E).(33)

5.2. Gradient computation by the adjoint approach

We give a scheme for computing the gradient by using the adjoint approach. Let λ=(λU,λV) solve the discrete form of the continuous adjoint problem (Equation26) as follows: (34) A(E)λ=A(E)(UZη).(34) By multiplying the above Equation (Equation34) by δU, multiplying the sensitivity problem (Equation31) by λ, then subtracting we obtain: (35) λTA(δE)U=δU(δE)TA(E)(UZη).(35) Substituting into (Equation30), we obtain: (36) DJ(E)(δE)=λTA(δE)U+12(UZη)TA(δE)(UZη)+βδR(E)(δE),(36) which leads to a new explicit formula for the gradient as follows: (37) J(E)=λTA(U)+12(UZη)TA(UZη)+βR(E).(37) Hence, A is the adjoint stiffness matrix which holds A(δE)U=A(U)δE. For computing the gradient DJk(E)δE, we need to compute the derivative of the parameter E. So, we assume that E=i=1kφiχi as a function of the coefficient vector φi. The partial derivative jE(φi) can be written as follows: (38) jE(φi)=E(φi)φj=φji=1kφiχi=i=1kφjφiχi=i=1kφiφjχi=χj.(38) We recover simply the basis function χj as the j-th directional derivative of jE that makes it simple to calculate the derivative vector. The derivative DR(E)δE can be computed by (Equation38). The j-th partial derivative of the regularizer jR(E) applies the L2-norm, we have for any one of the derivative directions 1jk: (39) jR(E)=jΩEE=2ΩjEE=2ΩχjE=2i=1kφiΩχjχi.(39) Taking all derivatives directions immediately give us R(E)=2Mφ, for the L2-norm and Mij=χj,χi=Ωχjχi.

6. Numerical algorithm

In this section, we describe the nonlinear conjugate gradient method for solving the numerical optimization problem. Each iteration requires solving forward problem for finding the minimizer. The nonlinear conjugate gradient method stops when the approximate solution is accurate enough or satisfies the discrepancy principle for stopping criterion. The main steps of the proposed algorithm are given below.

Algorithm 6.1

  • 1- Choose the initial guess E0, set the direction d0=J(E0) and set k: = 0.

  • 2- Solve the forward problem (u(Ek),v(Ek)) and compute the residual: ruk=u(Ek)zuηandrvk=v(Ek)zvηinΩ.

  • 3- Solve the adjoint problem (λu(Ek),λv(Ek)) and determine the gradient J(Ek)E

  • 4- Compute the conjugate coefficient: βk=J(Ek)L2(Ω)2J(Ek1)L2(Ω)2.

  • 5- Compute the descent direction of E(x,y): dk+1=J(Ek)+βkdk.

  • 6- Solve the sensitivity problem (u1(Ek),v1(Ek)).

  • 7- Compute the step length αk.

  • 8- Update the identification parameter E: Ek+1:=Ek+αkdk+1.

  • 9- If u(Ek)zη2τη Stop; Otherwise k: = k + 1 and go to Step 2. Here τ is a given positive constant.

This algorithm is built for reconstructing the Young's modulus Ek and the obtained numerical approximation is chosen according to the discrepancy principle for terminating the iteration process. Computations in this work and previous studies (see, [Citation34–36]) emphasized the use of the discrepancy principle in stopping the iterative procedure. The number of iterations plays the role of regularization parameter. We can choose a suitable value for the parameter τ to specify beforehand the number of iterations which would correspond to a reasonable proximity of the last approximation to the actual Ek. In the finite element computations, we used an adaptive mesh to obtain an accurate solution for the measured data. Since we are identifying a smooth parameter, we employed the H1(Ω)-norm as a regularizer. The parameter of regularization has a significant influence on the number of iterations. Moreover, the regularization term copes with the instability of the minimization function (Equation27). Many approaches have been introduced in the literature such as the L-curve [Citation37], Morozov's discrepancy principle and generalized cross-validation (GCV) for finding optimal values for the regularization parameters. A set of values are examined by trial and error method to find a proper β but not the optimal value (i.e. [Citation38,Citation39]). As a result, the value of β=106 is thus chosen in the reported numerical examples.

Remark 6.1

The step length αk is determined by minimizing the objective functional J(Ek) (Equation10) corresponding to αk, i.e. solving αk=argminα0J(Ek),with Ek+1=Ek+αkdk. By using the first-order truncated Taylor series expansion of the forward operator (u(Ek),v(Ek)) around Ek. Our numerical experiments indicate that it works very well for the parameter identification Ek.

7. Numerical experiments

In this section, we present the numerical examples to identify a smooth E(x,y) on a uniform mesh. We solve the direct problem (Equation1) of elasticity in the variational formulation using (Equation8). In practice, we experimentally acquire the data zηL2(Ω) by (40) zη=u(x,y)(1+ηξ)onΩ,(40) where ξ is a uniform distributed random variable in [1,1]. The random variable ξ is adopted using MATLAB function rand(). The analytical solution for the proposed examples is given by (u,v)=(xy,xy). Then, we can derive certain body forces fx and fy and the traction applied to its boundaries qx and qy, directly on Γi. The computer simulations are conducted using MATLAB 2016A with CPU: Intel Xeon E5-2699v4 (2.2 GHz, 22Core/44Threads, 55 MB); Memory: 8×32 GB DDR4 2400 MHz ECC Registered DIMM.

Example 7.1

The exact identification coefficient Young's modulus E(x,y)=3+0.05e(x+y)2inΩ,the initial guess is given by E0=3.3.

Example 7.2

The exact identification coefficient is given by E(x,y)=1+0.51+e50((0.6x)2+(0.3y)2)3+0.31+e100((0.4x)2+(0.75y)2)3inΩ,the initial guess E0=1.1.

In Example 7.1, the dimension of E and therefore the number of gradient direction is 10201. Figure  shows the exact and the numerical reconstruction Ek (left) and residual error (right) at η=0.5% (Example 7.1). The residual error increases at a part of the boundary, due to the gradient computation. The relative error eE decreases rapidly with increasing the number of iterations k in the first 10th iterations after which it decreases slowly to reach the minimizer as shown in Figure . In Table , it is observed that eE and J increase gradually with increasing η at chosen NE (= 1800). Hence, the solution of the inverse problem fails after η=2.5% noise in the data. Table  shows the numerical convergence for Example 7.2 at η=1% and NE=9800. Furthermore, we note that the residual and relative errors decrease faster up to the first 25th-iterations, then start to decrease slowly. The reconstructed parameter is sensitive to the measurement data as shown from the effect of the noise level η on the measured data, where η=5%,1%,0.05%, respectively, for a mesh with 28,800 triangles (Figure ). Figure  shows the exact and reconstructed E for Example 7.2 at k = 34. At the first 25th iterations, the relative and residual errors are decreasing rapidly with increasing k, after which they decrease very slow till reach the minimizer (Figure ). It should be noted that the approximated gradient direction becomes non-descent when k is greater than 25 (Figure ). The solution of the EIIP in the proposed examples is quite stable to the perturbations of the input data using the proposed nonlinear conjugate gradient algorithm.

Figure 1. Exact and reconstructed Ek (left) and residual error of the coefficient (right) for Example 7.1 at η=0.5% and NE=20,000. The relative error eE=0.023 at k = 30.

Figure 1. Exact and reconstructed Ek (left) and residual error of the coefficient (right) for Example 7.1 at η=0.5% and NE=20,000. The relative error eE=0.023 at k = 30.

Figure 2. The variation of accuracy error (right) and residual error (left) corresponding to k for Example 7.1.

Figure 2. The variation of accuracy error (right) and residual error (left) corresponding to k for Example 7.1.

Table 1. The effect of the noise level on the identification parameter for Example 7.1.

Table 2. The numerical results (accuracy error) for Example 7.2.

Figure 3. Measurement data at different η, where (a) η=5%, (b) η=1%, and (c) η=0.05% for Example 7.1.

Figure 3. Measurement data at different η, where (a) η=5%, (b) η=1%, and (c) η=0.05% for Example 7.1.

Figure 4. Exact and reconstruction Ek (left), residual error (right) at k=34 for Example 7.2, the relative error eE=0.0128 and J=0.000521.

Figure 4. Exact and reconstruction Ek (left), residual error (right) at k=34 for Example 7.2, the relative error eE=0.0128 and J=0.000521.

Figure 5. The variation of accuracy error (right) and residual error (left) corresponding to k for Example 7.2.

Figure 5. The variation of accuracy error (right) and residual error (left) corresponding to k for Example 7.2.

Figure 6. The convergence with L2-gradient corresponding to k for Example 7.2.

Figure 6. The convergence with L2-gradient corresponding to k for Example 7.2.

7.1. Performance analysis and numerical comparison

To compare the proposed method with those in the literature, Jadamba et al's [Citation19] example (Example 7.2) is considered first. Table  presents some features of Example 7.2 such as the accuracy error eE and objective functional values J at different k. It is observed that at k = 38, a high accuracy is obtained, about 2%, decreasing very slowly with increasing k (Table ). These obtained results give a good agreement with those of Jadamba et al. [Citation19] where they achieved a high accuracy for the algorithm after 139 and 49 iterations using the first-order adjoint method and the Newton method with a simple backtracking line search method, respectively. Second, another comparison is made with Jadamba et al. [Citation19] (Example 6.1, [Citation10]) at the same boundary conditions where the smooth coefficient is given as follows.

Example 7.3

The exact identification coefficient E(x,y) and load function f(x,y) are given by (41) E(x,y)=10.5sinc[6π(x+110)(y+110)],f(x,y)=[15xcos(πx)]inΩ,g(x,y)=110[sin(πy)sin(πx)]andh(x,y)=110[1+10x1+10y]onΩ(41) The function g(x,y) represents the boundary condition on the bottom and left edges of Ω, and h(x,y) is given on the top and right edges of Ω.

The proposed method is implemented on a 70×70 mesh with 9800 total degrees of freedom at η=0.001. The residual error is defined as E=EcomputedEexact. Figure  shows the variation of the residual error E corresponding to the starting point (initial guess E0), and the E values are compared with those obtained from the existing OLS function and the MOLS function introduced by Jadamba et al. [Citation10]. This comparison was made with 50 trials chosen as constants to examine the sensitivity of E corresponding to E0. Figure and Tables  and  show that a high level of accuracy with a small k is obtained using the proposed technique as compared to those in the previous work. The main advantages of this proposed method are presented as follows. First, the considered η can be increased upto 2.5%, while the algorithm preserving the stability of the identification parameter (Table ). Second, it has been numerically investigated that the recovered parameter reaches to the global minimum at a small k due to the convexity of the modified output least-squares method (Figure ). The numerical results in this study show the efficiency and accuracy of the introduced algorithm. Figure shows that the convergence rate of the L2-gradient corresponding to k appears very steady. Jadamba et al. [Citation10] considered the convergence rate of the MOLS function compared with that of the nonconvex OLS function. They found that the number of forward solutions which has connection with k decreases with increasing the mesh size. Following that test to examine the method performance, we increased the mesh size and examined the eE and E, where one forward problem needs to be solved at each iteration. Table  compares NE, k, eE, E and elapsed time of the computations with those from Jadamba et al. [Citation10]. The results show that, the accuracy and residual errors decrease with increasing the mesh size, showing a good agreement with those from [Citation10]. We remark that, when E0 is far from the minimizer, more iterations are required to reach the global minimizer. Importantly, a good starting point should be chosen to determine the minimum k and computational cost.

Figure 7. A comparison of the residual error E using the present MOLS compared to that of Jadamba et al. [Citation10] and the existing OLS at different starting points E0 for Example 7.3.

Figure 7. A comparison of the residual error E using the present MOLS compared to that of Jadamba et al. [Citation10] and the existing OLS at different starting points E0 for Example 7.3.

Table 3. Performance of the MOLS with increasing NE for Example 7.3.

8. Conclusions

In this paper, an efficient method is developed and implemented for identifying the modulus of elasticity, given a precise measurement data in the displacements. The proposed problem is motivated by potential applications to reconstruct the cancerous tumour in the EIIP. The variational formulation is applied for solving the forward problem using an approximation of the plane strain and plane stress conditions. The obtained results demonstrate the effectiveness and robustness of the proposed finite element method for solving the forward and the inverse problem. A new modified output least-squares (MOLS) functional is introduced. The sensitivity and adjoint problems are derived using Lagrange multipliers to obtain a new formula to compute the gradient using direct and adjoint approaches which are easier and not expensive in the computations. The nonlinear conjugate gradient method is implemented to solve the optimization inverse problem since the considered problem is highly ill-posed. Numerical experiments are provided to show that the numerical convergence is quite satisfactory for the proposed method as compared to those of the literature. The numerical results indicate that the radial basis functions as in the proposed experiments can efficiently represent the modulus of elasticity such as those occur in the soft tissue in the presence of tumors. The aforementioned performance analysis, numerical verification and comparisons indicate that the proposed algorithm is efficient, stable, and accurate. Yet, there are open problems for future works including simultaneously identifying Young's modulus and Poisson ratio in the elasticity imaging inverse problem. Moreover, hyperelasticity and large deformation models can be used to give a more accurate representation for reconstructing the elastic properties of the human soft tissues.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work was supported by the Science and Technology Development Fund (STDF) of Egypt, project No: 39385. This research was supported in part by the National Key R&D Program of China under P2018YFE0198400, Shenzhen [grant number ZDSYS201703031711426], [grant number JCYJ20170818153840322], and NFSC [grant number 12071461].

References

  • Smyl D, Antin K-N, Liu D, et al. Coupled digital image correlation and quasi-static elasticity imaging of inhomogeneous orthotropic composite structures. Inverse Probl. 2018;34(12):124005.
  • Smyl D, Bossuyt S, Liu D. OpenQSEI: a MATLAB package for quasi static elasticity imaging. SoftwareX. 2019;9:73–76.
  • Raghavan K, Yagle AE. Forward and inverse problems in elasticity imaging of soft tissues. IEEE Trans Nucl Sci. 1994;41(4):1639–1648.
  • Doyley MM, Meaney PM, Bamber JC. Evaluation of an iterative reconstruction method for quantitative elastography. Phys Med Biol. 2000;45(6):1521–1540.
  • Constantinescu A. On the identification of elastic moduli from displacement-force boundary measurements. Inverse Probl Eng. 1995;1:293–313.
  • Dominguez N, Gibiat V, Esquerre Y. Time domain topological gradient and time reversal analogy: an inverse method for ultrasonic target detection. Wave Motion. 2005;42(1):31–52.
  • Knopoff DA, Fernández D, Torres GA, et al. Adjoint method for a tumor growth PDE-constrained optimization problem. Comput Math Appl. 2013;66(6):1104–1119.
  • Oberai AA, Gokhale NH, Feijóo GR. Solution of inverse problems in elasticity imaging using the adjoint method. Inverse Probl. 2003;19(2):297–313.
  • Lozano C. Discrete surprises in the computation of sensitivities from boundary integrals in the continuous adjoint approach to inviscid aerodynamic shape optimization. Comput Fluids. 2012;56:118–127.
  • Jadamba B, Khan A, Rus G, et al. A new convex inversion framework for parameter identification in saddle point problems with an application to the elasticity imaging inverse problem of predicting tumor location. SIAM J Appl Math. 2014;74(5):1486–1510.
  • Parker KJ, Huang SR, Musulin RA, et al. Tissue response to mechanical vibrations for ‘sonoelasticity imaging’. Ultrasound Med Biol. 1990;16(3):241–246.
  • Fehrenbach J, Masmoudi M, Souchon R, et al. Detection of small inclusions by elastography. Inverse Probl. 2006;22(3):1055–1069.
  • Arnold A, Reichling S, Bruhns OT, et al. Efficient computation of the elastography inverse problem by combining variational mesh adaption and a clustering technique. Phys Med Biol. 2010;55(7):2035–2056.
  • Ji L, McLaughlin J. Recovery of the Lamé parameter μ in biological tissues. Inverse Probl. 2003;20(1):1–24.
  • McLaughlin JR, Yoon J-R. Unique identifiability of elastic parameters from time-dependent interior displacement measurement. Inverse Probl. 2003;20(1):25–45.
  • Peltz JJ, Cacuci DG. Inverse predictive modeling of a spent fuel dissolver model. Nucl Sci Eng. 2016;184:1–15.
  • Cacuci DG. Inverse predictive modeling of radiation transport through optically thick media in the presence of counting uncertainties. Nucl Sci Eng. 2017;186:199–223.
  • Aguilo MA, Aquino W, Brigham JC, et al. An inverse problem approach for elasticity imaging through vibroacoustics. IEEE Trans Med Imaging. 2010;29:1012–1021.
  • Jadamba B, Khan AA, Oberai AA, et al. First-order and second-order adjoint methods for parameter identification problems with an application to the elasticity imaging inverse problem. Inverse Probl Sci Eng. 2017;25:1768–1787.
  • Babaniyi OA, Oberai AA, Barbone PE. Recovering vector displacement estimates in quasistatic elastography using sparse relaxation of the momentum equation. Inverse Probl Sci Eng. 2017;25(3):326–362.
  • Abdelhamid T. Simultaneous identification of the spatio-temporal dependent heat transfer coefficient and spatially dependent heat flux using an MCGM in a parabolic system. J Comput Appl Math. 2018;328(9):164–176.
  • Abdelhamid T, Deng X, Chen R. A new method for simultaneously reconstructing the space-time dependent Robin coefficient and heat flux in a parabolic system. Int J Numer Anal Model. 2017;14(6):893–915.
  • Abdelhamid T, Elsheikh AH, Elazab A, et al. Simultaneous reconstruction of the time-dependent Robin coefficient and heat flux in heat conduction problems. Inverse Probl Sci Eng. 2018;26(9):1231–1248.
  • Ammari H, Garapon P, Jouve F. Separation of scales in elasticity imaging: a numerical study. J Comput Math. 2010;28:354–370.
  • Harrigana TP, Konofagou EE. Estimation of material elastic moduli in elastography: a local method, and an investigation of Poissons ratio sensitivity. J Biomech. 2004;37:1215–1221.
  • Babuška I, Suri M. Locking effects in the finite element approximation of elasticity problems. Numer Math. 1992;62(1):439–463.
  • Kwon YW, Bang H. The finite element method using MATLAB. London: CRC Press; 2000.
  • Reddy JN. An introduction to the finite element method. Vol. 2, New York: McGraw-Hill; 1993.
  • Gockenbach MS, Khan AA. Identification of Lamé parameters in linear elasticity: a fixed point approach. J Indust Manag Optim. 2005;1(4):487–497.
  • Jadamba B, Khan AA, Raciti F. On the inverse problem of identifying Lamé coefficients in linear elasticity. Comput Math Appl. 2008;56(2):431–443.
  • Cai Z, Starke G. Least-squares methods for linear elasticity. SIAM J Numer Anal. 2004;42:826–842.
  • Houston DSP, Wihler TP. An hp-adaptive mixed discontinuous Galerkin FEM for nearly incompressible linear elasticity. Comput Methods Appl Mech Eng. 2006;195:3224–3246.
  • Brezzi F, Fortin M. Mixed and hybrid finite element methods. New York: Springer-Verlag; 2012.
  • Alifanov OM. Inverse heat transfer problems. Berlin: Springer Science & Business Media; 2012.
  • Jarny Y, Ozisik M, Bardon J. A general optimization method using adjoint equation for solving multidimensional inverse heat conduction. Int J Heat Mass Transfer. 1991;34(11):2911–2919.
  • Alifanov OM. Solution of an inverse problem of heat conduction by iteration methods. J Eng Phys Thermophys. 1974;26(4):471–476.
  • Hansen P, O'Leary D. The use of the L-curve in the regularization of discrete ill-posed problems. SIAM J Sci Comput. 1993;14(6):1487–1503.
  • Abdelhamid T, Elsheikh AH, Omisore OM, et al. Reconstruction of the heat transfer coefficients and heat fluxes in heat conduction problems. Math Comput Simul. 2021;187:134–154.
  • Abdelhamid T, Chen R, Alam MM. Prediction of multi-parameters in the inverse heat conduction problems. J Phys: Conf Ser. 2020;1707:012003.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.