4.7 Article

A Fast Linear Algorithm for Magnetic Dipole Localization Using Total Magnetic Field Gradient

Journal

IEEE SENSORS JOURNAL
Volume 18, Issue 3, Pages 1032-1038

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSEN.2017.2781300

Keywords

Total field gradient; inverse problem; localization; linear algorithm; magnetic target

Ask authors/readers for more resources

Localization of magnetic target can be estimated through a magnetic anomaly. Generally, we need to solve the high-order nonlinear equations for estimating the position and magnetic moment of the target. Therefore, optimization algorithms are applied to calculate the solution of the nonlinear equations. In this paper, we present a fast linear algorithm for locating the target based on the total magnetic field gradient. In the algorithm, we give the closed-form formula of the static magnetic target localization. According to the properties of the vector, we can obtain a cubic equation of any 1-D position of the target. Thus, we can easily solve the cubic equation and obtain the closed-form formula of the target localization. Compared with the optimization algorithms, the proposed method provides good performance using short time and can be used to locate the target in real time. The proposed method is validated by the numerical simulation and real experimental data. The position and magnetic moment of the target are calculated rapidly. And the results show that the estimated parameters of the static target using the proposed method are very close to the true values.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available