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

Extended Kalman filtering with stochastic nonlinearities and multiple missing measurements

Copyright @ 2012 ElsevierIn this paper, the extended Kalman filtering problem is investigated for a class of nonlinear systems with multiple missing measurements over a finite horizon. Both deterministic and stochastic nonlinearities are included in the system model, where the stochastic nonlinearities are described by statistical means that could reflect the multiplicative stochastic disturbances. The phenomenon of measurement missing occurs in a random way and the missing probability for each sensor is governed by an individual random variable satisfying a certain probability distribution over the interval [0,1]. Such a probability distribution is allowed to be any commonly used distribution over the interval [0,1] with known conditional probability. The aim of the addressed filtering problem is to design a filter such that, in the presence of both the stochastic nonlinearities and multiple missing measurements, there exists an upper bound for the filtering error covariance. Subsequently, such an upper bound is minimized by properly designing the filter gain at each sampling instant. It is shown that the desired filter can be obtained in terms of the solutions to two Riccati-like difference equations that are of a form suitable for recursive computation in online applications. An illustrative example is given to demonstrate the effectiveness of the proposed filter design scheme.This work was supported in part by the National 973 Project under Grant 2009CB320600, National Natural Science Foundation of China under Grants 61028008, 61134009 and 60825303, the State Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

The shifted Rayleigh mixture filter for bearings-only tracking of maneuvering targets

Published versio

Conditional Posterior Cramer-Rao Lower Bound and Distributed Target Tracking in Sensor Networks

Sequential Bayesian estimation is the process of recursively estimating the state of a dynamical system observed in the presence of noise. Posterior Cramer-Rao lower bound (PCRLB) sets a performance limit onany Bayesian estimator for the given dynamical system. The PCRLBdoes not fully utilize the existing measurement information to give anindication of the mean squared error (MSE) of the estimator in the future. In many practical applications, we are more concerned with the value of the bound in the future than in the past. PCRLB is an offline bound, because it averages out the very useful measurement information, which makes it an off-line bound determined only by the system dynamical model, system measurement model and the prior knowledge of the system state at the initial time. This dissertation studies the sequential Bayesian estimation problem and then introduces the notation of conditional PCRLB, which utilizes the existing measurement information up to the current time, and sets the limit on the MSE of any Bayesian estimators at the next time step. This work has two emphases: firstly, we give the mathematically rigorous formulation of the conditional PCRLB as well as the approximate recursive version of conditional PCRLB for nonlinear, possibly non-Gaussian dynamical systems. Secondly, we apply particle filter techniques to compute the numerical values of the conditional PCRLB approximately, which overcomes the integration problems introduced by nonlinear/non-Gaussian systems. Further, we explore several possible applications of the proposed bound to find algorithms that provide improved performance. The primary problem of interest is the sensor selection problem for target tracking in sensor networks. Comparisons are also made between the performance of sensor selection algorithm based on the proposed bound and the existing approaches, such as information driven, nearest neighbor, and PCRLB with renewal strategy, to demonstrate the superior performances of the proposed approach. This dissertation also presents a bandwidth-efficient algorithm for tracking a target in sensor networks using distributed particle filters. This algorithm distributes the computation burden for target tracking over the sensor nodes. Each sensor node transmits a compressed local tracking result to the fusion center by a modified expectationmaximization (EM) algorithm to save the communication bandwidth. The fusion center incorporates the compressed tracking results to give the estimate of the target state. Finally, the target tracking problem in heterogeneous sensor networks is investigated extensively. Extended Kalman Filter and particle filter techniques are implemented and compared for tracking a maneuvering