Poisson multi-Bernoulli conjugate prior for multiple extended object filtering

This paper presents a Poisson multi-Bernoulli mixture (PMBM) conjugate prior for multiple extended object filtering. A Poisson point process is used to describe the existence of yet undetected targets, while a multi-Bernoulli mixture describes the distribution of the targets that have been detected. The prediction and update equations are presented for the standard transition density and measurement likelihood. Both the prediction and the update preserve the PMBM form of the density, and in this sense the PMBM density is a conjugate prior. However, the unknown data associations lead to an intractably large number of terms in the PMBM density, and approximations are necessary for tractability. A gamma Gaussian inverse Wishart implementation is presented, along with methods to handle the data association problem. A simulation study shows that the extended target PMBM filter performs well in comparison to the extended target d-GLMB and LMB filters. An experiment with Lidar data illustrates the benefit of tracking both detected and undetected targets

Tracking Target Signal Strengths on a Grid using Sparsity

Multi-target tracking is mainly challenged by the nonlinearity present in the measurement equation, and the difficulty in fast and accurate data association. To overcome these challenges, the present paper introduces a grid-based model in which the state captures target signal strengths on a known spatial grid (TSSG). This model leads to \emph{linear} state and measurement equations, which bypass data association and can afford state estimation via sparsity-aware Kalman filtering (KF). Leveraging the grid-induced sparsity of the novel model, two types of sparsity-cognizant TSSG-KF trackers are developed: one effects sparsity through $\ell_1$-norm regularization, and the other invokes sparsity as an extra measurement. Iterative extended KF and Gauss-Newton algorithms are developed for reduced-complexity tracking, along with accurate error covariance updates for assessing performance of the resultant sparsity-aware state estimators. Based on TSSG state estimates, more informative target position and track estimates can be obtained in a follow-up step, ensuring that track association and position estimation errors do not propagate back into TSSG state estimates. The novel TSSG trackers do not require knowing the number of targets or their signal strengths, and exhibit considerably lower complexity than the benchmark hidden Markov model filter, especially for a large number of targets. Numerical simulations demonstrate that sparsity-cognizant trackers enjoy improved root mean-square error performance at reduced complexity when compared to their sparsity-agnostic counterparts.Comment: Submitted to IEEE Trans. on Signal Processin

A Target Detection and Tracking Method for Multiple Radar Systems

Multiple radar systems represent an attractive option for target tracking because they can significantly enlarge the area coverage and improve both the probability of trajectory detection and the localization accuracy. The presence of multiple extended targets or weak targets is a challenge for multiple radar systems. Moreover, their performance may be severely deteriorated by regions characterized by a high clutter density. In this article, an algorithm for detection and tracking of multiple targets, extended or weak, based on measurements provided by multiple radars in an environment with heavily cluttered regions, is proposed. The proposed method features three stages. In the first stage, past measurements are exploited to build a spatiotemporal clutter map in each radar; a weight is then assigned to each measurement to assess its significance. In the second stage, a track-before-detect algorithm, based on a weighted 3-D Hough transform, is applied to obtain target tracklets. In the third stage, a low-complexity tracklet association method, exploiting a lion reproduction model, is applied to associate tracklets of the same target. Three experiments are presented to illustrate the effectiveness of the proposed approach. The first experiment is based on synthetic data, the second one is based on actual data from a radar network with two homogeneous air surveillance radars, and the third one is based on actual data from a radar network with four different marine surveillance radars. The results reveal that the proposed method can outperform competing approaches

Advanced signal processing techniques for multi-target tracking

The multi-target tracking problem essentially involves the recursive joint estimation of the state of unknown and time-varying number of targets present in a tracking scene, given a series of observations. This problem becomes more challenging because the sequence of observations is noisy and can become corrupted due to miss-detections and false alarms/clutter. Additionally, the detected observations are indistinguishable from clutter. Furthermore, whether the target(s) of interest are point or extended (in terms of spatial extent) poses even more technical challenges. An approach known as random finite sets provides an elegant and rigorous framework for the handling of the multi-target tracking problem. With a random finite sets formulation, both the multi-target states and multi-target observations are modelled as finite set valued random variables, that is, random variables which are random in both the number of elements and the values of the elements themselves. Furthermore, compared to other approaches, the random finite sets approach possesses a desirable characteristic of being free of explicit data association prior to tracking. In addition, a framework is available for dealing with random finite sets and is known as finite sets statistics. In this thesis, advanced signal processing techniques are employed to provide enhancements to and develop new random finite sets based multi-target tracking algorithms for the tracking of both point and extended targets with the aim to improve tracking performance in cluttered environments. To this end, firstly, a new and efficient Kalman-gain aided sequential Monte Carlo probability hypothesis density (KG-SMC-PHD) filter and a cardinalised particle probability hypothesis density (KG-SMC-CPHD) filter are proposed. These filters employ the Kalman- gain approach during weight update to correct predicted particle states by minimising the mean square error between the estimated measurement and the actual measurement received at a given time in order to arrive at a more accurate posterior. This technique identifies and selects those particles belonging to a particular target from a given PHD for state correction during weight computation. The proposed SMC-CPHD filter provides a better estimate of the number of targets. Besides the improved tracking accuracy, fewer particles are required in the proposed approach. Simulation results confirm the improved tracking performance when evaluated with different measures. Secondly, the KG-SMC-(C)PHD filters are particle filter (PF) based and as with PFs, they require a process known as resampling to avoid the problem of degeneracy. This thesis proposes a new resampling scheme to address a problem with the systematic resampling method which causes a high tendency of resampling very low weight particles especially when a large number of resampled particles are required; which in turn affect state estimation. Thirdly, the KG-SMC-(C)PHD filters proposed in this thesis perform filtering and not tracking , that is, they provide only point estimates of target states but do not provide connected estimates of target trajectories from one time step to the next. A new post processing step using game theory as a solution to this filtering - tracking problem is proposed. This approach was named the GTDA method. This method was employed in the KG-SMC-(C)PHD filter as a post processing technique and was evaluated using both simulated and real data obtained using the NI-USRP software defined radio platform in a passive bi-static radar system. Lastly, a new technique for the joint tracking and labelling of multiple extended targets is proposed. To achieve multiple extended target tracking using this technique, models for the target measurement rate, kinematic component and target extension are defined and jointly propagated in time under the generalised labelled multi-Bernoulli (GLMB) filter framework. The GLMB filter is a random finite sets-based filter. In particular, a Poisson mixture variational Bayesian (PMVB) model is developed to simultaneously estimate the measurement rate of multiple extended targets and extended target extension was modelled using B-splines. The proposed method was evaluated with various performance metrics in order to demonstrate its effectiveness in tracking multiple extended targets

Efficient LiDAR-trajectory affinity model for autonomous vehicle orchestration.

Computation and memory resource management strategies are the backbone of continuous object tracking in intelligent vehicle orchestration. Multi-object tracking generates enormous measurements of targets and extended object positions using light detection and ranging (Lidar) sensors. Designing an adequate object-tracking system is a global challenge because of dynamic object detection and data association uncertainties during scene understanding. In this regard, we develop an intelligent multi-objective tracking (IMOT) system with a novel measurement model, called the box data association inflate (BDAI) model, to assess each target's object state and trajectory without noise by using the Bayesian approach. The box object filter method filters ambiguous detection responses during data association. The theoretical proof of the box object filter is derived based on binomial expansion. Prognosticating a lower-dimension object than the original point object reduces the computational complexity of vehicle orchestration. Two datasets (NuScenes dataset and our lab dataset) are considered during the simulations, and our approach measures the kinematic states adequately with reduced computation complexity compared to state-of-the-art methods. The simulation outcomes show that our proposed method is effective and works well to detect and track objects. The NuScenes dataset contains 28130 samples for training, 6019 examples for validation and 6008 samples for testing. IMOT achieves 58.09% tracking accuracy and 71% mAP with 5 ms pre-processing time. The Jetson Xavier NX consumes 49.63% GPU and 9.37% average power and exhibits 25.32 ms latency compared to other approaches. Our system trains a single pair frame in 169.71 ms with affinity estimation time of 12.19 ms, track association time of 0.19 ms and mATE of 0.245 compared to state-of-the-art approaches

Extended Object Tracking: Introduction, Overview and Applications

This article provides an elaborate overview of current research in extended object tracking. We provide a clear definition of the extended object tracking problem and discuss its delimitation to other types of object tracking. Next, different aspects of extended object modelling are extensively discussed. Subsequently, we give a tutorial introduction to two basic and well used extended object tracking approaches - the random matrix approach and the Kalman filter-based approach for star-convex shapes. The next part treats the tracking of multiple extended objects and elaborates how the large number of feasible association hypotheses can be tackled using both Random Finite Set (RFS) and Non-RFS multi-object trackers. The article concludes with a summary of current applications, where four example applications involving camera, X-band radar, light detection and ranging (lidar), red-green-blue-depth (RGB-D) sensors are highlighted.Comment: 30 pages, 19 figure

A box particle filter method for tracking multiple extended objects

Extended objects generate a variable number of multiple measurements. In contrast with point targets, extended objects are characterized with their size or volume, and orientation. Multiple object tracking is a notoriously challenging problem due to complexities caused by data association. This paper develops a box particle filter method for multiple extended object tracking, and for the first time it is shown how interval based approaches can deal efficiently with data association problems and reduce the computational complexity of the data association. The box particle filter relies on the concept of a box particle. A box particle represents a random sample and occupies a controllable rectangular region of non-zero volume in the object state space. A theoretical proof of the generalized likelihood of the box particle filter for multiple extended objects is given based on a binomial expansion. Next the performance of the box particle filter is evaluated using a challenging experiment with the appearance and disappearance of objects within the area of interest, with real laser rangefinder data. The box particle filter is compared with a state-of-the-art particle filter with point particles. Accurate and robust estimates are obtained with the box particle filter, both for the kinematic states and extent parameters, with significant reductions in computational complexity. The box particle filter reduction of computational time is at least 32% compared with the particle filter working with point particles for the experiment presented. Another advantage of the box particle filter is its robustness to initialization uncertaint

Multi-camera Realtime 3D Tracking of Multiple Flying Animals

Automated tracking of animal movement allows analyses that would not otherwise be possible by providing great quantities of data. The additional capability of tracking in realtime - with minimal latency - opens up the experimental possibility of manipulating sensory feedback, thus allowing detailed explorations of the neural basis for control of behavior. Here we describe a new system capable of tracking the position and body orientation of animals such as flies and birds. The system operates with less than 40 msec latency and can track multiple animals simultaneously. To achieve these results, a multi target tracking algorithm was developed based on the Extended Kalman Filter and the Nearest Neighbor Standard Filter data association algorithm. In one implementation, an eleven camera system is capable of tracking three flies simultaneously at 60 frames per second using a gigabit network of nine standard Intel Pentium 4 and Core 2 Duo computers. This manuscript presents the rationale and details of the algorithms employed and shows three implementations of the system. An experiment was performed using the tracking system to measure the effect of visual contrast on the flight speed of Drosophila melanogaster. At low contrasts, speed is more variable and faster on average than at high contrasts. Thus, the system is already a useful tool to study the neurobiology and behavior of freely flying animals. If combined with other techniques, such as `virtual reality'-type computer graphics or genetic manipulation, the tracking system would offer a powerful new way to investigate the biology of flying animals.Comment: pdfTeX using libpoppler 3.141592-1.40.3-2.2 (Web2C 7.5.6), 18 pages with 9 figure