Journal of Sensors

Journal of Sensors / 2019 / Article

Research Article | Open Access

Volume 2019 |Article ID 9278725 | https://doi.org/10.1155/2019/9278725

Linhai Gan, Gang Wang, "Tracking Split Group with -Generalized Labeled Multi-Bernoulli Filter", Journal of Sensors, vol. 2019, Article ID 9278725, 12 pages, 2019. https://doi.org/10.1155/2019/9278725

Tracking Split Group with -Generalized Labeled Multi-Bernoulli Filter

Academic Editor: Guiyun Tian
Received30 Sep 2018
Revised13 Jan 2019
Accepted25 Feb 2019
Published19 May 2019

Abstract

As target splitting is not considered in the initial development of -generalized labeled multi-Bernoulli (-GLMB) filter, the scenarios where the new targets appearing conditioned on the preexisting one are not readily addressed by this filter. In view of this, we model the group target as gamma Gaussian inverse Wishart (GGIW) distribution and derive a -GLMB filter based on the group splitting model, in which the target splitting event is investigated. Two simplifications of the approach are presented to improve the computing efficiency, where with splitting detection, we need not to predict the splitting events of all the GGIW components in every iteration. With component combination applied in adaptive birth, a redundant modeling for a newborn target or preexisting target could be avoided. Moreover, a method for labeling performance evaluation of the algorithm is provided. Simulations demonstrate the effectiveness of the proposed approach.

1. Introduction

The traditional multitarget tracking algorithm is mainly based on a standard measurement (point target) model, which assumes that one target could produce at most one measurement at a given time, and each measurement originates from at most one target [1]. However, there are many scenes; for example, a group of targets may produce a single measurement, or a single target may produce several measurements in reality, which should be handled by nonstandard measurement models. Groups are structured objects and formations of entities moving in a coordinated manner, whose number varies over time. The groups can split; in combination, they can be relatively near each other or move independently of each other [2]. As for dense group target tracking, while the number of targets in a group is large and the distribution is dense, if a point target model is used, the following problems will be encountered: ① it is hard to distinguish the targets in dense distribution, and the shelter or locomotion between targets will result in a frequency appearance or disappearance of the target, which makes it difficult to establish a stable track for each target. ② The computation resource and sensor resource will be excessively occupied in the target association and tracking process due to the large number of targets. So, a specified target model is needed for group target tracking. Though essentially different, the measurement appearance of the extended object and dense group target is similar, and their identical tracking models could be adopted [2].

Tracking methods for the group with dense distribution mainly contain Poisson likelihood method [35], random matrix (RM) method [68], random hypersurface method [912], random finite set (RFS) method [1315], etc. The random matrix approach initiated by Koch [16] jointly estimated the centroid state and extension state of the group with the assumption that the centroid state follows Gaussian distribution and describes the extension shape of the group with a random matrix following inverse Wishart (IW) distribution. The Gaussian inverse Wishart probability hyperthesis density (GIW-PHD) approach is proposed with the combination of the RM method and RFS theory [17]. Splitting and combination are important forms of group target motion. Group splitting and combination are modeled in [18], where an approach named GGIW- PHD is proposed, with the assumption that the measurement rate of the target follows Gamma distribution. The cardinality PHD (CPHD) approach is introduced to group target tracking in [19, 20], which could estimate the cardinality of the group target, thereby improving the performance of the approach. PHD filter and CPHD filter avoid data combination in multitarget tracking and improve the computation efficiency of the Bayes multitarget filter vastly, but could not explicitly accommodate the estimation of the target trajectory. Moreover, the PHD filter is known to produce highly uncertain estimates of target number and the CPHD filter is limited by the so-called “spooky” effect [2124].

The GLMB filter [2529], which addresses the limitations of PHD filter and CPHD filter, could estimate the state and the trajectory of the target simultaneously. With the GLMB filter introduced in group target tracking, the GGIW-GLMB filter is proposed in [1] and thereby a better performance in accuracy is gained compared to PHD filter and CPHD filter; however, the group splitting is not addressed.

This paper introduces the -GLMB filter for group target tracking; although it is able to estimate the track of the group, the split of the group is not readily addressed. In view of this, we consider tracking the group target based on a splitting model and derive a GGIW--GLMB filter for multiple split group target tracking. Besides, simplifications concerning on splitting prediction and the target adaptive birth are presented to make our approach more feasible computationally. Moreover, the track labeling OSPA error is proposed for labeling performance evaluation.

The paper is organized as follows: In Section 2, the background is provided on the GGIW-GLMB filter. In Section 3, the derivation of GGIW--GLMB for the multiple splitting group is developed. Two simplifications to improve computation efficiency are presented in Section 4. Section 5 presents simulation results, and Section 6 concludes the work.

2. Background

2.1. The Dynamic and Measurement Model of Group Target

Assume that the centroid state of the group target at time is , the dynamic model is given by where with being the dynamic matrix in one-dimensional space. denotes the Kronecker product, denotes the identity matrix. is the independent Gaussian process noise with being the covariance matrix in the one-dimensional model, and . is a symmetric positive definite matrix describing the extension state of the group target.

Given the measurement set at time to be , the measurement model of the group target is given by

is the number of measurement at time . , specially, while , . is the independent Gaussian white noise with being the covariance.

2.2. GLMB Filter for Multigroup Target
2.2.1. Labeled RFS

Suppose that and are the state space and discrete label space of the multitarget, respectively, let , , then is an RFS on . denotes the number of elements in the RFS. Define the distinct label indicator function as where denotes the set of unique labels in . The label consists of the time of target birth and a serial number of the target, which are distinct with each other in each realization, which means is always satisfied.

Define the Kronecker delta function and the set inclusion function as where may be scalars, vectors, or sets.

The probability density of GLMB RFS is distributed as follows: where is the discrete index set, , and

2.2.2. The Labeled Likelihood of Group Target

The measurement likelihood function of the multigroup target is given by [1] where is a finite measurement set, denotes the set of all the partitions dividing into groups, and is a particular partition of . : denotes the association map of the target for measurement, while , then . is the space of , and denotes the element of corresponding to label .

2.2.3. The Prediction and Update of GGIW-GLMB

At time , let be the measurement rate which follows Poisson distribution, be the centroid state, and be the extension state. Then, the probability density function (PDF) of the group target state is given by where denotes the state to be estimated, denotes the parameter of the GGIW component, denotes the state covariance of a single dimension, and denotes the state covariance of all dimensions. Substitute (9) into (5), the distribution of GLMB RFS of the multigroup target could be obtained subsequently.

Let the subscript “+” be the index of the next time; e.g., might denote the probability density, label, label space, etc., according to the meaning of . Then, the expression of prediction and update of GGIW-GLMB is given by [1] (1)Prediction where and denote the weight of the predicted GLMB and the predicted probability density of the group target state, respectively.(2)Update where and denote the weight of the updated GLMB component and updated probability density of the group target sate, respectively.

3. GGIW--GLMB Filter with Splitting

3.1. GGIW--GLMB Prediction and Update

-GLMB is a special form of GLMB filter; let where is the track label set of time . is a discrete space, and represents a history of association maps up to time , i.e., .

Substitute (12)-(14) into (10) and (11); the prediction and update of GGIW--GLMB can be given by the following: (1)Prediction where where denotes the label space for targets born at the next time; denotes the label space for the current time, for a given label set ; represents the weight of the birth labels; and represents the weight of the surviving labels. denotes the labeled state of the group target, denotes the death probability, is either the density of a newborn group or the density of a surviving group computed from the prior density via the single-target prediction with transition density weighted by the probability of survival probability .(2)Update where where is defined as (8). While , where denotes the parameters of the predicted GGIW density of the group target with label within . Let Then, .

3.2. GGIW--GLMB Prediction and Update with Splitting

Consider the splitting model in references [18, 30], we make the following assumptions:

A1: The group target splits at the prediction phase.

A2: Let the dimension of the extension state be . As the split may happen in any dimension, if a parent track with label at time splits 2 subgroups (split pair) at time , then, each subgroup takes on the label , while , and the parameter is the same for the split pair. Let , .

Different from the -GLMB spawning model of the point target in reference [30], neither states of the split subgroups are identical with the expected value of its parent in this paper. That is to say, the split subgroups and its parent are mutually exclusive; e.g., when the formation of the UAV cluster is split into two subgroups, the group extension and measurement rate are greatly changed. While in reference [30], one of the split subgroups has an identical expected value on state to its parent e.g., after launching the missle, the extended state of the aircraft is almost unchanged. ② In reference [30], the split and the survival of the track are in parataxis; there are 3 possible states of a current target at the next time: survival, death, and split. But in this paper, survival is the prerequisite of the split, which means only a survival track could split. Thus, the two-split model applies for different tracking scenarios.

For a preexistent group, it can be survival or death; if survived, it may split or not in the next time. Suppose that is the label set of a newborn group and the survival group, respectively. denotes the label space of the survival group targets, are the label space of the survival but nonsplit groups and the split subgroups, respectively, then, with and . , , and , and according to the assumption A2, all labels in derive from . Given the labeled state of a group target of current time to be , if it survived, it will either split with probability , and probability density , , or it does not with probability , and evolution probability density . Assume the nonlabeled state of a split pair to be , . denotes the labeled state set of all possible split subgroups of track , with denoting a split parameter. denotes the predicted labeled state of track at the next time while it does not split. We model the set of the multigroup target which survived as conditional LMB RFS distributed according to

Let where denotes the label of the survival target. Thus, while splitting, is a joint distribution.

(1) Prediction. Given the multigroup target posterior to be a -GLMB, the predicted labeled multigroup target density is given by

As , and . Let denotes the set of a newborn group, then where and are originated from the current component. The proof is given in Appendix A.

The subgroups of different parent tracks and the newborn group target are mutually disjoint; however, both the subgroups from a parent are conditioned on the same state, the probability density of a split pair in is correlated, and thus the labeled multigroup target density (23) is not -GLMB. Reference [30] approximates the label-conditioned joint densities of the labeled multitarget density by the product of its marginal to form an approximate -GLMB density; however, it is not easy to realize as the state of group target is modeled as GGIW. In this paper, the analytical minimization of the Kullback-Leibler divergence (KL-DIV) is used to approximate the true density of the joint probability density. Given the parameter , let the approximation of the joint probability density for the split pair be , and equating to the expected values of the joint probability density where

and denote the state parameters of the subgroups split from the dimension of a current group target, a different value in represents a different split hypothesis, and and are the eigenvalues and eigenvectors of , respectively. Respectively, and are the prediction state and the corresponding parameters of the next time while the current group does not split. The poof of (25) can be a reference in [18].

Hence, approximating the joint density of the subgroups by (25), the approximation of the predicted -GLMB is given by where denotes that the predicted probability density of the group does not split. The proof is given in Appendix B. Note that the split pair appears or not simultaneously, and they share a common weight. Only if , the inner summand is nonzero.

(2) Update. With the GGIW--GLMB prior density given as (27), the GGIW--GLMB posterior density of multiple splitting groups is given as follows: where

4. Simplification of the Approach Proposed above

4.1. Splitting Detection

As for GGIW--GLMB with splitting derived in Section 3, if there are GGIW in a -GLMB component, then the number of predicted GLMB will be , where denotes the number of the split hypotheses in each dimension of the state. Hence, as the number of the group target increases, the number of -GLMB increases exponentially. In practice, if it does, the split will only happen in one or just a few moments in a tracking process; splitting prediction in every iteration may be computationally infeasible for practical application. One possible solution is to assume that only one group target may split in a particular moment. As usual, the probability of group target splitting is small, and the probability of splitting more than 1 group target is much smaller; so, this assumption is reasonable. Then, for a -GLMB with GGIW, the number of the predicted -GLMB in the next time is . In this paper, we propose a splitting detection approach based on the following assumption:

A3: While not splitting, the formation of the group, the target number within a group, and the spacing among them do not change significantly, e.g., formation airplane cruise.

According to A3, for a group, the ratio of the estimated area to the number of measurements should not vary much, if its motion is stationary. If the ratio bigger than a given threshold, it could be a sign of splitting. Given the PDF (9), the ratio is computed by [31]. where denotes the eigenvalue of . In reference [31], a threshold is given, if , the target is thought to split, and the target is divided into multiple ellipses; however, as the extension area and the number of group target vary much in different scenarios, it is not easy to preset a threshold . Thus, here we use the change of the ratio between the adjacent time as the basis of split detection where is computed by and . Usually, if , we let ; if , we could set the split probability according to the specific condition, e.g.,

4.2. Birth Components Combination

There are two main models for target birth: one is a static model, which means that new targets could only be initiated around predetermined locations, and the other is an adaptive target birth model that allows for new targets to appear anywhere in the state space. Hence, the latter is more flexible in the scenarios with no priori information about the position of the newborn target [32].

The adaptive birth density in this paper resembles the adaptive birth density of the standard LMB filter [32]. The difference is that there are many possible partitions to the measurement in multigroup target tracking and different partitions corresponding to different combination of the targets; many of the measurements in different partitions are duplicate or corresponding a same target. As each measurement set may be generated by a potential newborn target [32], modeling these duplicate measurements or measurements from the same target repeatedly would be a huge waste of computation. In view of this, we consider validating the kinematic states for the possible target. First, for the states of possible newborn targets falling inside the gate, only the one with maximum weight is remained. The gate criterion is given by where and are potential newborn targets, while (34) is satisfied, then and are combined, and the combined state is identical to the one with greater birth probability. is a set of potential newborn targets after combination. is the threshold calculated by the inverse cumulative distribution conditioned on a preset confidence probability, and we set the probability to be 0.9 in this paper.

Second, for a potential newborn target in and a preexistent target falling inside a gate, we think it is a preexistent one and do not model it as a newborn target anymore. The gate criterion is given by where denotes the set of possible newborn targets falling inside the gate for the updated component . is the state covariance. Thus, the newborn target set of time is .

5. Simulation Results

There are two group targets in a cluttered scenario. For group 1, initialize the kinematic state to be , the measurement rate to be 30, and the extension state to be , where are semi-minor and semi-major axes of the extension ellipse, respectively. The target bears a constant velocity from time through 5 and split at time , the two split subgroups moving in constant turning models with turning rates  rad/s and  rad/s, respectively, from time through 11, then they both move in constant velocity model, and the track is terminated at time and 15, respectively. The semi-major and semi-minor axes of the subgroups satisfy , with , and the measurement rate is 15, respectively. The initialized kinematic state of the group 2 is , the measurement rate is 30, and extension state satisfies . From time through 9, the target moves in a constant velocity model and is split into two subgroups with measurement rates 20 and 10, respectively, at time . The first split subgroup of group 2 satisfies and moves with a constant turning rate with the turning rate as  rad/s from time through 15, then moving in a constant velocity model, and the track is terminated at time . The second one satisfies and moves in a constant turning model with the turning rate as  rad/s, the track being terminated at time . The clutter follows a Poisson distribution with the mean value of 5 and distributed in a measurement space of . The detection probability of the sensor is , and the probability of target survival is .

And , , where is the sample time, and is the maneuvering correlation time, .

Figure 1 shows the true tracks and the noised measurements in clutter, where “” denotes the clutter, “.” denotes the noised measurement of the target in the group, the ellipse denotes the distribution area of the target extension, and “→”denotes the motion orientation of the group.

The OSPA error of 5 approaches is given in Figure 2, where M1 denotes the -GLMB filter with the static birth approach, and no splitting is considered; M2 denotes the approach in reference [18], where group splitting is considered based on the PHD filter; M3 denotes a -GLMB filter with adaptive birth, but splitting is not modeled; M4 denotes a -GLMB filter based on the group splitting model with a static birth; and M5 denotes the proposed approach in this paper. For all of these approaches, if adaptive birth or a -GLMB based on the splitting model is adopted, the corresponding strategy in Section 4 is adapted.

The kinematic states of the birth group for the approaches with static birth are true kinematic states, and other parameters of these approach are initialed as , , , , and . For the approaches with adaptive birth, the birth probability is , and the initialed kinematic state is computed online; the expected number of the birth group in each iteration is . While the splitting model is introduced, . If there is no splitting detection, , while the splitting detection in Section 4 is conducted; if , , otherwise, .

Figure 2(a) shows the general OSPA error of the approaches above mentioned, where the general OSPA is a weighted sum of the kinematic state, extension state, and measurement rate with each weighted by 0.8, 0.1, and 0.1, respectively. It can be seen from Figures 2(a)2(d) that the performance of M1 in OSPA error is the worst, which is because the approach does not model the group split and cannot track the split track efficiently. M3 and M5 have larger OSPA errors than M1, M2, and M4 in the first few periods, because there is a time delay when new targets are generated by an adaptive birth method. All of M2-M5 could track the group split, and the OSPA error increased in a few periods just behind the splitting time, because the split could not be detected by the approaches in the first few periods after group splitting. The adaptive birth approach could track the split track even though group split is not modeled, as the split track is tracked as a new track; however, there will be a big error in the initiation period of the new track. Compared with M2, M4 is superior in a whole, which indicates that the -GLMB filter based on a splitting model is better than the PHD one. While the target birth does not happen, M5 shows a better performance than M4 does, as the adaptive birth of M5 could reinitiate a new track when missing the track reappearance, while M4 could not.

The estimated number of groups is shown in Figure 3, where “truth” denotes the truth number of groups. It can be seen that M1 could not estimate the number of the split groups efficiently. For the other 4 approaches, there is a time delay while split happened, and the approaches with static birth have no time delay in target birth time. M5 has the most accurate estimation of the number of groups.

The -GLMB filter could obtain the track information of the target by labeling the target track, but the labeling error may exist; to measure the accuracy and stability of the approaches in labeling, we defined the labeling OSPA error. We define a label state as , where denotes the birth time of the track, denotes the split time of the track, and denotes the death time of the track. Let if splitting does not occur. Then, we could calculate the OSPA errors of the label states. Figure 4 shows the track labeling performance of M1 and M3-M5.

It can be seen from Figure 4 that M4 and M5 show a higher accuracy than M3, because when split happened, M4 and M5 treat the split tracks as a continuity of the original track, which is closer to the evolution of the target motion, while M3 treats the split tracks as a new track and neglects the correlations between the split tracks and the original track. We can see that a study on the label OSPA error will help the tracking system to grasp the evolution of the target motion and assist in the inference of the target intention.

6. Conclusions

A -GLMB filter based on the split model for multigroup target tracking is proposed in this paper, which derives the -GLMB form for group target tracking, and the introduction of the split model makes the group split addressed. There are two simplifications: split detection and component combination for adaptive birth, of which the former avoids the prediction of the target split in every iteration, and the latter decreases the number of the birth component, and both of the two simplify the computation significantly. Finally, track labeling the OSPA error is proposed, which provides a basis for track stability and accuracy measure. As the combination and splitting usually appear as a pair in group target motion, in future, the incorporation of the combination and the proposed filter may be worth having a try. Moreover, as the characteristics of group target is hard to obtain in the context of clutter and complex background conditions in prior, the implementation of machine leaning methods [3336] in group target tracking will be helpful for target identification, classification, and measurement partition and thus improve the tracking accuracy and efficiency; more attention is needed in the combination of machine learning method and group target tracking method in the future.

Appendix

A. The Proof of (23)

Given the multitarget posterior, let be a -GLMB [37]. The evolution of the multitarget state could be given by [38] where denotes a multitarget transition kernel.

Model the newborn groups’ set as a labeled RFS and distributed according to , the birth density is given by [37] where . Since ,

Using and from (A.2) and (21), respectively, and substituting (A.3) to (A.1), we have

Then, we have

Let

While , the inner summand is identical to zero. Hence, eq. (23) can be obtained.

B. The Proof of (27)

The density in eq. (23) is a joint distribution of all predicted components and could be expressed as

As , the survival but nonsplit and the newborn RFSs are mutually disjoint, but the split pair appears or not at the same time, then we have

Then using the approximation of from (25), we have

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare no conflict of interest.

Acknowledgments

This work was funded by the Young Scientists Fund of the National Natural Science Foundation of China under Grant No. 61703412 and Young Scientists Fund of the National Natural Science Foundation of China under Grant No. 61503407.

References

  1. M. Beard, S. Reuter, K. Granstrom, B. T. Vo, B. N. Vo, and A. Scheel, “Multiple extended target tracking with labeled random finite sets,” IEEE Transactions on Signal Processing, vol. 64, no. 7, pp. 1638–1653, 2016. View at: Publisher Site | Google Scholar
  2. L. Mihaylova, A. Y. Carmi, F. Septier, A. Gning, S. K. Pang, and S. Godsill, “Overview of Bayesian sequential Monte Carlo methods for group and extended object tracking,” Digital Signal Processing, vol. 25, pp. 1–16, 2014. View at: Publisher Site | Google Scholar
  3. A. Carmi, F. Septier, and S. J. Godsill, “The Gaussian mixture MCMC particle algorithm for dynamic cluster tracking,” Automatica, vol. 48, no. 10, pp. 2454–2467, 2012. View at: Publisher Site | Google Scholar
  4. K. Gilholm, S. Godsill, S. Maskell, and D. Salmond, “Poisson models for extended target and group tracking,” in Signal and Data Processing of Small Targets 2005, vol. 5913, pp. 230–241, Washington, USA, August 2005. View at: Publisher Site | Google Scholar
  5. D. J. Salmond and N. J. Gordon, “Group and extended object tracking,” in IEE Colloquium. Target Tracking: Algorithms and Applications, pp. 1611–1614, London, UK, 1999. View at: Google Scholar
  6. M. Feldmann, D. Franken, and W. Koch, “Tracking of extended objects and group targets using random matrices,” IEEE Transactions on Signal Processing, vol. 59, no. 4, pp. 1409–1420, 2011. View at: Publisher Site | Google Scholar
  7. J. Lan and X. R. Li, “Tracking of extended object or target group using random matrix: new model and approach,” IEEE Transactions on Aerospace and Electronic Systems, vol. 52, no. 6, pp. 2973–2989, 2016. View at: Publisher Site | Google Scholar
  8. W. Koch and M. Feldmann, “Cluster tracking under kinematical constraints using random matrices,” Robotics and Autonomous Systems, vol. 57, no. 3, pp. 296–309, 2009. View at: Publisher Site | Google Scholar
  9. M. Baum and U. D. Hanebeck, “Random hypersurface models for extended object tracking,” in 2009 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), pp. 178–183, Ajman, United Arab Emirates, December 2009. View at: Publisher Site | Google Scholar
  10. M. Baum and U. D. Hanebeck, “Shape tracking of extended objects and group targets with star-convex RHMs,” in International Conference on Information Fusion, pp. 338–−345, Chicago, USA, 2011. View at: Google Scholar
  11. M. Baum and U. D. Hanebeck, “Extended object tracking with random hypersurface models,” IEEE Transactions on Aerospace and Electronic Systems, vol. 50, no. 1, pp. 149–159, 2014. View at: Publisher Site | Google Scholar
  12. J. Steinbring, J. Baum, A. Zea, F. Faion, and U. D. Hanebeck, “A closed-form likelihood for particle filters to track extended objects with star-convex RHMs,” in 2015 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI), pp. 25–30, San Diego, USA, September 2015. View at: Publisher Site | Google Scholar
  13. K. Granstrom, C. Lundquist, F. Gustafsson, and U. Orguner, “Random set methods: estimation of multiple extended objects,” IEEE Robotics and Automation Magazine, vol. 21, no. 2, pp. 73–82, 2014. View at: Publisher Site | Google Scholar
  14. B. Ristic and J. Sherrah, “Bernoulli filter for detection and tracking of an extended object in clutter,” in 2013 IEEE Eighth International Conference on Intelligent Sensors, Sensor Networks and Information Processing, pp. 306–311, Melbourne, Australia, April 2013. View at: Google Scholar
  15. A. Swain and D. Clark, “The single-group PHD filter: an analytic solution,” in Conference on Information Fusion, pp. 1–8, Chicago, USA, 2011. View at: Google Scholar
  16. J. W. Koch, “Bayesian approach to extended object and cluster tracking using random matrices,” IEEE Transactions on Aerospace and Electronic Systems, vol. 44, no. 3, pp. 1042–1059, 2008. View at: Publisher Site | Google Scholar
  17. K. Granström and U. Orguner, “A PHD filter for tracking multiple extended targets using random matrices,” IEEE Transactions on Signal Processing, vol. 60, no. 11, pp. 5657–5671, 2012. View at: Publisher Site | Google Scholar
  18. K. Granström and U. Orguner, “On spawning and combination of extended/group targets modeled with random matrices,” IEEE Transactions on Signal Processing, vol. 61, no. 3, pp. 678–692, 2013. View at: Publisher Site | Google Scholar
  19. C. Lundquist, K. Granström, and U. Orguner, “An extended target CPHD filter and a gamma Gaussian inverse Wishart implementation,” IEEE Journal on Selected Topics in Signal Processing, vol. 7, no. 3, pp. 472–483, 2013. View at: Publisher Site | Google Scholar
  20. Y. Wang, G. P. Hu, and H. Zhou, “Group targets tracking using multiple models GGIW-CPHD based on best-fitting Gaussian approximation and strong tracking filter,” Journal of Sensors, vol. 2016, Article ID 7294907, 13 pages, 2016. View at: Publisher Site | Google Scholar
  21. B. T. Vo and B. N. Vo, “The para-normal Bayes multi-target filter and the spooky effect,” in International Conference on Information Fusion, pp. 173–180, Singapore, Singapore, 2012. View at: Google Scholar
  22. D. Franken, M. Schmidt, and M. Ulmke, ““Spooky action at a distance” in the cardinalized probability hypothesis density filter,” IEEE Transactions on Aerospace and Electronic Systems, vol. 45, no. 4, pp. 1657–1664, 2009. View at: Publisher Site | Google Scholar
  23. W. Si, L. Wang, and Z. Qu, “Multi-target tracking using an improved Gaussian mixture CPHD filter,” Sensors, vol. 16, no. 11, p. 1964, 2016. View at: Publisher Site | Google Scholar
  24. K. Granström and M. Baum, “Extended object tracking: introduction, overview and applications,” Journal of Advances in Information Fusion, vol. 12, no. 2, pp. 139–174, 2017. View at: Google Scholar
  25. M. Beard, B. T. Vo, and B. N. Vo, “Generalised labelled multi-Bernoulli forward-backward smoothing,” in International Conference on Information Fusion, pp. 688–694, Heidelberg, Germany, 2016. View at: Google Scholar
  26. M. Beard, B. T. Vo, B. N. Vo, and S. Arulampalam, “Void probabilities and Cauchy–Schwarz divergence for generalized labeled multi-Bernoulli models,” IEEE Transactions on Signal Processing, vol. 65, no. 19, pp. 5047–5061, 2017. View at: Publisher Site | Google Scholar
  27. F. Papi, B. N. Vo, B. T. Vo, C. Fantacci, and M. Beard, “Generalized labeled multi-Bernoulli approximation of multi-object densities,” IEEE Transactions on Signal Processing, vol. 63, no. 20, pp. 5487–5497, 2015. View at: Publisher Site | Google Scholar
  28. C. Liu, J. Sun, P. Lei, and Y. Qi, “δ-Generalized labeled multi-Bernoulli filter using amplitude information of neighboring cells,” Sensors, vol. 18, no. 4, article 1153, 2018. View at: Publisher Site | Google Scholar
  29. B. N. Vo, B. T. Vo, and D. Phung, “Labeled random finite sets and the Bayes multi-target tracking filter,” IEEE Transactions on Signal Processing, vol. 62, no. 24, pp. 6554–6567, 2014. View at: Publisher Site | Google Scholar
  30. D. S. Bryant, B. T. Vo, B. N. Vo, and B. A. Jones, “A generalized labeled multi-Bernoulli filter with object spawning,” 2017, http://arxiv.org/abs/1705.01614. View at: Google Scholar
  31. Q. Hu, H. Ji, and Y. Zhang, “Tracking of maneuvering non-ellipsoidal extended target with varying number of sub-objects,” Mechanical Systems and Signal Processing, vol. 99, pp. 262–284, 2018. View at: Publisher Site | Google Scholar
  32. S. Reuter, B. T. Vo, B. N. Vo, and K. Dietmayer, “The labeled multi-Bernoulli filter,” IEEE Transactions on Signal Processing, vol. 62, no. 12, pp. 3246–3260, 2014. View at: Publisher Site | Google Scholar
  33. B. Gao, P. Lu, W. L. Woo, G. Y. Tian, Y. Zhu, and M. Johnston, “Variational Bayesian sub-group adaptive sparse component extraction for diagnostic imaging system,” IEEE Transactions on Industrial Electronics, vol. 65, no. 10, pp. 8142–8152, 2018. View at: Publisher Site | Google Scholar
  34. B. Gao, W. L. Woo, and B. W. Ling, “Machine learning source separation using maximum a posteriori nonnegative matrix factorization,” IEEE Transactions on Cybernetics, vol. 44, no. 7, pp. 1169–1179, 2014. View at: Publisher Site | Google Scholar
  35. B. Gao, X. Li, W. L. Woo, and G. Tian, “Physics-based image segmentation using first order statistical properties and genetic algorithm for inductive thermography imaging,” IEEE Transactions on Image Processing, vol. 27, no. 5, pp. 2160–2175, 2018. View at: Publisher Site | Google Scholar
  36. Y. Zhang and H. Ji, “A robust and fast partitioning algorithm for extended target tracking using a Gaussian inverse Wishart PHD filter,” Knowledge-Based Systems, vol. 95, pp. 125–141, 2016. View at: Publisher Site | Google Scholar
  37. B. T. Vo and B. N. Vo, “Labeled random finite sets and multi-object conjugate priors,” IEEE Transactions on Signal Processing, vol. 61, no. 13, pp. 3460–3475, 2013. View at: Publisher Site | Google Scholar
  38. R. Mahler, Statistical Multisource-Multitarget Information Fusion, Artech House, Norwood, MA, 2007.

Copyright © 2019 Linhai Gan and Gang Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views488
Downloads263
Citations