556 research outputs found

    Poisson multi-Bernoulli conjugate prior for multiple extended object filtering

    Full text link
    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

    Estimation and control of multi-object systems with high-fidenlity sensor models: A labelled random finite set approach

    Get PDF
    Principled and novel multi-object tracking algorithms are proposed, that have the ability to optimally process realistic sensor data, by accommodating complex observational phenomena such as merged measurements and extended targets. Additionally, a sensor control scheme based on a tractable, information theoretic objective is proposed, the goal of which is to optimise tracking performance in multi-object scenarios. The concept of labelled random finite sets is adopted in the development of these new techniques

    Robust Multi-target Tracking with Bootstrapped-GLMB Filter

    Get PDF
    This dissertation presents novel multi-target tracking algorithms that obviate the need for prior knowledge of system parameters such as clutter rate, detection probabilities, and birth models. Information on these parameters is unknown but important to tracking performance. The proposed algorithms exploit the advantages of existing RFS trackers and filters by bootstrapping them. This configuration inherits the efficiency of tracking target trajectories from the RFS trackers and low complexity in parameter estimation from the RFS filters

    Bayesian multiple extended target tracking using labelled random finite sets and splines

    Get PDF
    In this paper, we propose a technique for the joint tracking and labelling of multiple extended targets. 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. In particular, we developed a Poisson mixture variational Bayesian (PMVB) model to simultaneously estimate the measurement rate of multiple extended targets and extended target extension was modelled using B-splines. We evaluated our proposed method with various performance metrics. Results demonstrate the effectiveness of our approach

    Extended Object Tracking: Introduction, Overview and Applications

    Full text link
    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

    Advanced signal processing techniques for multi-target tracking

    Get PDF
    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

    Methods for Online UAV Path Planning for Tracking Multiple Objects

    Get PDF
    Unmanned aerial vehicles (UAVs) or drones have rapidly evolved to enable carrying various sensors such as thermal sensors for vision or antennas for radio waves. Therefore, drones can be transformative for applications such as surveillance and monitoring because they have the capability to greatly reduce the time and cost associated with traditional tasking methods. Realising this potential necessitates equipping UAVs with the ability to perform missions autonomously. This dissertation considers the problems of online path planning for UAVs for the fundamental task of surveillance comprising of tracking and discovering multiple mobile objects in a scene. Tracking and discovering an unknown and time-varying number of objects is a challenging problem in itself. Objects such as people or wildlife tend to switch between various modes of movements. Measurements received by the UAV’s on-board sensors are often very noisy. In practice, the on-board sensors have a limited field of view (FoV), hence, the UAV needs to move within range of the mobile objects that are scattered throughout a scene. This is extremely challenging because neither the exact number nor locations of the objects of interest are available to the UAV. Planning the path for UAVs to effectively detect and track multi-objects in such environments poses additional challenges. Path planning techniques for tracking a single object are not applicable. Since there are multiple moving objects appearing and disappearing in the region, following only certain objects to localise them accurately implies that a UAV is likely to miss many other objects. Furthermore, online path planning for multi-UAVs remains challenging due to the exponential complexity of multi-agent coordination problems. In this dissertation, we consider the problem of online path planning for UAV-based localisation and tracking of multi-objects. First, we realised a low cost on-board radio receiver system on aUAV and demonstrated the capability of the drone-based platform for autonomously tracking and locating multiple mobile radio-tagged objects in field trials. Second, we devised a track-before-detect filter coupled with an online path planning algorithm for joint detection and tracking of radio-tagged objects to achieve better performance in noisy environments. Third, we developed a multi-objective planning algorithm for multi-agents to track and search multi-objects under the practical constraint of detection range limited on-board sensors (or FoV limited sensors). Our formulation leads to a multi-objective value function that is a monotone submodular set function. Consequently, it allows us to employ a greedy algorithm for effectively controlling multi-agents with a performance guarantee for tracking discovered objects while searching for undiscovered mobile objects under practical constraints of limited FoV sensors. Fourth, we devised a fast distributed tracking algorithm that can effectively track multi-objects for a network of stationary agents with different FoVs. This is the first such solution to this problem. The proposed method can significantly improve capabilities of a network of agents to track a large number of objects moving in and out of the limited FoV of the agents’ sensors compared to existing methods that do not consider the problem of unknown and limited FoV of sensors.Thesis (Ph.D.) -- University of Adelaide, School of Computer Science, 202
    • …
    corecore