By Topic

Application of the theory of optimal experiments to adaptive electromagnetic-induction sensing of buried targets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xuejun Liao ; Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA ; L. Carin

A mobile electromagnetic-induction (EM I) sensor is considered for detection and characterization of buried conducting and/or ferrous targets. The sensor maybe placed on a robot and, here, we consider design of an optimal adaptive-search strategy. A frequency-dependent magnetic-dipole model is used to characterize the target at EMI frequencies. The goal of the search is accurate characterization of the dipole-model parameters, denoted by the vector Θ; the target position and orientation are a subset of Θ. The sensor position and operating frequency are denoted by the parameter vector p and a measurement is represented by the pair (p, O), where O denotes the observed data. The parameters p are fixed for a given measurement, but, in the context of a sequence of measurements p may be changed adaptively. In a locally optimal sequence of measurements, we desire the optimal sensor parameters, pN+1 for estimation of Θ, based on the previous measurements (pn, On)n=1,N. The search strategy is based on the theory of optimal experiments, as discussed in detail and demonstrated via several numerical examples.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:26 ,  Issue: 8 )