1. Introduction
Ferromagnetic materials in the geomagnetic field are magnetized and generate an induced magnetic field, referred to as the magnetic anomaly. Ferromagnetic materials can be located by measuring the magnetic anomaly and processing the data accordingly. Magnetic target localization technology has significant practical applications in various fields. For instance, in underwater magnetic localization, it aids in mapping the undersea terrain and identifying buried magnetic objects [
1,
2]. It is also employed in detecting unexploded ordnance, where it helps identify and safely remove potential threats [
3,
4]. In medical interventions, this technology is applied in steering magnetic catheters and tracking wireless biomedical capsule [
5,
6]. The dominant approach adopted in magnetic target localization is the analytical method, which leverages the relationship between the magnetic field vector, the magnetic gradient tensor (MGT), and the tensor invariant to derive the localization formula. These formulas, which are straightforward and easy to solve, generally meet the requirements for real-time operation and accuracy across diverse application scenarios.
Magnetic target localization based on MGT has been extensively studied. The various localization methods can be divided into three categories: the single-point tensor positioning (SPTP), the two-point tensor positioning (TPTP), and the scalar triangulation and ranging (STAR). In the SPTP method, Wynn’s pioneering use of MGT for magnetic target detection showed the apparent advantages and potential of MGT [
7]. Following this, Frahm et al. [
8] enhanced the Wynn method by applying MGT in the point-by-point localization. Since then, numerous scholars and researchers have explored magnetic target localization to enhance the localization accuracy of the SPTP method. Nara et al. [
9] derived a closed-form linear equation for localizing a magnetic dipole. The magnetic target is located by multiplying the inverse matrix of MGT with the magnetic anomaly of the target. Yin et al. [
10] developed a MGT system approximating the first-order and second-order spatial gradients of magnetic field components with finite differences. Sui et al. [
11] constructed expressions for the second-order and third-order gradient tensors and proposed a method for extracting these tensors from a uniaxial magnetic field sensor. Wang et al. [
12] proposed a stability optimization algorithm based on the improved central difference method. These methods have less localization error. However, the high order quantity is significantly affected by the measurement noise and the geomagnetic field noise.
To address the issue that the SPTP method will be affected by the geomagnetic field noise, some researchers adopted the TPTP method. Xu et al. [
13] proposed a linear localization method based on the two-point magnetic gradient full tensor. However, this method requires the two observation points to be closely spaced to avoid errors. Liu et al. [
14] proposed a new TPTP method based on the magnetic moment constraints and used the PSO algorithm to optimize the penalty coefficient and localization error. However, due to the iterative calculations required by the PSO algorithm, the real-time performance of the localization method is compromised. Liu et al. [
15] established a two-point MGT localization model and derived the localization equations. Although localization can be obtained accurately by solving these equations, there are some localization dead zones.
Through the exploration of MGT, some researchers discovered that tensor invariant might provide novel localization ideas. Wiegert et al. [
16,
17,
18] proposed a new magnetic dipole localization method called STAR, which constructs equations based on spatial variations of the MGT invariant. This independence from the geomagnetic field is a significant advantage. However, the STAR method assumes that the tensor invariant is a perfect sphere, leading to asphericity errors in the localization. Wang et al. [
19] adopted an iterative algorithm to compensate for the asphericity errors of the STAR method and reduced the relative localization error. Though the methods previously discussed are effective, they necessitate the use of multiple gradiometers for measurements, which limits their widespread application.
The three methods, SPTP, TPTP, and STAR, have their own advantages and disadvantages. However, the majority of these methods involve the computation of the inverse matrix of MGT. If MGT is non-invertible, these localization methods will fail, leading to localization dead zones. To tackle this issue, some scholars have proposed localization methods with no dead zones. Nara et al. [
20] improved the localization method by using the Moore–Penrose generalized inverse matrix instead of the inverse matrix. However, the determination of the singularity of the matrix can be easily affected by measurement noise. Higuchi et al. [
21] adopted truncated singular value decomposition approach to propose a new localization equation. Yin et al. [
22] proposed a new close-form formula for magnetic dipole localization. However, these two methods are derived from the basis of the SPTP method and are not applicable to TPTP and STAR. Pei et al. [
23] adopted a regularization method to address the non-invertibility issue of MGT, but the localization error remains significant.
In summary, all three methods encounter dead zone issues due to the non-invertibility of MGT. To address this shortcoming, a localization method based on eigenvector constraints with the dead zone free is proposed. Additionally, this method is can be used to eliminate dead zones in other localization methods. A regularization term based on the eigenvector constraints is introduced into the objective function which is constructed with Euler’s equation. As the objective function gradient at the observation point is zero, the equivalent expression of the inverse MGT and the localization equation without a dead zone are derived. Through the algebraic operation, the localization equation will not fail at arbitrary points in space, thereby eliminating the localization dead zone. Simulation and experimental results demonstrate that the localization equation is more accurate and robust.
2. Localization Dead Zone Analysis
When the detection distance significantly surpasses the size of the magnetic target, it is feasible to simplify the magnetic target into a magnetic dipole model. The spatial Cartesian coordinate system is established to define the magnetic field and MGT, taking the magnetic target as the origin. A schematic diagram is depicted in
Figure 1. In this system, according to the Biot–Savart Law, the magnetic field at the observation point is given by:
where
represents the magnetic field intensity,
represents the vacuum permeability,
represents the magnetic moment of the magnetic target, and
is the position vector extending from the magnetic target to the observation point. The unit vector of
is represented by
, and
signifies the length of
.
Assume that the magnetic field at the adjacent observation point,
, is
. The magnetic field difference between these two positions is:
Alternatively, the magnetic field intensity difference between the two points can also be given as:
where
denotes MGT. Considering both Equations (
2) and (
3), the localization formula based on MGT can be expressed as:
This formula is the localization formula of the Nara method. It shows that if MGT and the magnetic field are known, the position can be determined. This formula is straightforward and involves only the inversion and multiplication of third-order matrices. However, it should be noted that MGT is not always invertible, and the method have a localization dead zone. To fully understand the applicability of the algorithm, the analytical expression of the MGT matrix is given by:
where
is the Kronecker delta and
i,
j represent
x,
y, and
z in the spatial Cartesian coordinate system.
To simplify the computation, the Cartesian coordinate system is redefined, which is shown in the
Figure 2.
In this spatial Cartesian coordinate system, the magnetic target becomes the origin. The
x-axis aligns with the direction of the position vector, and the magnetic moment vector lies in the
x-
y plane.
represents the angle between the position vector and the magnetic moment vector. The position vector is expressed as
, and the magnetic moment vector as
. The MGT at the observation point is then expressed as:
When
equals
, the matrix
G becomes non-invertible, causing the localization method to fail. In space, all points satisfying
will form a plane, representing the theoretical dead zone of the localization algorithm. Moreover, points near the dead zone may also cause the determinant of MGT to approach zero due to calculational precision and processor capabilities, thereby expanding the dead zone. To address this issue, it becomes necessary to identify a formula independent of the computation’s angle. The relationship between the eigenvalues and the eigenvectors is used to propose the method for eliminating dead zone, which is detailed in the next section. The expressions of the eigenvalues and the eigenvectors are given by:
where
(
) denote the eigenvalues of
G, and
(
) represent the corresponding eigenvectors. It is important to note that the three eigenvalues satisfy the relationship
. Furthermore, in terms of absolute values,
and
. With these established relationships,
can be determined by sorting the eigenvalues and calculate the corresponding eigenvector
. It is worth mentioning that
satisfies the equation:
It is worth noting that while Equation (
9) was derived in the coordinate system presented in
Figure 2, it remains valid in any coordinate system. The tensor is a quantity that remains invariant with respect to changes in the coordinate system. Once the magnetic moment intensity and direction of the magnetic target and the relative position of the observation point to the magnetic target are determined, MGT is a fixed value. This can also be verified from Equation (
6). Therefore, to simplify the calculation process, the spatial Cartesian coordinate system shown in
Figure 2 is chosen. This coordinate system has three characteristics: firstly, it takes the magnetic target as the origin; secondly, the observation point is in the positive direction of the
x-axis; and thirdly, the magnetic moment vector lies within the
x–
y plane. In this system, the expression for the second eigenvector of MGT can be conveniently derived, further proving that this eigenvector is orthogonal to the plane formed by the position vector and the magnetic moment vector. This conclusion is universally true and remains invariant regardless of changes in the coordinate system.
3. Eigenvector-Constrained Method for Dead Zone Elimination
Based on the analysis of the preceding section, the Nara method is straightforward for magnetic target localization. However, when the position vector and the magnetic moment vector are orthogonal, the analytical solution is unstable, leading to a localization dead zone algorithmically. Therefore, the Tikhonov regularization technique is employed to address the issues of unstable solutions in this paper. The objective function can be constructed as follows:
In the system shown in
Figure 2, the Hessian matrix, denoted as
H, of
f is:
The eigenvalues of matrix
H can be computed as:
Through algebraic operations, it show that the eigenvalue is non-negative, and the remaining two eigenvalues are positive. Hence, the Hessian matrix is positive semidefinite, indicating that the objective function is convex.
, denoting the position vector, satisfies Equations (
2) and (
3). Thus, the value of the objective function
f is zero. Otherwise, the value of
f exceeds zero. As such, the objective function reaches the unique global minimum solely at the observation point, where the gradient is zero. This conclusion implies that the position vector satisfies the following relationship:
This relationship derives the formula for the position vector:
However,
G becomes singular when the position vector and the magnetic moment vector are orthogonal. Consequently, the solution of Equation (
14) is unstable. The issue that the matrix singularity leads to the unstable solution has been addressed in numerous previous studies, which have demonstrated that introducing a Tikhonov regularization term to the objective function can stabilize the solution [
24]. Based on Equation (
9), the new objective function is constructed as follows:
where
is the penalty coefficient used to adjust the intensity of the regularization term. This objective function will still reach a unique global minimum at the location of the magnetic target; thereby, the formula of the position vector is yielded:
To guarantee a stable solution for Equation (
16), it is crucial to validate whether the term
is singular. In the system in
Figure 2, the determinant of the term
is given by:
Clearly, if
is positive, the determinant of
remains positive, ensuring the stable solution for Equation (
16). This proposed method effectively eliminates the localization dead zone in magnetic target localization based on MGT.
Furthermore, as the approaches 0, the expression can be effectively represented as the expression . Specifically, both expression and expression are third-order matrices. They only differ in the ninth element, which are and , respectively. Therefore, when is sufficiently small, can be used in place of for calculations, effectively eliminating the dead zone in the magnetic target localization without affecting localization accuracy.
As regards selecting the penalty coefficient, the L-curve method a commonly used method in Tikhonov regularization. This method graphically determines the optimal penalty coefficient by plotting the trade-off between the solution norm and the residual norm . As the penalty coefficient changes, the regularized solutions are computed, and the norms are plotted, forming an L-shaped curve. The corner of this curve signifies a balance between data misfit and solution complexity, representing the optimal penalty coefficient. This approach efficiently finds the optimal penalty coefficient.
4. Numerical Simulations
4.1. Magnetic Target Localization Dead Zone
To verify that the condition for the formation of the localization dead zone is the orthogonality between the position vector and the magnetic moment vector, simulations were conducted on the widely-used Nara method [
9]. In these simulations, a magnetic dipole was situated at the origin of a spatial Cartesian coordinate system. In this system, the magnetic moment vector of the dipole was defined as
Am
. The localization results were tested at multiple observation points within a rectangular region situated 3 m above the origin. The coordinates of the four vertices of this rectangle are (−5, −5, 3) m, (−5, 5, 3) m, (5, −5, 3) m, and (5, 5, 3) m. The intervals between observation points in both the
x and
y directions are 0.02 m. According to Equation (
4), to achieve magnetic target localization, it is necessary to measure the magnetic field intensity and MGT. Therefore, the magnetic sensor array structure shown in
Figure 3 was employed to measure these two quantities.
In this array, each dark square represents a three-axis magnetic sensor, which measures the magnetic field component at its position. The formulas for the magnetic field intensity and the MGT are given by:
The total localization error, denoted as
, is used to reflect the localization performance at each point. The formula for the total localization error is as follows:
where
denotes the localization error in
x-axis,
denotes the localization error in
y-axis,
denotes the localization error in
z-axis,
Figure 4 illustrates the distribution of the total localization error across the simulation region. The maximum observed localization error is substantial, reaching up to 11,284.5 m. To emphasize the characteristics of the error distribution, all error results are transformed using a base-10 logarithm. In the figure, most of the region is shaded in blue, which signifies that the localization error in these areas is less than 1 m. A prominent line is visible in the image, representing locations with a significantly larger localization error. This highlights limitations in the Nara method, suggesting that it may not provide reliable results at these specific points.
All observation points with a localization error greater than 2 m were extracted. Subsequently, the angles between the magnetic moment vectors and position vectors at these points were computed. A histogram was then created for these angles, followed by a normal distribution fitting, with the results displayed in the
Figure 5.
Through an integrated analysis of observation points within the dead zone, angles corresponding to the position vectors and the magnetic moment vectors were computed. A statistical representation of these angles was visualized using a histogram, which was subsequently fitted with a normal distribution curve in red. When the number of bins is set to 9, the fit to the normal distribution is improved. At this setting, the mean of the normal distribution is , with a standard deviation of . This result illustrates the orthogonality relationship between the position vectors and the magnetic moment vectors within the dead zone. It provides compelling evidence that the formation of the localization dead zone is attributed to this orthogonal relationship.
4.2. Optimization of the Penalty Coefficient
The penalty coefficient plays a pivotal role in regularized solutions by balancing the trade-off between the fit to the data and the complexity of the solution. Its value determines the extent to which the regularization term influences the solution. The L-curve method is a common graphical tool utilized to identify the optimal penalty coefficient. By plotting the solution norm against the residuals norm, an L-shaped curve emerges. The corner of this curve typically signifies the optimal penalty coefficient, striking a balance between solution smoothness and data fidelity.
To determine the optimal penalty coefficient for the proposed method, all observation points within the simulation plane from the previous chapter were utilized. Based on preliminary analysis, the range for the penalty coefficient was set between
and 10 with 100 logarithmically spaced values. Each value was then incorporated into the proposed method, localizing all observation points, and the average solution norm
and the average residual norm
were computed. Ultimately, plotting the average solution norm against the average residual norm for these varying coefficients yielded
Figure 6.
From the
Figure 6, it is evident that the curve exhibits a distinct L-shape. Moreover, the elbow of the L-curve is positioned where the residual norm
is about
and the solution norm
is about
. At this point, a balance between the solution norm and the residual norm is achieved. Hence, the optimal penalty coefficient is 0.2154.
4.3. Proposed Magnetic Target Localization Method
To validate the proposed localization method, a series of numerical simulations were conducted. The magnetic dipole was positioned at the origin of a spatial Cartesian coordinate system, with its magnetic moment vector set to Am within this system. Observation points, arranged with a grid spacing of 0.02 m, were situated on a 10 m × 10 m plane elevated at a height of 3 m. To assess the robustness, the Gaussian noise was introduced into the two measurements of the magnetic field vector and the MGT. To analyze the effectiveness and robustness of the proposed method, the Nara method and the Pei method were chosen for comparison. the Nara method is currently the widely adopted method, while the Pei method addresses the dead zone issue using the Tikhonov regularization technique.
Figure 7 illustrates the distribution of localization errors for the three methods under different geomagnetic field noise levels.
Table 1 displays the mean and standard deviation of localization errors for the three methods under different geomagnetic field noise levels. Due to the presence of localization dead zones, the Nara method exhibits instances of very large localization errors. For ease of comparison, data with a localization error exceeding 1 m is not displayed and is excluded from statistical analysis.
While the Nara method has apparent localization dead zones, statistical data indicate that its localization error within normal regions is relatively small. The Pei method effectively eliminates localization error, but its error diverges at a faster rate as distance increases, leading to larger mean and standard deviation values for the localization error. The proposed method not only effectively eradicates localization dead zones but also exhibits a slower divergence rate of localization error with increasing distance. Under a geomagnetic field noise with a standard deviation of 1 nT, the localization error at the farthest point does not exceed 0.25 m.
From the perspective of robustness, under the noise levels of 0.1 nT and 0.01 nT, the distribution of localization error for the proposed method remains consistent. This indicates that the localization error at this point mainly stems from the localization method itself. At a noise level of 1 nT, the localization error is predominantly influenced by geomagnetic noise interference. Nevertheless, the localization error is still lower than that of the other two methods.
Figure 8 displays the distribution of localization errors for the three methods under varying levels of magnetic gradient noises.
Table 2 presents the corresponding mean and standard deviation of the localization error. Both
Figure 8 and
Table 2 similarly confirm that the proposed method not only effectively eliminates localization dead zones but also possesses stronger robustness. However, it is distinct that magnetic gradient noise of the same intensity has a greater impact on localization than magnetic field noise. Under 0.01 nT and 0.1 nT noise levels, this observation is not as pronounced because the localization error induced by the noise is lesser than the inherent error of the localization method itself. At 1 nT magnetic field noise, both the mean and standard deviation of the localization error are noticeably lower than those under 1 nT magnetic gradient noise. This underscores that the proposed localization method is more sensitive to magnetic gradient noise. Nonetheless, the localization performance of the proposed method still outperforms the other two methods.
6. Conclusions
Magnetic target localization, a critical task with implications across various fields, relies heavily on MGT-based methods. However, this paper reveals a significant limitation of magnetic target localization, specifically its failure in the region where the position vector and the magnetic target’s magnetic moment vector are orthogonal, resulting in a singular MGT and an unstable solution. To address this issue, a eigenvector constraint-based magnetic target localization method is proposed. This method circumvents the singularity of MGT by introducing the regularization term, which is constrained by the eigenvector into the objective function for localization. The localization formula is derived from this objective function based on the property that the gradient of the objective function at the observation point is zero. This novel method ensures that the matrix’s determinant consistently exceeds zero, thereby eliminating the localization dead zone. The proposed method’s robustness is demonstrated through simulations and experiments. The Nara method and the Pei method are chosen for comparison. The Nara method is a widely adopted localization technique, yet it has localization dead zones. The Pei method effectively eliminates these dead zones. Simulations and experiments both confirm that the proposed method not only effectively removes localization dead zones but also exhibits higher localization accuracy and robustness than the Pei method, making it more suitable for practical applications. While the proposed method still inherits the limitations of the SPTP approach and is not suitable for areas with dramatic magnetic field variations, it provides a more reliable magnetic target localization technique for regions with relatively stable magnetic fields, such as underwater environments.