Three-Dimensional Multi-Target Tracking Using Dual-Orthogonal Baseline Interferometric Radar

Multi-target tracking (MTT) generally needs either a Doppler radar network with spatially separated receivers or a single radar equipped with costly phased array antennas. However, Doppler radar networks have high computational complexity, attributed to the multiple receivers in the network. Moreover, array signal processing techniques for phased array radar also increase the computational burden on the processing unit. To resolve this issue, this paper investigates the problem of the detection and tracking of multiple targets in a three-dimensional (3D) Cartesian space based on range and 3D velocity measurements extracted from dual-orthogonal baseline interferometric radar. The contribution of this paper is twofold. First, a nonlinear 3D velocity measurement function, defining the relationship between the state of the target and 3D velocity measurements, is derived. Based on this measurement function, the design of the proposed algorithm includes the global nearest neighbor (GNN) technique for data association, an interacting multiple model estimator with a square-root cubature Kalman filter (IMM-SCKF) for state estimation, and a rule-based M/N logic for track management. Second, Monte Carlo simulation results for different multi-target scenarios are presented to demonstrate the performance of the algorithm in terms of track accuracy, computational complexity, and IMM mean model probabilities.


Introduction
Multi-target tracking (MTT) has received increased attention in real-time systems with a broad spectrum of applications, including aircraft tracking [1], surveillance [2], remote sensing [3,4], adaptive cruise control [5], robotics [6], biomedical engineering [7], image processing [8], and oceanography [9]. The main purpose of MTT algorithms is to identify the number of potential targets in the radar's field of view (FOV) and to estimate their kinematic states from noisy radar measurements. Various algorithms to address the problem of MTT have been proposed in the literature [10][11][12]. MTT systems generally need either a Doppler radar network with spatially separated receivers or a single radar equipped with costly phased array antennas. The Doppler radar has the capability of determining the Doppler frequency shift of the target in the radar's FoV, which is directly related to its radial velocity [13][14][15][16]. However, Doppler radar can provide the information of range and Doppler frequency shift only. Since it is not capable of extracting the directionof-arrival (DOA), i.e., azimuth and elevation angles, information of the target, it is not possible to localize the target in the 3D Cartesian space using the range-Doppler data from single Doppler radar receiver only [17]. To resolve this issue, a distributed Doppler radar network with multiple sensors is typically employed, which can monitor the potential target of interest from different angles spatially. Various algorithms for MTT based on Doppler radar networks exist in the literature. Multistatic radar networks have become very popular in various real-time tracking applications over time [18][19][20]. An algorithm for target tracking, by monitoring the Doppler signals at multiple spatial points employing a network of four Doppler radars, was presented in [20]. The MTT algorithm using Doppler measurements from multistatic Doppler radar with an unknown probability of detection was proposed in [21]. A technique for tracking multiple targets by exploiting the range and Doppler information from multiple radar sensors was introduced in [22]. This technique, however, demands a multitude of iterations, which may cause the system to halt and generate latency. The MTT techniques presented in [17,23] are also based on multilateration of range-Doppler data from at least three radar sensors for localizing and tracking the targets without ambiguity. Multistatic radar systems for MTT by utilizing bistatic range and range-rate information from multiple radars were described in [24,25], which send data to a central station for estimating the spatial locations and velocities of the targets in the FoV. However, the integrated hardware due to multiple radar sensors in the network requires a high data transfer rate, making it difficult to realize real-time applications. The detection and tracking system using a single radar sensor demands a phased array antenna. However, a small-scale array of antennae offers poor angular resolution. Therefore, a costly large phased array is needed to provide angular information with better resolution. Furthermore, advanced array signal processing techniques such as the ESPRIT and MUSIC algorithms essentially increase the computational burden on the data processing unit caused by the complex matrix operations [26,27]. Furthermore, the MTT algorithm using a phased array antenna requires the number of receiving elements to be greater than the number of targets in the sensor's FoV. To resolve this issue, in our previous work [28,29], we presented an algorithm for multiple targets' detection and tracking in the 2D Cartesian space by measuring their range and 2D velocity (radial velocity and angular velocity) measurements using a dual-frequency frequency-modulated continuous wave (DF-FMCW) interferometric radar. Now, we propose to extend this concept to MTT in the 3D Cartesian space based on 3D velocity (radial velocity, azimuth angular velocity, and elevation angular velocity) measurements using a dual-orthogonal baseline DF-FMCW interferometric radar. The geometry of the dual-orthogonal baseline interferometric radar with a point source as the target is represented in Figure 1. The reference receiving antenna Rx1 is used to extract the initial ranges and radial velocities of the targets, and two orthogonal baselines with lengths D 12 and D 13 are used to measure the azimuth angular velocities and elevation angular velocities, respectively, of the targets in the radar's FOV. θ and ϕ represent the azimuth and elevation angles of the target with the y-axis and xy-plane, respectively. ρ is the range of the target relative to the observing radar in the 3D Cartesian space. The contribution of this paper is twofold: Figure 1. Geometry of the dual-orthogonal baseline interferometric radar with a point source in the 3D Cartesian space.

1.
First, we present a mathematical model of the 3D velocity of multiple moving point sources and derive the nonlinear 3D velocity measurement function, which defines the relationship between the state of the target in terms of the 3D Cartesian space and the 3D velocity measurements extracted from the interferometric radar. Based on this measurement function, the design and implementation of the tracking algorithm are presented, which include (i) the GNN technique combined with the auction algorithm for data association, (ii) the IMM-SCKF estimator for state estimation, and (iii) the rule-based M/N logic for track management.

2.
Second, Monte Carlo simulation results with different multiple target scenarios are presented to validate the performance of the proposed algorithm in terms of track accuracy, computational complexity, and IMM mean model probabilities.
The layout of this paper is as follows. The mathematical formulation of the proposed MTT algorithm is presented in Section 2. Section 3 introduces the detailed design of the proposed MTT algorithm. The three main stages of the MTT algorithm including the GNN for data association, the IMM-SCKF estimator for state estimation, and the rule-based M/N logic for track management are described in Sections 4-7. Section 8 presents the performance evaluation simulations. Finally, Section 9 provides the concluding remarks.

Mathematical Formulation of the Problem
The linear velocity of an arbitrary moving point source is a vector quantity. To completely localize a moving target in the 3D Cartesian space, it is necessary to measure the instantaneous 3D velocity vector v i of the target, which is composed of radial velocity v r 3D , azimuth cross-radial velocity v cr θ , and elevation cross-radial velocity, i.e., v cr ϕ , v i = v r 3D , v cr θ , v cr ϕ . The relationship between angular velocity and cross-radial velocity is defined as ω = v cr /ρ.

The 3D Velocity of Point Sources
Assume an FMCW radar signal with carrier frequency f c , bandwidth B, and sweep time T. The transmitted signal can be written as where t s = t − nT represents the time at the start of the nth sweep period and K = B/T is the chirp rate. For an object initially present at a range of ρ 0 and moving with radial velocity v r 3D relative to the radar in the 3D Cartesian space, the signal reflected off of the object is the same as the transmitted signal, but delayed with a round trip time τ 3D . Therefore, the received signal at antenna Rx1 for the FMCW radar can be written as where τ 3D = 2ρ(t)/c. The velocity of the object is considered to be slow enough that, during each pulse repetition interval, the object is generally expected to reside in the same range bin. Hence, the relative range of the target can be defined as According to the FMCW radar operating principle, the transmitted and received signals are mixed to obtain the beat frequency signal, which can be expressed as In the case of M number of point sources moving in the radar's FOV, the beat frequency signal S B 1 (t) can be expressed as where τ m 3D = 2ρ m /c for m = 1, 2, · · · , M. The relative radial motion of the object induces a Doppler frequency shift in the radar's received signal. The radial velocity in terms of the Doppler frequency shift can be defined as The first baseline, constituting the receiving antennas Rx1 and Rx2 along the xaxis, is used to measure the azimuth angular velocity of the targets in the radar's FOV. Considering the signal received by antenna Rx1 as the reference, the signal received by antenna Rx2, placed at a geometrical distance of D 12 , can be represented as where τ 0 θ = D 12 sin θ/c. The second beat frequency signal S B 2 (t) at receiving antenna Rx2 can be written as Following the interferometric radar principle, the beat frequency signals S B 1 (t) and S B 2 at the two receiving antennas are correlated to generate the interferometric output [30]: In the case of M number of moving point sources, the interferometric output y c 1 (t) represented by Equation (9) can be re-written as As can be seen from Equation (10), the interferometric output is composed of two parts. The first part consists of M intra-correlation terms, generated by the angular velocities of moving objects, whereas the second part consists of M(M − 1) nuisance inter-correlation terms in which the radial and angular velocities of different moving objects are coupled together. In order to extract the angular velocities of the objects, these intermodulation terms need to be suppressed. Once these intermodulation terms are suppressed, azimuth angular velocity ω θ in terms of azimuth interferometric frequency shift f θ is defined as The second orthogonal baseline, constituting the receiving antennas Rx1 and Rx3 along the z-axis separated by geometrical distance D 13 , is used to measure the elevation angular velocity of the targets in the radar's FOV. Now, considering the signal received by the first receiving antenna Rx1 as the reference, the signal received by receiving antenna Rx3 can be written as where time delay τ 0 ϕ = D 13 sin ϕ/c. The transmitted and received signals represented by Equations (1) and (12), respectively, are mixed to generate the beat frequency signal. That is, The interferometric output, y c 2 (t), of the second baseline along the z-axis is In the case of M number of point sources moving in the radar's FOV, the interferometric output y c 2 (t) takes the following form.
Similar to the case of azimuth angular velocity measurement, the interferometric output y c 2 (t) also consists of two parts, including M intra-correlation terms and M(M − 1) inter-correlation terms. The inter-correlation terms interfere with the extraction of the elevation angular velocities of the objects. The elevation angular velocity ω ϕ , in terms of elevation interferometric frequency shift f ϕ , is defined as

Process Model
The process model describes the state transition between two consecutive time instants. Consider modeling the motion of the target by one of the i hypothesis models. These models can be represented by a set as M r := {1, 2, · · · , r}. M j k−1 represents the event of model j being effective during time period (t k−1 , t k ]. In this case, the target dynamic/motion for the jth hypothesis model can be described as (17) where F j k−1 represents the state transition matrix for motion model j being effective at time k − 1, x k represents the target's state vector at time k, and v j k−1 represents the process noise for the jth dynamic model, which is assumed to be independent and identically distributed The target motion in the 3D Cartesian space is modeled with the nearly constant velocity (NCV) and nearly coordinated turn (NCT) process models. For uniform motion, the discretetime NCV state dynamics combined with the DWNA model are represented by The state vector of the target with n x = 6 is defined as where x k , y k , z k and v x k , v y k , v z k denote the Cartesian coordinates and velocities of the object, respectively, at time instant k. n x represents the state vector dimension. The state transition matrix F NCV for the NCV model is The noise gain Γ 1 can be written as The covariance of the process noise multiplied by gain Γ 1 is where σ 2 v 1 represents the variance of process noise v 1 . Here, v 1 is a zero-mean Gaussian white noise used to model small accelerations, with an appropriate covariance Q 1 k−1 , which is a design parameter. For modeling the target maneuver, the discrete-time NCT state dynamics combined with the DWNA model in the 3D Cartesian coordinate system are represented by The state vector of the target augmented by turn rate Ω, i.e., n x = 7, is defined as The state transition matrix F NCT for the NCT model is The noise gain Γ 2 for the DWNA model is defined as The covariance of the process noise multiplied by gain Γ 2 is where σ 2 v 2 represents the variance of process noise v 2 .

Nonlinear Measurement Model
The nonlinear measurement model defining the relationship between the 3D velocity measurements received from the interferometric radar and the state of the target is defined as where h(x k ) is the nonlinear 3D velocity measurement function and Here, n z denotes the dimension of the measurement vector. w k is assumed to be an i.i.d. zero-mean Gaussian measurement noise with covariance R k , i.e., w k ∼ N (0, R k ) and E{v k w T k } = 0.

Derivation of 3D Velocity Measurement Function
The range of the target relative to the observing radar in the 3D Cartesian space is expressed as By taking the time derivative of Equation (29), the radial velocity of the target in the 3D Cartesian space can be determined. That is, As we know that v r 3D,k =ρ k , v x k =ẋ k , v y k =ẏ k , and v z k =ż k , the expression for the radial velocity can be written as According to [29], the azimuth angular velocity is determined by The elevation angle ϕ k relative to the observing radar is defined as Now, by re-arranging and taking the time derivative of Equation (33), where ω ϕ k =φ k . Since we know that Equation (35) can be re-written as Proceeding from Equations (31), (32) and (38), the nonlinear 3D velocity measurement function can be defined as Hence, the nonlinear measurement model defined by Equation (28) takes on the following form.
The objective of the proposed MTT algorithm is to estimate the statex k|k = E{x k |z k } and error covariance |z k } of each target in the radar's FOV by exploiting the derived 3D velocity measurement function.

Design of the Proposed 3D MTT Algorithm
The detailed design of the proposed MTT algorithm based on 3D velocity measurements is delineated in Figure 2. The dual-orthogonal baseline DF-FMCW interferometric radar used to measure the 3D velocities of multiple moving objects has the capability to transmit FMCW signals with two different carrier frequencies, such that f c 1 = 6 GHz and f c 2 = 24 GHz. It consists of one transmitting antenna Tx and three receiving antennas Rx1, Rx2, and Rx3. The transmitting antenna Tx and receiving antenna Rx1 can switch between two operating frequencies f c 1 and f c 2 via RF switches, depending on the mode of operation. Based on the carrier frequency f c 1 , the lengths of the two orthogonal baselines were set as D 12 = D 13 = 60λ c 1 = 3 m. The detection and extraction of radial velocity measurements were performed at a higher carrier frequency f c 2 , whereas the azimuth and elevation angular velocity measurements were obtained at a lower carrier frequency f c 1 , thereby suppressing the intermodulation terms in the interferometric response. The interferometric frequencies' information was preserved by increasing the baseline lengths D 12 and D 13 simultaneously [28]. First of all, the radar observes the region of interest (ROI) operating at carrier frequency f c 2 and performs 2D-FFT on the received data for the detection of the potential targets by obtaining the range-radial velocity map. Once the targets are identified, STFT is applied to the received data, which provides the time-varying Doppler spectrogram of the targets in the FOV. Following Equation (6), the radial velocities of the targets are extracted from the Doppler spectrogram [29]. Then, for the azimuth and elevation angular velocity measurements at carrier frequency f c 1 , STFT is performed on the two interferometric outputs y c 1 (t) and y c 2 (t), respectively. The time-varying azimuth and elevation interferometric spectrograms thus obtained are used to calculate the azimuth and elevation angular velocities of the targets following Equations (11) and (16), respectively. In order to combine the 3D velocity measurements of each object, 2D FFT is performed on the three beat frequency signals at antennas Rx1, Rx2, and Rx3 in the interferometric mode corresponding to the carrier frequency f c 1 . The following relationships hold true in the interferometric mode.
where ρ 1 , ρ 2 , and ρ 3 represent the ranges of the object relative to antennas Rx1, Rx2, and Rx3, respectively. By taking the time derivative of Equations (41) and (42), the relationship between the radial and angular velocities of the object can be written as where v r 3D,1 , v r 3D,2 , and v r 3D,2 represent the radial velocity of the object at antennas Rx1, Rx2, and Rx3, respectively. The initial range measurements obtained by performing 2D FFT on the beat frequency signals are used to calculate the initial azimuth and elevation angles of the objects following Equations (41) and (42). Then, based on Equations (43) and (44), the initial values of the radial velocities along with the azimuth and elevation angle measurements are used to combine the 3D velocities of each target distinctly. Measurement-to-track data association and target state estimation are the two fundamental elements of the MTT algorithm. Moreover, the track management is also a crucial element of the MTT algorithm, which maintains the two major data structures, namely tentative and confirmed track lists. The track management unit handles the initiation of new target tracks, the confirmation of tentative tracks, and the deletion of tentative and confirmed tracks based on some predefined criteria. After the formation of the tentative and confirmed track lists from previous scans of the data, the new 3D velocity measurements received from the interferometric radar are assessed for association with existing target tracks or for initializing new tentative tracks. Based on the 3D velocity measurement function defined by Equation (39), the global nearest neighbor (GNN) method combined with the auction algorithm is used for measurement-to-track data association. The unassociated measurements are then tested for association with already existing tentative tracks. The measurements still unassociated with any existing tracks are then used to initiate new tracks. The 3D velocity measurements associated with the existing tracks are utilized in the filter measurement update step for the target's state estimation. Since Equation (39) clearly demonstrates the nonlinear relation between the state of the target and the radar measurements, the proposed MTT algorithm utilizes the nonlinear IMM-SCKF estimator. Based on the 3D velocity measurement function, IMM-SCKF estimator is used to estimate the states of non-maneuvering and maneuvering targets. Different blocks of the MTT algorithm are thoroughly discussed in the following sections for better understanding of the algorithm.

Global Nearest Neighbor Data Association Method
Various data association techniques exist in the literature for the MTT algorithms, which include the NN, GNN, JPDA, and MHT algorithms. However, the GNN is the most commonly used optimal and robust technique for practical tracking systems. The GNN algorithm propagates a single global hypothesis and addresses the measurement-to-track association in the form of an optimal assignment problem [29,31,32]. Based on the 3D velocity measurement function expressed by Equation (39), the data association process follows three steps:
Auction algorithm for the optimal solution of the assignment matrix.
Gating is a technique for eliminating unlikely observation-to-track pairings. For a measurement to satisfy the ellipsoid gating relationship of a track, the norm of the measurement residual vector d 2 k must fulfill the following criterion: whereṽ is the measurement residual vector, S Z,k is the measurement residual covariance matrix at time instant k, and G represents the gate size. Based on the 3D velocity measurement function, the measurement residual vector can be expressed as Generally, d 2 is assumed to have a chi distribution (χ 2 n z ) for correct measurement-totrack association, where n z represents the dimension of the measurement vector. The rela-tionship between the gate size G and the probability of the 3D measurement vector falling inside the gate P G (n z ) is expressed as [11] where gc denotes standard Gaussian probability integral. Following the ellipsoid gating, the GNN algorithm is used to resolve measurement-to-track association conflicts by forming and solving a 2D assignment matrix [11]. For the formation of the assignment matrix, the rows are occupied by 3D velocity measurements, and the first columns of the assignment matrix are filled with the existing tracks. The rest of the columns are filled with new track hypotheses. The entries of the assignment matrix are expressed in the form of the score gain. That is, where α ij represents the margin by which the statistical distance passed the gate. The entries corresponding to the assignment of a measurement to a new track were set as zero.
The non-allowed measurements are represented by −∞. The optimal solution is the set of assignments that produces the maximum score gain [11]. In the literature, various algorithms exist to solve the assignment problem, such as the Hungarian algorithm, the Munkres algorithm [33], the Jonker-Volgenant-Castanon (JVC) algorithm, and the auction algorithm [11]. However, the auction algorithm is presently the most efficient algorithm for the assignment problem, which has replaced the Munkres algorithm [12]. Therefore, in the current work, the GNN method with the auction algorithm was used for measurementto-track data association.

IMM-SCKF Estimator for State Estimation
The main function of the estimation filter in the MTT algorithm is to estimate the state of the targets detected from noise-corrupted radar measurements [34]. The measurements allocated to the tracks present in the tentative or confirmed track lists during the data association step are utilized in the measurement update stage of the filtering procedure [24]. Referring to Equation (39), it is clear that there exists nonlinear relation between the 3D velocity measurements received from the interferometric radar and the state of the target. Therefore, a nonlinear filter is required for estimating the state of the target [31,32,35].

Square-Root Cubature Kalman Filter
Based on the properties of symmetry and positive semi-definiteness, the nonlinear SCKF is used for target state estimation. It is numerically more accurate, stable, and computationally efficient compared to the extended Kalman filter (EKF) [36], unscented Kalman filter (UKF) [37], and CKF [38]. The SCKF algorithm is outlined below [39];

Time Update
Starting at time instant k, assume that the posterior density with the square-root of error covariance matrix is given.
where P k−1|k−1 denotes the error covariance matrix, S k−1|k−1 is the square-root of the error covariance matrix P k−1|k−1 , and Z k−1 1 represents the set of measurements from the start to time instant k − 1: 1.
where S R,k is the square-root of measurement noise covariance R k−1 and J k|k−1 is the weighted-centered matrix.
Compute the updated state estimate. 8.
Calculate the square-root estimated error covariance.

Interacting Multiple Model Estimator
Since the moving target does not necessarily follow a single dynamic model, modern tracking systems typically use the IMM filter [40] for maneuvering target tracking [29]. If the target dynamics are characterized by multiple switching models (r > 1), the posterior density of the target state vector is a mixture density [11,12,25,31]. The objective of the IMM filter is to combine all the mixture components into a single Gaussian distribution in a manner that the first and second moments are matched [24,25,29]. At the current time instant k, the IMM algorithm begins with r model-conditioned state estimatesx i k−1|k−1 , square-root error covariance matrix S i k−1|k−1 , and model probabilities µ i k−1|k−1 at instant k − 1 [24]. Upon receiving the current measurement z k , the IMM algorithm follows the steps outlined below [29,31,41]:

1.
Computing mixing probabilities: where µ (i,j) k−1|k−1 represents the model probability that model M i was effective at time instant k − 1 provided that M j is effective at time instant k conditioned on Z k−1 1 . Here, Z k−1 1 represents the measurement history from start to instant k − 1. p ij denotes the elements of model transition probabilities matrix, µ i k−1|k−1 is the model probability for ith SCKF, and µ (i,j) k−1|k−1 is mixture probability for i, j = 1, · · · , r.

2.
Interaction/mixing of state estimates: Computing the model likelihood: where ∧ j k is the likelihood function and A j k represents the square-root measurement residual covariance matrix for the jth SCKF model.
Combining the state mean and covariance estimates for the output: The proposed MTT algorithm utilizes the IMM-SCKF estimator with the 3D velocity measurement function for the confirmed tracks' state estimation. For the tracks not receiving measurements during the data association process, the predicted state and covariance estimates become the measurement-updated state and covariance estimates. Since only a few tentative tracks fulfill the criteria to be inserted into the confirmed tracks' list, a simple NCV-SCKF estimator is used for tentative track state estimation. Employing the IMM-SCKF estimator for the targets in the tentative tracks' list will increase the computational load and complexity for the data processing unit.

Filter Initialization
Filter initialization is an extremely crucial problem in tracking applications, specifically for nonlinear systems, as nonlinear estimation filters generally depend on approximation theory [24,25]. The nonlinear measurement function in Equation (39), defining the relationship between 3D velocity measurements and the state of the target, makes finding the analytical solution impossible for filter initialization. Therefore, the initial range measurement and initial azimuth and elevation angles determined from Equations (41) and (42), respectively, are used to extract the 3D Cartesian position (x 0 , y 0 , z 0 ) of the target. That is, x 0 = ρ cos ϕ sin θ (80) The velocity of the target is calculated by integrating the position estimate at two consecutive time instants, i.e., v x 0 = (x 1 − x 0 )/∆T, v y 0 = (y 1 − y 0 )/∆T, and v z 0 = (z 1 − z 0 )/∆T. Since the azimuth and elevation angles calculated are highly sensitive to the range measurement error, (R, θ, ϕ) measurements are not reliable for target tracking in the 3D Cartesian space. These measurements are only utilized for filter initialization, and tracking is performed based on the 3D velocity information obtained from the interferometric radar.

Rule-Based M/N Logic for Track Management
Since the GNN algorithm is incapable of addressing the track management issue automatically, the rule-based M/N logic is used to handle the appearance and disappearance of the targets in the radar's FOV. The track management involves new track initiation, tentative track confirmation, and tentative/confirmed track deletion. The measurementto-track data association procedure is followed by the track management step, which is responsible for managing both the tentative tracks' list and confirmed tracks' list on the basis of predefined rules. Each track list contains the information of state estimate vector x k|k , square-root error covariance estimate matrix S k|k , measurement residual covariance matrix S Z,k , "Hit" counter, and "Miss" counter. Upon receiving a new set of 3D velocity measurements from the interferometric radar, these measurements are first tested for association with the confirmed tracks. If a confirmed track does not get associated with a measurement during this step, its "Hit" counter is decremented and its "Miss" counter is incremented. The measurements not associated with the confirmed tracks are tested for data association with existing tentative tracks. The "Hit" counters of the tentative tracks receiving measurements during the data association procedure get incremented, whereas their "Miss" counters remain unchanged. On the other hand, if a tentative track does not receive any measurement during the data association step, its "Hit" counter remains unchanged, whereas its "Miss" counter gets incremented. The still unassociated measurements are utilized by the track management unit to initiate new tentative tracks. The "Hit" and "Miss" counters of new tentative tracks are set to 1 and 0, respectively. The tentative tracks satisfying the 2/2 and 2/3 rules are inserted in the confirmed tracks' list. This means that a tentative track receiving measurements during the first two consecutive scans of the data and then receiving measurements at least twice during the next three consecutive scans is eligible to be inserted in the confirmed tracks' list. At this stage, the "Hit" and "Miss" counters of the confirmed tracks are set as "Hit = 5" and "Miss = 0". The tentative track not satisfying the 2/2 and 2/3 criteria is deleted from the tentative track list. If a confirmed track does not receive any measurements during five consecutive scans of data, i.e., "Hit = 0" and "Miss = 5", the delete flag for this track is set to 1 and the track is deleted from the confirmed tracks' list [29].

Performance Evaluation Simulations
This section presents the performance evaluation of the proposed 3D MTT algorithm on the basis of a number of performance evaluation metrics for non-maneuvering and maneuvering multi-target scenarios in the presence of process noise, measurement noise, and clutter due to false alarms.

Performance Metrics
The performance evaluation metrics considered in the proposed research include the following.

Root-Mean-Squared Error in Position
Assume [x k , y k , z k ] and [x k ,ŷ k ,ẑ k ]) represent the true and estimated positions, respectively, of a target at time instant k in 3D Cartesian coordinates. For M number of Monte Carlo runs, the RMSE in the position of the target is defined as [24,29]

Root-Mean-Squared Error in Velocity
represent the true and estimated velocities, respectively, of a target, the RMSE in velocity for M number of Monte Carlo runs at time instant k can be written as

Mean Execution Time for One Data Scan
The mean execution time T E of the algorithm for one data scan was computed on a laptop computer. The specifications of the computer were 1.9 GHz processor, 4GB RAM, and Windows 10 for Matlab2018. The total execution time was composed of the time for data association T DA , filtering for state estimation T F , and track management T TM functions [24,29].

IMM Mean Model Probabilities
The IMM mean model probabilities for maneuvering targets reflect how efficiently the IMM algorithm can recognize the different dynamic motion models of the targets and switch between different filter models accordingly [29].

Parameter Selection and Simulated Data Generation
To evaluate the performance of the proposed MTT algorithm, the targets were considered as point sources in the far-field relative to the observing radar. A DF-FMCW interferometric radar with f c 1 = 6 GHz and f c 2 = 24 GHz was simulated with a bandwidth B = 500 MHz and a sweep time T = 1 ms. The sampling frequency was set to be f s = 128 kHz. The receiving antennas Rx1, Rx2, and Rx3, corresponding to f c 1 , were located at (0,0,0), (−D 12 ,0,0), and (0,0,D 13 ), where D 12 = D 13 = 3 m [29]. The target trajectories were modeled using the NCV and NCT dynamic models with discrete white Gaussian process noise. The straight line motion of the targets followed the NCV model, whereas the maneuvering motion of the targets followed the NCT model. The standard deviations associated with the linear and circular segments of target motion were assumed to be σ v 1 = 0.20 and σ v 2 = 0.10. Further, the radial velocity, azimuth angular velocity, and elevation angular velocity measurement error standard deviations were set as σ v r = 0.14 m/s, σ ω θ = 0.10 rad/s, and σ ω ϕ = 0.10 rad/s, respectively. The probability of gate detection was set as P G = 0.99999. The sampling interval was ∆T = 0.02 s [29]. The number of Monte Carlo simulation runs was M = 20. The clutter points assumed a Poisson distribution and were uniformly distributed in the measurement region [42]. Each clutter point was composed of (i) a radial velocity measurement distributed in the range of [v r min , v r max ], (ii) an azimuth angular velocity measurement distributed in [ω θ min , ω θ max ], and (iii) an elevation angular velocity measurement distributed in [ω ϕ min , ω ϕ max ]. The average number of clutter points was set as 5 for each scan [29]. For the IMM filter with Model 1 as the NCV model and Model 2 as the NCT model, the model transition probabilities matrix is The initial model probability for each filter model was chosen to be µ j = 0.5, where j = 1, 2 [29].

Scenario 1: Two Non-Maneuvering Closely Spaced Targets
Scenario 1 for 3D tracking with two non-maneuvering targets and radar antennas is shown in Figure 3. Table 1 presents the initial states of the targets. The trajectories of the targets were modeled using the NCT dynamic model defined by Equation (23). However, the circular motion was along the xz-plane, rather than the xy-plane, as described by state transition matrix F NCT,3D k−1 in Equation (25).  The range-radial velocity map ( f c 2 = 24 GHz) represented by Figure 4a shows two targets with initial ranges of R 01 = 3.47 m and R 02 = 3.11 m and initial radial velocities of v r 1 = 1.31 m/s and v r 2 = 1.1 m/s, respectively.
The time-varying Doppler spectrogram ( f c 2 = 24 GHz), azimuth interferometric spectrogram ( f c 1 = 6 GHz), and elevation interferometric spectrogram ( f c 1 = 6 GHz) are shown in Figure 4b-d, respectively. The instantaneous Doppler frequency shift caused by the radial velocity of the target increases for the target moving away from the radar and decreases for the target moving towards the radar. Moreover, the sinusoidal patterns of the radial velocities represent the circular motions of the targets moving towards and away from the radar. The instantaneous azimuth angular frequency caused by the azimuth angular velocity is positive for the target moving along the positive x direction and negative for the target moving along the negative x direction. Similarly, the instantaneous elevation angular frequency caused by the elevation angular velocity is positive for the target moving in the positive ϕ direction and negative for the target moving in the negative ϕ direction.   The real target tracks following Equation (23) and the output of the proposed algorithm as estimated target tracks in the 3D Cartesian space are shown in Figure 6a. Moreover, 6b-d represent the target tracks in the 2D xy, xz, and yz Cartesian spaces, respectively. To access the performance of the proposed algorithm, the RMSEs in the positions and velocities of the targets are plotted in Figure 7a,b, respectively, which prove that the proposed algorithm based on 3D velocity measurements from the interferometric radar can be used for MTT in the 3D Cartesian space.

Scenario 2: Two Maneuvering Closely Spaced Targets
Scenario 2 for 3D target tracking with two closely spaced maneuvering targets and radar location is shown in Figure 8. The trajectories of the targets were modeled by the NCV (Equation (18)) and NCT (Equation (23)) dynamic models. The initial states of the targets are summarized in Table 2.

Targets
Initial States of Targets The range-radial velocity map plotted in Figure 9a clearly shows two different targets in the radar's FOV with initial ranges of R 01 = 4.68 m and R 02 = 4.35 m and initial radial velocities of v r 1 = −1.91 m/s and v r 2 = −1.11 m/s, respectively.
Time-varying Doppler, azimuth interferometric, and elevation interferometric spectrograms for Scenario 2 are shown in Figure 9b-d, respectively. The radial, azimuth angular, and elevation angular velocities extracted from the time-varying spectrograms are presented in Figure 10a-c, respectively, together with the ideal 3D velocity measurements. For targets moving towards the radar, the radial velocities decrease, and for targets moving away from the radar, the radial velocities increase. Similarly, the azimuth and elevation angular velocities of the targets moving in positive θ and ϕ are positive, respectively, and vice versa. For the performance evaluation, the RMSEs in the positions and velocities of the targets are presented in Figure 12a,b. Figure 12a,b assert the fact that the RMSEs for the GNN-IMM-SCKF algorithm are less compared to the RMSEs for the GNN-NCV-SCKF algorithm during the targets' maneuvers. The IMM mean model probabilities for the NCV and NCT dynamic models presented in Figure 12c validate the fact that the proposed GNN-IMM-SCKF algorithm based on 3D velocity measurements obtained from the interferometric radar is applicable to 3D tracking systems for state estimation of maneuvering targets. The execution times for different 3D target tracking scenarios are summarized in Table 3. It is evident that the data association block of the tracking algorithm consumes more time than the filtering and track management blocks, which is approximately 48-56% of the total execution time. Furthermore, the execution time for the GNN-IMM-SCKF algorithm is approximately 27% greater than the execution time for the GNN-NCV-SCKF algorithm. The total execution time T E being less than the measurement sampling interval ∆T proves the fact that the proposed MTT algorithm can be implemented for real-time applications.

Conclusions
MTT typically requires either a network of Doppler radar receivers at different locations or a single phased array radar. However, Doppler radar networks have high computational complexity and data throughput attributed to multiple receivers in the network. Moreover, array signal processing techniques for phased array radar are computationally expensive. To resolve the issue, this paper presented an algorithm for detection and tracking of multiple moving targets based on 3D velocity measurements obtained from a dual-orthogonal baseline interferometric radar. First, we presented the mathematical model of the 3D velocities of multiple moving point sources as targets. The radial, azimuth angular, and elevation angular velocities were extracted using reference receiving antenna, a baseline along the x-axis and a second orthogonal baseline along the z-axis, respectively. Then, we derived the nonlinear 3D velocity measurement function, which defines the rela-tionship between the 3D velocity measurements and the state of the target. Based on the 3D velocity measurement function, we introduced the design and implementation of an MTT algorithm, which included the GNN for data association, the IMM-SCKF estimator for state estimation, and the rule-based M/N logic for track management. Then, we performed Monte Carlo simulations for different multi-target scenarios and evaluated the performance of the algorithm in terms of the RMSEs in position and velocity, the mean execution time, and the IMM mean model probability. In order to simulate a multi-target scenario close to a real environment, process noise in the dynamic motion models of the targets was modeled as the DWNA, taking into consideration small accelerations as noise. Moreover, zero-mean Gaussian measurement noise and clutter due to false alarms following a Poisson distribution were added to the received data. Consequently, the simulation results proved the fact that the proposed algorithm is robust and can be applied to practical 3D tracking systems.