4.7 Article

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

期刊

IEEE SENSORS JOURNAL
卷 18, 期 3, 页码 1032-1038

出版社

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

关键词

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据