Inverse scattering of two-dimensional dielectric objects buried in a lossy earth using the distorted Born iterative method

An efficient inverse-scattering algorithm is developed to reconstruct both the permittivity and conductivity profiles of two-dimensional (2D) dielectric objects buried in a lossy earth using the distorted Born iterative method (DBIM). In this algorithm, the measurement data are collected on (or over...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on geoscience and remote sensing 2001-02, Vol.39 (2), p.339-346
Main Authors: Tie Jun Cui, Weng Cho Chew, Aydiner, A.A., Siyuan Chen
Format: Article
Language:English
Subjects:
Algorithms
Applied geophysics
Character generation
Conductivity
Dielectric losses
Dielectrics
Distortion
Distortion measurement
Earth
Earth sciences
Earth, ocean, space
Exact sciences and technology
Internal geophysics
Inverse problems
Iterative algorithms
Iterative methods
Mathematical models
Permittivity
Pixels
Predistortion
Two dimensional
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An efficient inverse-scattering algorithm is developed to reconstruct both the permittivity and conductivity profiles of two-dimensional (2D) dielectric objects buried in a lossy earth using the distorted Born iterative method (DBIM). In this algorithm, the measurement data are collected on (or over) the air-earth interface for multiple transmitter and receiver locations at single frequency. The nonlinearity due to the multiple scattering of pixels to pixels, and pixels to the air-earth interface has been taken into account in the iterative minimization scheme. At each iteration, a conjugate gradient (CG) method is chosen to solve the linearized problem, which takes the calling number of the forward solver to a minimum. To reduce the CPU time, the forward solver for buried dielectric objects is implemented by the CG method and fast Fourier transform (FFT). Numerous numerical examples are given to show the convergence, stability, and error tolerance of the algorithm.
ISSN:0196-2892
1558-0644
DOI:10.1109/36.905242