19 research outputs found

    A Modified Bayesian Framework for Multi-Sensor Target Tracking with Out-of-Sequence-Measurements

    Get PDF
    Target detection and tracking is important in military as well as in civilian applications. In order to detect and track high-speed incoming threats, modern surveillance systems are equipped with multiple sensors to overcome the limitations of single-sensor based tracking systems. This research proposes the use of information from RADAR and Infrared sensors (IR) for tracking and estimating target state dynamics. A new technique is developed for information fusion of the two sensors in a way that enhances performance of the data association algorithm. The measurement acquisition and processing time of these sensors is not the same; consequently the fusion center measurements arrive out of sequence. To ensure the practicality of system, proposed algorithm compensates the Out of Sequence Measurements (OOSMs) in cluttered environment. This is achieved by a novel algorithm which incorporates a retrodiction based approach to compensate the effects of OOSMs in a modified Bayesian technique. The proposed modification includes a new gating strategy to fuse and select measurements from two sensors which originate from the same target. The state estimation performance is evaluated in terms of Root Mean Squared Error (RMSE) for both position and velocity, whereas, track retention statistics are evaluated to gauge the performance of the proposed tracking algorithm. The results clearly show that the proposed technique improves track retention and and false track discrimination (FTD)

    DIY Professional Development:renovating the education system or papering over the cracks?

    Get PDF

    Track-to-track association for intelligent vehicles by preserving local track geometry

    Get PDF
    Track-to-track association (T2TA) is a challenging task in situational awareness in intelligent vehicles and surveillance systems. In this paper, the problem of track-to-track association with sensor bias (T2TASB) is considered. Traditional T2TASB algorithms only consider a statistical distance cost between local tracks from different sensors, without exploiting the geometric relationship between one track and its neighboring ones from each sensor. However, the relative geometry among neighboring local tracks is usually stable, at least for a while, and thus helpful in improving the T2TASB. In this paper, we propose a probabilistic method, called the local track geometry preservation (LTGP) algorithm, which takes advantage of the geometry of tracks. Assuming that the local tracks of one sensor are represented by Gaussian mixture model (GMM) centroids, the corresponding local tracks of the other sensor are fitted to those of the first sensor. In this regard, a geometrical descriptor connectivity matrix is constructed to exploit the relative geometry of these tracks. The track association problem is formulated as a maximum likelihood estimation problem with a local track geometry constraint, and an expectation–maximization (EM) algorithm is developed to find the solution. Simulation results demonstrate that the proposed methods offer better performance than the state-of-the-art methods.The authors gratefully acknowledge the Autonomous Vision Group for providing the KITTI dataset. The authors also would like to thank the editors and referees for the valuable comments and suggestions.The Research Funds of Chongqing Science and Technology Commission, the National Natural Science Foundation of China, the Key Project of Crossing and Emerging Area of CQUPT, the Research Fund of young-backbone university teacher in Chongqing province, Chongqing Overseas Scholars Innovation Program, Wenfeng Talents of Chongqing University of Posts and Telecommunications, Innovation Team Project of Chongqing Education Committee, the National Key Research and Development Program, the Research and Innovation of Chongqing Postgraduate Project, the Lilong Innovation and Entrepreneurship Fund of Chongqing University of Posts and Telecommunications.http://www.mdpi.com/journal/sensorsam2021Electrical, Electronic and Computer Engineerin

    Feature-Based Probabilistic Data Association for Video-Based Multi-Object Tracking

    Get PDF
    This work proposes a feature-based probabilistic data association and tracking approach (FBPDATA) for multi-object tracking. FBPDATA is based on re-identification and tracking of individual video image points (feature points) and aims at solving the problems of partial, split (fragmented), bloated or missed detections, which are due to sensory or algorithmic restrictions, limited field of view of the sensors, as well as occlusion situations

    Efficient Kalman Filtering and Smoothing

    Get PDF
    The Kalman filter and Kalman smoother are important components in modern multitarget tracking systems. Their application are vast which include guidance, navigation and control of vehicles. On top of that, when the motion model is uncertain, MultipleModel approach can be combined with the filtering and smoothing method. However, with large amount of retrodiction window size, number of motion models and large number of targets, this process can become very computationally intensive and thus time consuming. Very often, real-time processing is needed in the world of tracking and therefore, this computational bottleneck become a problem. This is the motivation behind this thesis, to reduce the computational complexity when multi-target, multiwindow or multi-model applications are used. This thesis presents several approaches to tackle this multi-dimensional problems in terms of complexity while maintaining satisfactory precision. A natural step forward will be in leveraging the modern multi-core architectures. However, in order to parallelize such process, these algorithms have to be reformulated to be fitted into the parallel processors. In order to parallelise multi-target and multi-window scenario, this thesis introduce nested parallelism and prefix-sum algorithm to tackle the problem and realised this on Intel Knights Landing (KNL) Processor and OpenMP memory model. On the other hand, in the case of limited parallel resources, this thesis also develop alternatives called Fast Kalman smoother (FRTS) to lower the computation complexity due to multi-window problem. Specifically the smoother algorithm is reformulated such that it is computationally independent of number of window size in the fixed-lag configuration. Although the underlying mathematics is the same as the conventional approach, FRTS introduced numerical stability issue which makes the smoother unstable. Therefore, this thesis introduce the idea of condition number to monitor the deterioration rate in order to correct the numerical error once the pre-set threshold is breached. In addition to the large number of targets and retrodiction window size mentioned earlier, the number of models running simultaneously make the problem even more challenging in the perspective of real-time performance. Since such algorithms are the fundamental backbone of a large amount of multi-frame tracking algorithms, it would be beneficial to have a multi-model algorithm that is computationally independent to number of model utilised. Consequently, this thesis extend the FRTS concept to fixed-lag Multiple-Model smoothing method to achieve this goal. The proposed algorithms are compared and tested through an extensive and exhaustive set of evaluations against the literature, and discuss the relative merits. These evaluations show that these contributions pave a way to secure substantial performance gains for multi-dimensional tracking algorithms over conventional approaches

    Multiple Object Trajectory Estimation Using Backward Simulation

    Get PDF
    This paper presents a general solution for computing the multi-object posterior for sets of trajectories from a sequence of multi-object (unlabelled) filtering densities and a multi-object dynamic model. Importantly, the proposed solution opens an avenue of trajectory estimation possibilities for multi-object filters that do not explicitly estimate trajectories. In this paper, we first derive a general multi-trajectory backward smoothing equation based on random finite sets of trajectories. Then we show how to sample sets of trajectories using backward simulation for Poisson multi-Bernoulli filtering densities, and develop a tractable implementation based on ranked assignment. The performance of the resulting multi-trajectory particle smoothers is evaluated in a simulation study, and the results demonstrate that they have superior performance in comparison to several state-of-the-art multi-object filters and smoothers.Comment: Accepted for publication in IEEE Transactions on Signal Processin

    Elliptical Extended Object Tracking

    Get PDF

    Estimation, Decision and Applications to Target Tracking

    Get PDF
    This dissertation mainly consists of three parts. The first part proposes generalized linear minimum mean-square error (GLMMSE) estimation for nonlinear point estimation. The second part proposes a recursive joint decision and estimation (RJDE) algorithm for joint decision and estimation (JDE). The third part analyzes the performance of sequential probability ratio test (SPRT) when the log-likelihood ratios (LLR) are independent but not identically distributed. The linear minimum mean-square error (LMMSE) estimation plays an important role in nonlinear estimation. It searches for the best estimator in the set of all estimators that are linear in the measurement. A GLMMSE estimation framework is proposed in this disser- tation. It employs a vector-valued measurement transform function (MTF) and finds the best estimator among all estimators that are linear in MTF. Several design guidelines for the MTF based on a numerical example were provided. A RJDE algorithm based on a generalized Bayes risk is proposed in this dissertation for dynamic JDE problems. It is computationally efficient for dynamic problems where data are made available sequentially. Further, since existing performance measures for estimation or decision are effective to evaluate JDE algorithms, a joint performance measure is proposed for JDE algorithms for dynamic problems. The RJDE algorithm is demonstrated by applications to joint tracking and classification as well as joint tracking and detection in target tracking. The characteristics and performance of SPRT are characterized by two important functions—operating characteristic (OC) and average sample number (ASN). These two functions have been studied extensively under the assumption of independent and identically distributed (i.i.d.) LLR, which is too stringent for many applications. This dissertation relaxes the requirement of identical distribution. Two inductive equations governing the OC and ASN are developed. Unfortunately, they have non-unique solutions in the general case. They do have unique solutions in two special cases: (a) the LLR sequence converges in distributions and (b) the LLR sequence has periodic distributions. Further, the analysis can be readily extended to evaluate the performance of the truncated SPRT and the cumulative sum test

    Fusion of Data from Heterogeneous Sensors with Distributed Fields of View and Situation Evaluation for Advanced Driver Assistance Systems

    Get PDF
    In order to develop a driver assistance system for pedestrian protection, pedestrians in the environment of a truck are detected by radars and a camera and are tracked across distributed fields of view using a Joint Integrated Probabilistic Data Association filter. A robust approach for prediction of the system vehicles trajectory is presented. It serves the computation of a probabilistic collision risk based on reachable sets where different sources of uncertainty are taken into account
    corecore