 Research
 Open access
 Published:
Gaussian mixture probability hypothesis density filter for multipath multitarget tracking in overthehorizon radar
EURASIP Journal on Advances in Signal Processing volume 2015, Article number: 108 (2015)
Abstract
Conventional multitarget tracking systems presume that each target can produce at most one measurement per scan. Due to the multiple ionospheric propagation paths in overthehorizon radar (OTHR), this assumption is not valid. To solve this problem, this paper proposes a novel tracking algorithm based on the theory of finite set statistics (FISST) called the multipath probability hypothesis density (MPPHD) filter in cluttered environments. First, the FISST is used to derive the update equation, and then Gaussian mixture (GM) is introduced to derive the closedform solution of the MPPHD filter. Moreover, the extended Kalman filter (EKF) is presented to deal with the nonlinear problem of the measurement model in OTHR. Eventually, the simulation results are provided to demonstrate the effectiveness of the proposed filter.
1 Introduction
Overthehorizon radar (OTHR) exploits skywave propagation of highfrequency signals to detect and track targets, which are different from the conventional radar. It has received wide attention because of its wide area surveillance, long detection range, strong antistealth ability, the capability of the long early warning time, and so on. In OTHR, a significant problem is the effect of multipath propagation, which causes multiple detections via different propagation paths for a target with missed detections and false alarms at the receiver [1–6]. Nevertheless, the conventional tracking algorithms, such as probabilistic data association (PDA) [7–9], presume that a singlemeasurement per target, it may consider the other measurements of the same target as clutter, and multiple tracks are produced when a single target is present. Therefore, these methods cannot effectively solve the multipath propagation problem.
In order to solve the multipath propagation problem of OTHR, lots of algorithms have been proposed. Such as the multipath viterbi data association (MVDA) [10] and modified probabilistic data association (MPDA) [11]. However, these conventional algorithms involve data association problem and the complexity of the computation. In addition, it is noted that most of the existing algorithms in OTHR focus on a single target. Therefore, the multitarget tracking algorithm in OTHR is still an open problem.
Most of the conventional algorithms about multitarget tracking, such as multiple hypothesis tracker (MHT) [12], joint probabilistic data association (JPDA) [13, 14], and probability hypothesis density (PHD) filter [15], assume the following measurement model: (1) every target produces at most one measurement and (2) any measurement is produced by a target or clutter. In this paper, we consider the measurement model which satisfies these assumptions as standard measurement model. However, many measurement models in reallife target tracking scenarios do not satisfy these prerequisite of assumption, which are treated as nonstandard measurement model. Recently, the multiple detection joint probabilistic data association (MDJPDA) filter [16] based on the JPDA framework was proposed to deal with the multiple detection targets, which can apply to OTHR. However, this algorithm involves complexity data association. To solve this problem of multitarget tracking, more effective methods should be taken into account to implement in OTHR.
In 2009, Mahler derived a series of “secondgeneration” PHD/cardinalized probability hypothesis density (CPHD) filters [17] which addressed the tracking problems for nonstandard multitarget measurement model, such as extended targets [18–21], unresolved target [22], unknown clutter [23], and superpositional sensors [24]. As for the multipath propagation in OTHR, the receiver can obtain more than one measurement from the same target, which means that it violates the second assumption of the standard measurement model. Therefore, the multipath tracking model in OTHR is one of the nonstandard measurement models, such that conventional multitarget tracking algorithms would no longer be applicable.
To solve the multipath propagation problem of multitarget, we propose a novel tracking algorithm based on the theory of finite set statistics (FISST) called the multipath probability hypothesis density (MPPHD) filter in OTHR. First, inspired by Mahler’s work in [17], the FISST is used to derive the update equation of the MPPHD filter. Then, a method of Gaussian mixture (GM) is introduced to derive the closedform solution of the MPPHD filter. In addition, the extended Kalman filter (EKF) is presented to deal with the nonlinear problem of the measurement model in OTHR. The simulation results demonstrate that the MPPHD filter can accurately estimate the target state and the target number for low detection probability under the multitarget tracking circumstance.
This paper is organized as follows. Section 2 presents the problem formulation for OTHR. Section 3 then formulates the random finite set (RFS) measurement model for the OTHR tracking problem and derives the MPPHD filter in OTHR based on the FISST. A closedform implementation of MPPHD filter is presented in Section 4. In Section 5, the simulation results are presented. Finally, some conclusions and future works are discussed in Section 6.
2 Problem formulation
2.1 Dynamic model
The geometry of the target and OTHR system is depicted in Fig. 1. The target state vector of OTHR at time k is defined by \( {x}_k={\left[\rho (k),\overset{.}{\rho }(k),b(k),\overset{.}{b}(k)\right]}^{\prime },{x}_k\in \Im \), where ρ(k) = ρ _{1}(k), \( \overset{.}{\rho }(k) \), b(k), and \( \overset{.}{b}(k) \) are the ground range, range rate, bearing, and bearing rate and ℑ is the space of the ground coordinates, the dash denotes transposition.
Since the distance between the receiver and the targets is large, we usually assume that the state equation of OTHR is linear and discretetime. It could be modeled as
where u _{ k − 1} is a zero mean, white Gaussian noise with covariance Q _{ k − 1}, and the state transition matrix F is given by
where T is the sampling period.
2.2 Measurement model of OTHR
OTHR achieves beyond the lineofsight horizon target tracking by exploiting skywave propagation of highfrequency signals via the ionospheric, and depending on the particular ionospheric propagation conditions, there may be several propagation paths. As shown in Fig. 1, the OTHR signal reflects from the transmitter to the target by an ionospheric at height h _{t}, then the signal reflects from the target to the receiver by an ionospheric at height h _{r}. As is well known, there are many ionospheric layers present in the atmosphere, and we suppose that there are two ionospheric layers E and F for simplicity, with constant heights h _{E} and h _{F} (this suppose is the same as other algorithms in OTHR). Therefore, there are four propagation modes: mode EE (transmit on E and receive on E); mode EF (transmit on E and receive on F); mode FE (transmit on F and receive on E); and mode FF (transmit on F and receive on F). It means that the receiver can obtain more than one measurement from the same target at one time.
The OTHR measurements consist of a slant range Rg = r _{1} + r _{2}, Doppler f _{ d }, and Az = π/2 ‐ θ (θ is the azimuth as shown in Fig. 1) of the form z _{ k } = [Rg(k), f _{ d }(k), Az(k)]′, \( {z}_k\in \mathcal{G} \), where \( \mathcal{G} \) is the space of the slant coordinates.
The measurement model of OTHR involves the mapping from the ground coordinates \( \left(\rho, \overset{.}{\rho },b,\overset{.}{b}\right) \) to the slant coordinates (Rg, f _{ d }, Az). From Fig. 1, it can be shown that the mapping is expressed as [2]
where
Then, the measurement model of OTHR can be expressed as [11]
where x _{ k } is the state variable; w _{ k,i } is the zero mean, white Gaussian noise with known covariance R _{ k,i }, and h _{ i }(⋅) is the nonlinear measurement function of ith propagation mode, i = 1, 2, 3, 4.
where, for a given propagation mode i, h _{ t } and h _{ r } must be replaced by the virtual ionosphere heights, where the details can be found in [11].
3 The RFS model and PHD filter implementation in OTHR
In the standard PHD filter, it is presumed that a target produces at most one measurement. Due to the multipath effect of OTHR, a single target may generate several measurements. Therefore, the measurement model of the MPPHD filter proposed in this paper is different from the standard PHD filter. In this section, we first introduce the RFS measurement model for OTHR and then derive the update equation of the MPPHD filter based on the theory of FISST.
3.1 The RFS measurement model for OTHR
At each time k, a finite set of measurements of OTHR, denoted by \( {Z}^k=\left\{{z}_{k,1},{z}_{k,2},\cdots {z}_{k,{N}_k}\right\} \), where \( {z}_{k,1},{z}_{k,2},\cdots {z}_{k,{N}_k} \) are the received measurements at time k and N _{ k } is the number of measurements. Since the measurements include several detections from targets and clutter, the collection of measurements of OTHR can be modeled by RFS
where Θ _{ k,i }(x _{ k }), i = 1, ⋯, 4 denotes the measurement originated from the ith propagation path and Γ _{ k } denotes the RFS of clutter. It is presumed that conditional on x _{ k }, Θ _{ k,i }(x _{ k }), i = 1, ⋯, 4 and Γ _{ k } are independent RFSs.
3.2 The update equation of MPPHD filter in OTHR
Note that both the MPPHD filter and the standard PHD filter recursion require two steps: prediction and update. In the following subsection, we only derive the update equation according to the above RFS measurement model since the prediction step of the MPPHD filter is identical to the standard PHD filter.
In ref. [17], the probability generating functional (PGFL) of update equation for the multitarget Bayes filter can be written as
where F[g, h] is twovariable PGFL as
where f _{ kk − 1}(XZ ^{(k − 1)}) is the predicted multitarget distribution, f _{ k }(ZX) is the multitarget likelihood function and h ^{X} is defined by h ^{X} = 1 when X = ∅ and h ^{X} = ∏_{ x ∈ X } h(x) otherwise. The update PHD filter can be given by
Therefore, the update equation for MPPHD filter can be derived by the following procedures:

1)
Derive the PGFL G _{ k }[gX] by using the OTHR measurements and exploiting Eq. (11) to derive a closed form of F[g, h]

2)
Derive the derivatives of F[g, h] by using Eq. (10) to derive a closed form of G _{ kk }[h]

3)
According to Eq. (11), derive a closedform update for the MPPHD filter in OTHR
In the following part of this subsection, we will present the details of the derivation. First, we derive the PGFL G _{ k }[gX] according to the OTHR measurements in Eq. (9). Since Θ _{ k }(x) = Θ _{ k,1}(x) ∪ Θ _{ k,2}(x) ∪ Θ _{ k,3}(x) ∪ Θ _{ k,4}(x), the PGFL G _{ k }[gx] of Θ _{ k }(x) is
where p _{ g,i }(x) = ∫g(z)g _{ k,i }(zx)dz, p _{ D,k }(x) is the detection probability, and g _{ k,i }(zx) is the likelihood of the ith propagation path. Consequently, if we abbreviate q _{ D,k }(x) = 1 − p _{ D,k }(x), Eq. (11) can be summarized as follows:
where c[g] = ∫g(z)c _{ k }(z)dz and G _{ kk − 1}[h] = ∫h ^{X} f _{ kk − 1}(XZ ^{(k − 1)})δX.
To derive a closedform update equation for the multipath multitarget PHD filter, we assume that the predicted multitarget distribution is a Poisson process:
where s[h] = μ ^{− 1}∫h(x)D _{ kk − 1}(x)dx and μ = ∫D _{ kk − 1}(x)dx. Thus, Eq. (15) can be written as
Next, we deduce the formula for \( {\scriptscriptstyle \frac{\delta F}{\delta Z}}\left[0,h\right] \). Note that we set g = 0 because the formula for \( {\scriptscriptstyle \frac{\delta F}{\delta Z}}\left[g,h\right] \) is very cumbersome without setting it.
Lemma 1. The derivatives of F[g, h] is given by the formula
where the notation ‘℘ ∠ Z’ is shorthand for “℘ partitions Z into cells W”, ∏_{ Z } = ∏_{ z ∈ Z } λc(z),
and where
See Appendix 1 for the proof of Lemma 1.
Lemma 2. The multipath posterior PGFL G _{ kk }[h] is given as
where
and d _{ W }[0, h] is the Eq. ( 19 ).
See Appendix 2 for the proof of Lemma 2.
According to Lemmas 1 and 2, we can obtain the MPPHD filter update equation in Proposition 1 as follows:
Proposition 1. The update equation for the MPPHD filter is
where
here
where
See Appendix 3 for the proof of Proposition 1.
4 Gaussian mixture implementation of the MPPHD filter
According to the GM implemented in the standard PHD filter in [25], a GMPHD filter recursion can be derived for the multipath target tracking. Due to the MPPHD filter prediction equation for the OTHR are identical to the standard PHD filter, the GM prediction equation of MPPHD filter are the same as the standard GMPHD filter, where the details can be found in [25]. Therefore, in this section, we only consider the GM update equation of the MPPHD filter.
4.1 Gaussian mixture MPPHD
To derive a closedform solution to the update equation of the MPPHD filter, we assume that each target follows a linearGaussian transition and measurement model, i.e.,
where N(⋅; m, P) denotes a Gaussian density with mean m and covariance P. F is the state transition matrix, Q is the process noise covariance, H _{ k,i } is the observation matrix, and R _{ k,i } is the observation noise covariance. The survival and detection probability are assumed as a constant, i.e., p _{ S,k }(x) = p _{ S,k }, p _{ D,k }(x) = p _{ D,k }. To facilitate the derivation of the closedform solution, we define an intermediate operator \( {G}_{k,z}^i \) by
If g _{ k,i }(z _{ a }x) = N(z _{ a }; H _{ k,i } x, R _{ k,i }) and ϕ(x) = N(z; m _{ ϕ }, P _{ ϕ }), then \( \left({G}_{k,{z}_a}^i\phi \right)(x) \) is a Gaussian density
where
We suppose that the predicted PHD filter at time k − 1 has the following GM representation:
where \( {\omega}_{k\Bigk1}^{(l)} \) is the weight of the lth component and J _{ kk − 1} is the predicted number of the components. Then, the update equation at time k can be expressed as a GM of
The GM components \( {D}_{k\Bigk}^{ND}(x) \), handling the no detections cases, are given by
The GM components \( {D}_{k\Bigk}^D\left(x,W\right) \), handling detected target cases, are given by
when W = {z _{1}},
when W = {z _{1}, z _{2}}
when W = {z _{1}, z _{2}, z _{3}}
when W = {z _{1}, z _{2}, z _{3}, z _{4}}
where ∘ denotes a composition.
4.2 Implementation issues

1)
Nonlinear measurement model: The above Gaussian mixture MPPHD filter can be extended to a nonlinear measurement model using the EKF. Due to that the dynamic model in the OTHR is linear, we only apply EKF to deal with the nonlinear measurement model in the update step of MPPHD filter. Use the approximations (55) and (56) in place of the originals (32) and (33), and use the linearizations in (57) to calculate (36) and (37)
where

2)
Managing mixture components: Similar to the standard GMPHD filter, the techniques of merging and pruning must be used to reduce the exponential growth of the number of Gaussian components, which the merging and pruning methods specific to Gaussian components can be found in [25].

3)
Computational complexity: As is shown in Eq. (24), the MPPHD filter requires all partitions of the current measurements for updating, ℘ ∠ Z _{ k } denotes that ℘ is one partition of the measurement set Z _{ k } and W ∈ ℘ denotes that W is one cell of ℘. Note that W does not include null set. For instance, Z _{ k } = {z _{1}, z _{2}, z _{3}} can be partitioned as follows [19–21]
whereas with the number of measurements growing, the number of partitions grows very large, which is computationally infeasible.
From the above analysis, we can see that the computational load required by the proposed MPPHD filter is similar to that of the extended targets PHD filter [18–22]. Note that some methods, such as Kmeans++ method [19] and spectral clustering [20], have been suggested for the implementation of the extended targets PHD filter to reduce the number of partitions. However, these methods that applied in the extended targets are measurement dependent. Since the measurement function of each measurement mode can be very different in OTHR. These methods may fail with the multipath tracking problem in OTHR. To limit the number of partitions in the MPPHD filter, some approximations are necessary in this paper. First, we can use the gating technology with multiple validation gates to reduce the number of measurements for each propagation model before the update step at each time [11], and then we can use the similar method of “effective binary partition” that was implemented in [26] to reduce the number of partitions. For space considerations which are not the focus of this paper, we omit the details. Note that we used only a simple partition technique in our implementation, and the development of more efficient implementations will be a future task.
5 Numerical simulations
The performance of the proposed MPPHD filter will be evaluated through two numerical examples, including the single target and multitarget tracking in this section. And we use the optimal subpattern assignment (OSPA) metric to evaluate the performance of the proposed algorithm [27].
5.1 Experiment 1
In this subsection, we have designed an experiment to compare the MPPHD filter with the standard singlepath PHD filter in a single target tracking scenario. Note here that the standard singlepath PHD filter uses one specific mode (mode EE used in this experiment) to track the targets, and we use the gating technology to reduce the number of measurements for propagation model EE before the update step at each time. The two filters are simulated with the same environment in OTHR. It is assumed that a single nonmaneuvering target is in the presence of clutter. Clutter is generally modeled as a Poisson RFS with the intensity function κ _{ k }(y) = λVu(y), where u(⋅) indicates the uniform density over the region [1000, 1400]km × [0.069813, 0.17453]rad, V = 41.8868 km ⋅ rad is the “volume” of this surveillance region, and λ = 4.7743(km ⋅ rad)^{− 1} is the average number of the clutter returns per unit volume. This translates to 200 clutter measurements per scan. And each propagation model has the same detection probability and target survive probability that are set to p _{ D,k } = 0.6 and p _{ S,k } = 0.95. To keep computations tractable, the Gaussian component pruning is applied in this numerical example with a pruning threshold τ = 10^{− 5}, a merging threshold U = 20, and a maximum number of Gaussian components J _{max} = 100. It is assumed that a single target moving in the surveillance region with the initial target state x _{0} = (1100 km, 0.15 km/s, 0.10472 rad, 8.72665e−05 rad/s). Other simulation parameters are defined as the same as [11]. The true target trajectory and OTHR multipath detections without clutter under p _{ D,k } = 0.6 are shown in Fig. 2. It is shown that the receiver can obtain more than one measurement from the same target at one scan.
The target tracking results of the MPPHD filter and the standard singlepath PHD filter for one simulation are shown in Fig. 3. As the position estimates are shown in (a) and (b), we can see that the MPPHD filter provides more accurate position estimates for almost all the time. Moreover, for the simulation results, shown in (c) and (d), using the MPPHD, there is only one false estimated number at time 8.
5.2 Experiment 2
In this scenario, we assumed that the number of targets is constant. The performance of the GMMPPHD filter is compared with the MDJPDA filter. Two filters are simulated with the same environment in OTHR tracking system, and we also use the gating technology with multiple validation gates to reduce the number of measurements in the MDJPDA filter. The experiment goes on for 600 s (sampling period T = 20 s), and we assumed that two targets appear with initial state target 1 x _{1} = (1130 km, 0.12 km/s, 0.10472 rad, 8.72665e−05 rad/s) and target 2 x _{2} =(1125 km, −0.1 km/s, 0.11472 rad, 7.92665e−05 rad/s), respectively. And each propagation model has the same target survive probability and detection probability that are set to p _{ S,k } = 0.95 and p _{ D,k } = 0.6. Other parameters are adopted as the same as the experiment 1.
The position root mean squared error (RMSE) of the two filters are shown in Fig. 4. It is shown that the proposed MPPHD filter has a notable performance gain over the MDJPDA filter. This is due to the fact that the proposed MPPHD filter encapsulates all the information about the targets by enumerating all of the association between propagation paths and measurements. However, only a subset of the associations (not all the permutations of the propagation paths) is used in the MDJPDA filter, this is the reason degrades the performance of MDJPDA filter.
To evaluate the computational time of the proposed algorithm, the averaged time is computed in MATLAB7.1 on an Intel CORE i5 CPU computer with 2 GB of RAM. The proposed GMMPPHD consumed approximately 8.6 s per MC run and the MDJPDA consumed approximately 1.1 s. Although the proposed MPPHD filter has high computational time, it has better performance than the MDJPDA filter.
5.3 Experiment 3
To validate the tracking performance of MPPHD filter in multipath multitarget tracking, in this experiment, we have designed a multiple track scenario including three nonmaneuvering targets where the target number is changing in OTHR. The experiment goes on for 800 s with the sampling period T = 20 s, and it is assumed that target 1 and target 2 appear in the course of the whole experiment with initial state x _{1} = (1100 km, 0.15 km/s, 0.10472 rad, 8.72665e−05 rad/s) and x _{2} = (1170 km, −0.14 km/s, 0.11472 rad, 7.72665e−05 rad/s), respectively, target 3 appears at t = 180 s and disappears at t = 480 s with the initial states x _{3} = (1170 km, −0.05 km/s, 0.15701 rad, −8.72665e−05 rad/s). In this experiment, there are no spawning targets for simplification. Other simulation conditions are the same as the experiment 1.

1)
One simulation: The true target trajectory is shown in Fig. 5, and the position estimates of the MPPHD filter for one simulation compared with the standard singlepath PHD filter are shown in Fig. 6, the estimation of target number is shown in Fig. 7. As shown in Figs. 6 and 7, the MPPHD filter can accurately estimate the target state and the target number of the multipath multitarget tracking in OTHR. In comparison, the simulation result shows that the MPPHD filter provides more accurate position estimates for almost all the times.

2)
100 Monte Carlo simulations: We compare the MPPHD filter with the standard singlepath PHD filter over 100 Monte Carlo simulations with different detection probability p _{ D,k } = 0.6 and p _{ D,k } = 0.99, respectively. We use the OSPA metric to evaluate the performance, the parameters of OSPA distance are set to the cutoff parameter c = 15 km and the order parameter p = 2 (see [27] for more details).
Figure 8 shows the average of OSPA distance comparison between the MPPHD filter and the standard singlepath PHD filter, and the average of estimated number is shown in Fig. 9. The simulation results demonstrate that the tracking performance of the MPPHD filter surpasses the performance of the standard singlepath PHD filter. Moreover, it can accurately estimate the target state and the target number with low detection probability under the multitarget tracking circumstance. As shown in Figs. 8 and 9, the standard singlepath PHD filter cannot deal with the multitarget tracking problem effectively under low detection probability. This is due to the fact that the MPPHD filter use four path measurements to track the targets, and then, it can more effectively use the measurements from the targets under low detection probability.
6 Conclusions
In this paper, the MPPHD filter, which tracks the multipath multitarget in OTHR, has been proposed. The MPPHD filter is based on the theory of FISST, the FISST is employed to derive the update equation, and then a closedform solution of MPPHD filter in the form of GM has been proposed. The EKF is used to deal with the nonlinear problem of the measurement model. Simulation results show that the proposed MPPHD filter has a notable performance gain over the MDJPDA filter.
Similar to the standard PHD filter, the MPPHD filter should be improved for some problems. For example, as the number of targets in the surveillance region is large, the estimated target number is unreliable. To solve this problem, a modified PHD filter name, cardinalized PHD filter, is proposed by Mahlar [28, 29]. Our future work could derive a CPHD filter which can be applied to the multitarget tracking in OTHR.
References
DJ Percival and KAB White, Multipath track fusion for overthehorizon radar, in: Proceedings of SPIE Signal Data Process of Small Targets, San Diego, CA, United States, July 27, 1997, pp. 363374.
DJ Percival and KAB White, Multihypothesis fusion of multipath overthehorizon radar tracks, in: Proceedings of SPIE Signal Data Process of Small Targets, Orlando, FL, April 13, 1998, pp. 440451.
MG Rutten and D J Percival, Joint Ionospheric and Target State Estimation for Multipath OTHR Track Fusion, in: Proceedings of SPIE Signal Data Process of Small Targets, vol. 4473, San Diego, CA, USA , July 29, 2001, pp. 118129.
GW Pulford, OTHR multipath tracking with uncertain coordinate registration. IEEE Transactions on Aerospace and Electronic Systems 40(41), 38–56 (2004)
H Liu, Q Pan, Y Liang, Y Cheng, M Cheng, Comments on “multipath data association tracker for overthehorizon radar”. IEEE Transactions on Aerospace and Electronic Systems 41(3), 1147–1148 (2005)
MG Rutten, S Maskell, M Briers and NJ Gordon, Multipath track association for overthehorizon radar using Lagrangian relaxation, in: Proceedings of SPIE Signal Data Process of Small Targets, Orlando, FL, April 12, 2004, pp. 452463.
Y BarShalom, E Tse, Tracking in a cluttered environment with probabilistic data association. Automatica 11(5), 451–460 (1975)
SB Colegrove, AW Davis, JK Ayliffe, Track initiation and nearest neighbours incorporated into probabilistic data association. Journal Elect. Electronics Eng 6(3), 191–198 (1986)
T Kirubarajan, Y BarShalom, Probabilistic data association techniques for target tracking in clutter. Proceedings of the IEEE 92(3), 536–557 (2004)
H Liu, Y Liang, Q Pan and Y Cheng, A multipath viterbi data association algorithm for OTHR, in: Proceedings of International Conference on Radar, Shanghai, China, 2006, pp. 1–4
GW Pulford, RJ Evans, A multipath data association tracker for overthehorizon radar. IEEE Transactions on Aerospace and Electronic Systems 34(4), 1165–1183 (1998)
SS Blackman, Multiple hypothesis tracking for multiple target tracking. IEEE Aerospace and Electronic Systems Magazine 19(1), 5–18 (2004)
HAP Blom, EA Bloem, Interacting multiplemodel joint probabilistic data association, avoiding track coalescence, in Proceedings of the 41th IEEE Conference on Decision Control, vol. 3, 2002, pp. 3408–3415
D Musicki, R Evans, Joint integrated probabilistic data association: JIPDA. IEEE Transactions on Aerospace and Electronic Systems 40(3), 1093–1099 (2004)
R Mahler, Multitarget Bayes filtering via firstorder multitarget moments. IEEE Transactions on Aerospace and Electronic Systems 39(4), 1152–1178 (2003)
B Habtemariam, R Tharmarasa, T Thayaparan et al., A multipledetection joint probabilistic data association filter. IEEE Journal Selected Topics Signal Processing 7(3), 461–471 (2013)
R Mahler, “Secondgeneration” PHD/CPHD filters and multitarget calculus, in: Proceedings of SPIE Signal Data Process of Small Targets, San Diego, CA, August 02 , 2009.
R Mahler, PHD filters for nonstandard target, I: extended targets, in: Proceedings of the 12th International Conference on Information Fusion, Seattle, WA, July 2009, pp. 915–921
K Granstrom, C Lundquist, U Orguner, A Gaussian mixture PHD filter for extended target tracking, in: Proceedings of the 13th International Conference on Information Fusion, Edinburgh, UKL, July 2010, pp. 1–8
Yang J, Liu F, Ge H, et al., Multiple extended target tracking algorithm based on GMPHD filter and spectral clustering, EURASIP Journal on Advances in Signal Processing 2014:117
Y Zhang, H Ji, Gaussian mixture reduction based on fuzzy ART for extended target tracking. Signal Process 97, 232–241 (2014)
R Mahler, PHD filters for nonstandard targets, II: unresolved targets, in: Proceedings of the 12th International Conference on Information Fusion, Seattle, WA, USA, July 2009 pp. 922–929
R Mahler, A ElFallah, CPHD and PHD filters for unknown backgrounds, III: tractable multitarget filtering in dynamic clutter, in Proceedings of SPIE, vol. 7698, 2010
R Mahler, CPHD filters for superpositional sensors, in Proceedings of SPIE, vol. 7445, 2009
BN Vo, WK Ma, The Gaussian mixture probability hypothesis density filter. IEEE Transactions on Signal Processing 54(11), 4091–4104 (2006)
J Xu, F Huang, Z Huang, The multisensor PHD filter Analytic implementation via Gaussian mixture and effective binary partition, in: Proceedings of the 16th International Conference on Information Fusion, Istanbul, TUR, July 2013 pp. 945–952
D Schuhmacher, BT Vo, BN Vo, A consistent metric for performance evaluation of multiobject filters. IEEE Transactions on Signal Processing 56(8), 3447–3457 (2008)
BT Vo, BN Vo, A Cantoni, Analytic implementations of the cardinalized probability hypothesis density filter. IEEE Transactions on Signal Processing 55(7), 3553–3567 (2007)
R Mahler, PHD filters of higher order in target number. IEEE Transactions on Aerospace and Electronic Systems 43(4), 1523–1543 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Appendices
Appendices
1.1 Appendix 1: Proof of Lemma 1
This lemma is proved by mathematical induction. For the initial induction step, assume Z = {z _{1}}. In this case there is only one partition, ℘ = {{z _{1}}}, and we get
Now, assume that we have established Eq. (18) for Z = {z _{1}, ⋯, z _{ m }} with Z = m > 1. We are to establish Eq. (18) for Z = {z _{1}, ⋯, z _{ m }, z _{ m + 1}} and Z = m + 1. Using the product rule for functional derivatives, we get
On the one hand,
On the other hand,
where
In the above equation, we use z _{1} to replace z _{ m + 1} for simplicity. And it is easy to find that \( \frac{\delta F}{\delta {z}_{m+1}}\left[g,h\right]\left{}_{g=0}\right.=\lambda c\left({z}_{m+1}\right){d}_{W\cup \left\{{z}_{m+1}\right\}}\left[0,h\right] \). Putting this all together, Eq. (59) can be written as
Note that all partitions of the Z ∪ {z _{ m + 1}} have the following forms. First, take a partition ℘ of the set Z and add the cell {z _{ m + 1}} to obtain a new partition ℘ _{1}(z _{ m + 1}) = ℘ ∪ {{z _{ m + 1}}} of Z ∪ {z _{ m + 1}}. This action is what is denoted mathematically in the first line of Eq. (63). Secondly, remove a cell W from the partition ℘ and replace it with W ∪ {z _{ m + 1}} of a new partition ℘ _{2}(z _{ m + 1}, W) = {W ∪ {z _{ m + 1}}} ∪ ∪ _{ V ∈ ℘ − {W}}{V} of Z ∪ {z _{ m + 1}}. This action is what is denoted by the product
in the second line of Eq. (63). Consequently, Eq. (63) becomes
and this ends the inductive step.
1.2 Appendix 2: Proof of Lemma 2
From Eq. (10), we get
1.3 Appendix 3: Proof of proposition 1
The posterior multipath PHD filter can be calculated as
Thus, from Eq. (21), we must first determine
On the one hand, use Eq. (22) and get
On the other hand,
where from Eq. (19), we have
Substituting Eqs. (69) and (71) into Eq. (68) yields
Setting h = 1 in the above equation then yields
where
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Qin, Y., Ma, H., Chen, J. et al. Gaussian mixture probability hypothesis density filter for multipath multitarget tracking in overthehorizon radar. EURASIP J. Adv. Signal Process. 2015, 108 (2015). https://doi.org/10.1186/s136340150294y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s136340150294y