Professional Documents
Culture Documents
Research Article
2.5D Inversion Algorithm of Frequency-Domain Airborne
Electromagnetics with Topography
Copyright © 2016 J. Xi and W. Li. This is an open access article distributed under the Creative Commons Attribution License, which
permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We presented a 2.5D inversion algorithm with topography for frequency-domain airborne electromagnetic data. The forward
modeling is based on edge finite element method and uses the irregular hexahedron to adapt the topography. The electric and
magnetic fields are split into primary (background) and secondary (scattered) field to eliminate the source singularity. For the
multisources of frequency-domain airborne electromagnetic method, we use the large-scale sparse matrix parallel shared memory
direct solver PARDISO to solve the linear system of equations efficiently. The inversion algorithm is based on Gauss-Newton
method, which has the efficient convergence rate. The Jacobian matrix is calculated by “adjoint forward modelling” efficiently. The
synthetic inversion examples indicated that our proposed method is correct and effective. Furthermore, ignoring the topography
effect can lead to incorrect results and interpretations.
1500
1 𝜕d 2
Φ (m) = (d + ⋅ Δm) − dobs
1000 2 𝜕m𝑖
(11)
500 𝛽 2
+ W (m𝑖 − mref ) ,
2
0
−150 −100 −50 0 50 100 150 where Δm is m − m𝑖 . Derive formula (11) and order it equal to
Distance (m) zero so as to obtain the model updated iterative formula for
Gauss-Newton method:
Sasaki 1 k I Sasaki 4 k Q
𝑇
This work 1 k I This work 4 k Q (J J + 𝛽W𝑇 W) ⋅ Δm
⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟
Sasaki 1 k Q Sasaki 16 k I
𝐻
This work 1 k Q This work 16 k I (12)
Sasaki 4 k I Sasaki 16 k Q
This work 4 k I This work 16 k Q
=− (J𝑇 (d − dobs ) + 𝛽W𝑇 W (m − mref )),
⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟⏟
𝑔
Figure 3: Comparison with Sasaki’s finite difference method result.
where 𝐻 is the approximate Hessian matrix, 𝑔 is the objective
function gradient, and J is Jacobian matrix or sensitivity
matrix, with its elements expressed as
3. Inversion Algorithm 𝜕𝑑1 𝜕𝑑1
[ 𝜕𝑚1 ⋅ ⋅ ⋅ 𝜕𝑚𝑛 ]
3.1. Objective Function Definition. The objective function can [ ]
[ . .. ]
be written as [ ]
J = [ .. d . ]. (13)
[ ]
[ ]
1 2 𝛽 2 [ 𝜕𝑑𝑚 𝜕𝑑𝑚 ]
Φ (m) = d (m) − dobs + W (m − mref ) , (9) ⋅⋅⋅
2 2 [ 𝜕𝑚1 𝜕𝑚𝑛 ]
where ‖ ⋅ ‖ denotes the Euclidean norm, d is the data vector 3.2. Jacobian Matrix Calculation. From formula (12), it is
obtained from forward modeling, dobs is the measured data known that the key to the model update iteration is to solve
vector, m is the model parameter vector, mref is the reference the linear system of equations, which in turn is decided by
model vector or the prior information model vector, W is Jacobian matrix or sensitivity matrix J; thus the calculation
the model smoothness matrix, and 𝛽 is the regularization for Jacobian matrix is crucial in the inversion algorithm, and
parameter that balances the effect of data misfit and model its calculation efficiency is decisive to some extent for the
regularization during minimization. inversion efficiency. The calculation methods for Jacobian
The objective function defined by formula (9) is divided matrix include analytic method, difference method, and
into data fitting item and regularization item. The former adjoint equation solution method [13–15]. Since the analytic
guarantees the inversed model to fit the measured data, while method cannot solve the matrix in high-dimensional inver-
the latter controls the inversion result to draw close to the sion and the difference method, though simple, is inefficient,
known prior model. There are normally three cases for the here we choose to solve the adjoint equation for the solution
regularization item: (1) smallest model, that is, smallest m − of Jacobian matrix. The calculation formula for the magnetic
mref ; (2) flattest model, that is, smallest first-order difference field is expressed as
operator for m−mref ; (3) most smooth model, that is, smallest 12
second-order difference operator for m − mref . Due to the −1
H = (−𝑖𝜔𝜇0 ) ∑∇ × N𝑖 𝐸𝑖 . (14)
inversion algorithm in this paper, the third type is adopted, 𝑖=1
4 Mathematical Problems in Engineering
The magnetic field’s model parameter derivative is where 𝛼 is the step length with the range as 0 < 𝛼 ≤ 1.
expressed as The suitable step length is defined by the following steepest
descent formula [16]:
12
𝜕H −1 𝜕𝐸
= (−𝑖𝜔𝜇0 ) ∑∇ × N𝑖 𝑖 . (15) 𝜙 (m𝑖+1 ) = 𝜙 (m𝑖 + 𝛼Δm)
𝜕𝑚 𝑖=1 𝜕𝑚 (19)
≤ 𝜙 (m𝑖 ) + 𝑐1 𝛼∇𝜙 (m𝑖 ) Δm,
The magnetic field’s model parameter derivative can be
converted into the electric field’s model parameter derivative. where 𝑐1 is a constant that in practice takes a very small
The forward modeling can yield a large-scale complex num- value, for example, 10−4 . Satisfying (19) guarantees that the
ber linear system of equations: our new model update adequately reduces the objective
function. When performing the model update in (18), the
Ax = b. (16) initial value of 𝛼 is set to one and the new model is generated.
The inequality in (19) was evaluated, and if the condition
Derive 𝑚 simultaneously from both sides of formula (15) is satisfied, the new model is acceptable., However, if the
to work out condition is not satisfied, 𝛼 is reduced by one-half, and (19)
𝜕x 𝜕A 𝜕b was reevaluated. This procedure is repeated until we find a
A =− x+ . (17) new model that meets the criterion of (19).
𝜕𝑚 𝜕𝑚 𝜕𝑚
The iterative process is repeated until the objective
The electric field’s model parameter derivative can be function and/or the data misfit have reduced to a specified
worked out by solving formula (17). Formula (17) has nearly level. Alternatively, the inversion can be stopped when the
the same coefficient matrix A as the forward modeling linear magnitude of the objective functional gradient falls below
system of equations, with difference at the right-hand item. a given tolerance, for example, 1.0𝑒 − 10, which indicates
The solving process is similar to the forward modeling pro- that the objective function has flattened out and that no
cess, named as “accompanying forward modeling.” Accord- further model improvements can be made. Moreover, the
ing to interchange theorem, to obtain the model parameter inversion can be stopped when the iteration number exceeds
sensitivity of the magnetic field at the receiving point, all the maximum iteration number. Our experience suggests that
that is needed is to put the unit source at the receiving point it is usually not more than ten iterations. Otherwise, stopping
and conduct “accompanying forward modeling” once. It is the inversion once the data misfit reaches the noise level of
equivalent to the simple weighted summation with the model the measure data usually provides reasonable results.
parameter-correlated element field value when putting the
unit source at the exact receiving point, which can be worked 3.3.2. Regularization Factor Selection. The regularization fac-
out from the right-hand item of formula (17). “Accompanying tor 𝛽 can balance the data misfit and model constraints.
forward modeling” is needed to be carried out just once, There are lots of schemes that have been recommended in
which refers to solving all the measured points and frequency literature and used in practice for the selection of 𝛽 [17, 18].
points, and then the Jacobian matrix can be obtained. To deal with 𝛽, there are three most common approaches:
(1) one fixed 𝛽 value in the whole inversion process; (2)
3.3. Solution for Model Updated Equations. As known from decreasing 𝛽 value gradually in each time of iteration; (3)
formula (12), to obtain the model parameter update vector choosing the most appropriate 𝛽 value by L curve in each
quantity, the linear system of equations must be solved first, time of iteration. Normally, scheme (3) has the best effect but
either solved directly or solved by iterative method. J𝑇 J needs requires additional calculation work to seek the appropriate
be worked out for the solution of formula (12). If selecting value each time. In this paper, schemes (1) and (2) are adopted
direct solution, Jacobian matrix J is needed to be stored. Here in the inversion and are found capable of yielding satisfactory
the preconditioned conjugate gradient iteration method is results as well. Furthermore, for a given problem one must
adopted, only with the multiplication of the matrix and the often determine 𝛽 through trial and error. When using trial
vector required to be worked out. As for whether to store the and error, one should seek the largest 𝛽 value which still
Jacobian matrix in the iteration method, if storing, though permits that data to be fit down to the noise level.
unnecessary to solve J in each time of iteration, the memory
demand will be large, and Jacobian matrix must be stored 3.4. Inversion Process. The inversion procedure is shown in
entirely due to its denseness, while if not storing, the memory Figure 4:
insufficiency can be avoided, but for each time of iteration,
(1) Set the number of iterations as 𝑖 = 0, the accuracy of
Jacobian matrix must be calculated once again, plus the
fitting, and the largest number of iterations, and input
forward modeling and “accompanying forward modeling”
the initial model and inversion data.
being conducted at each time.
(2) Conduct the forward modeling and solve the forward
modeling equation KF = b to work out the secondary
3.3.1. Step Length Selection. After obtaining the model para-
magnetic field 𝐻𝑥 and 𝐻𝑧 .
meter update vector Δm by working out formula (12), the next
iterative model is updated by (3) Calculate the fitting error, exit the program if the
set accuracy or the largest number of iterations is
m𝑖+1 = m𝑖 + 𝛼Δm, (18) achieved, and continue the program if not.
Mathematical Problems in Engineering 5
Start
No
Yes
Update model 𝐦k+1 = 𝐦k + Δ𝐦 Exit
0
1000
(ohm-m)
20
40 Figures 9 and 10, respectively, from which it is observed that
60 100
80 both HCP and VCX have satisfactorily reconstructed the
10
−200 −100 0 100 200 real model. Comparatively, HCP has better lateral resolution
Distance (m) while VCX acts better in vertical resolution.
HCP HCP
1400 1400
1200 1200
1000 1000
Quadrature (ppm)
In-phase (ppm)
800 800
600 600
400 400
200 200
0 0
−200 −100 0 100 200 −200 −100 0 100 200
Distance (m) Distance (m)
VCX VCX
0 0
−50 −50
−100
Quadrature (ppm)
−100
In-phase (ppm)
−150
−150
−200
−200
−250
−300 −250
−350 −300
−200 −100 0 100 200 −200 −100 0 100 200
Distance (m) Distance (m)
model, especially for the lateral stretch. Besides, much false- difference reduces to 2.2% of the first iteration misfit, refer-
ness and abnormities arise in the inversion profile, and parti- ring to Figure 18 for its variation along with the iterations.
cularly a high resistance anomalous body arises right below From Figure 19 showing inversion result for high-low resis-
the mountain due to the topographic impact. tance composite pattern (with the landform being taken
into account), it is observed that the inversion result has
4.2.2. High-Low Resistance Composite Pattern. The high-low satisfactorily reconstructed the real geoelectric model with no
resistance composite pattern is shown in Figure 16, with the redundant abnormity, whereas the high resistance anomalous
anomalous bodies in 10 ohm-m low and 3000 ohm-m high body, though being located correctly, is observed with its
resistance. The other parameters are the same as those in low resistance value as just 600 ohm-m which is far different
resistance composite pattern. The forward modeling result is from the real value of 3000 ohm-m. Oldenburg (2012) and
shown in Figure 17. others have asserted that this phenomenon is normal [19],
The initial model for inversion is even half-spatial with because the pure secondary abnormal field collected by
resistance of 300 ohm-m. By 10 times of iterations, the fitting frequency-domain airborne electromagnetics is insensitive
Mathematical Problems in Engineering 7
100 100
Percent of first iteration RMS (%)
60 60
40 40
20 20
0 0
0 2 4 6 8 10 0 2 4 6 8 10
Iteration number Iteration number
(a) HCP device (b) VCX device
0
1000
(ohm-m)
20
40
60 100
80
10
−200 −100 0 100 200
Distance (m)
0
20 1000 (ohm-m)
40
60 100
80
10
−200 −100 0 100 200
Distance (m)
−50 3000 the low resistance composite pattern, much falseness and
Depth (m)
HCP HCP
1000 1400
1200
800
1000
Quadrature (ppm)
In-phase (ppm)
600 800
400 600
400
200
200
0 0
−200 −100 0 100 200 −200 −100 0 100 200
Distance (m) Distance (m)
100
Percent of first iteration RMS (%)
80
60
40
20
0
0 2 4 6 8 10
Iteration number
3000 0 3000
Depth (m)
−50
20 448
Depth (m)
448 40
0 60 67
80
67 10
50 −200 −100 0 100 200
10 Distance (m)
−200 −100 0 100 200
Distance (m) Figure 15: Inversion result for mountain low resistance composite
pattern (without taken into account the landform).
Figure 14: Inversion result for mountain low resistance composite
pattern (with the landform being taken into account).
−50 3000
Depth (m)
0 448
taken into account can better reconstruct the real model; 67
50
otherwise much falseness and abnormities will arise, and
particularly a high resistance anomalous body will arise right 10
−200 −100 0 100 200
below the mountain. Thus to obtain an accurate geoelectric
Distance (m)
model, the impact from the topography must be taken into
account in the measured data processing. Figure 16: Mountain high-low resistance composite pattern.
Mathematical Problems in Engineering 9
1200
800
1000
Quadrature (ppm)
In-phase (ppm)
600 800
600
400
400
200
200
0 0
−200 −100 0 100 200 −200 −100 0 100 200
Distance (m) Distance (m)
100 0 3000
Depth (m)
20 448
40
Percent of first iteration RMS (%)
60 67
80 80
10
−200 −100 0 100 200
Distance (m)
60
Figure 20: Inversion result for high-low resistance composite pat-
tern (without taking into account the landform).
40
20
Acknowledgments
0
The authors thank the financial support of the Doctoral Fund
0 2 4 6 8 10 Project of the Ministry of Education (no. 20130061110060,
Iteration number class tutors), the National Natural Science Foundation of
Figure 18: RMS variation along with the times of iterations. China (no. 41504083), and National Basic Research Program
of China (973 Program) (no. 2013CB429805).
3000
References
−50
Depth (m)
International
Journal of Journal of
Mathematics and
Mathematical
Discrete Mathematics
Sciences