20,928 research outputs found

    Bayesian-based techniques for tracking multiple humans in an enclosed environment

    Get PDF
    This thesis deals with the problem of online visual tracking of multiple humans in an enclosed environment. The focus is to develop techniques to deal with the challenges of varying number of targets, inter-target occlusions and interactions when every target gives rise to multiple measurements (pixels) in every video frame. This thesis contains three different contributions to the research in multi-target tracking. Firstly, a multiple target tracking algorithm is proposed which focuses on mitigating the inter-target occlusion problem during complex interactions. This is achieved with the help of a particle filter, multiple video cues and a new interaction model. A Markov chain Monte Carlo particle filter (MCMC-PF) is used along with a new interaction model which helps in modeling interactions of multiple targets. This helps to overcome tracking failures due to occlusions. A new weighted Markov chain Monte Carlo (WMCMC) sampling technique is also proposed which assists in achieving a reduced tracking error. Although effective, to accommodate multiple measurements (pixels) produced by every target, this technique aggregates measurements into features which results in information loss. In the second contribution, a novel variational Bayesian clustering-based multi-target tracking framework is proposed which can associate multiple measurements to every target without aggregating them into features. It copes with complex inter-target occlusions by maintaining the identity of targets during their close physical interactions and handles efficiently a time-varying number of targets. The proposed multi-target tracking framework consists of background subtraction, clustering, data association and particle filtering. A variational Bayesian clustering technique groups the extracted foreground measurements while an improved feature based joint probabilistic data association filter (JPDAF) is developed to associate clusters of measurements to every target. The data association information is used within the particle filter to track multiple targets. The clustering results are further utilised to estimate the number of targets. The proposed technique improves the tracking accuracy. However, the proposed features based JPDAF technique results in an exponential growth of computational complexity of the overall framework with increase in number of targets. In the final work, a novel data association technique for multi-target tracking is proposed which more efficiently assigns multiple measurements to every target, with a reduced computational complexity. A belief propagation (BP) based cluster to target association method is proposed which exploits the inter-cluster dependency information. Both location and features of clusters are used to re-identify the targets when they emerge from occlusions. The proposed techniques are evaluated on benchmark data sets and their performance is compared with state-of-the-art techniques by using, quantitative and global performance measures

    Improved Multi Target Tracking in MIMO Radar System Using New Hybrid Monte Carlo–PDAF Algorithm

    Get PDF
    This article deals with the multi-target tracking problem (MTT) in MIMO radar systems. As a result, this problem is now seen as a new technological challenge. Thus, in different tracking scenarios, measurements from sensors are usually subject to a complex data association issue. The MTT data association problem of assigning measurements-to-target or target-state-estimates becomes more complex in MIMO radar system, once the crossing target tracking scenario arises, hence the interference phenomenon may interrupt the received signal and miss the state estimation process. To avoid most of these problems, we have improved a new hybrid algorithm based on particle filter called “Monte Carlo” associated to Joint Probabilistic data Association filter (JPDAF), the whole approach named MC-JPDAF algorithm has been proposed to replace the traditional method as is known by the Extended KALMAN filter (EKF) combined with JPDAF method, such as EKF-JPDAF algorithm. The obtained experimental results showed a challenging remediation. Where, the MC-JPDAF converges towards the accurate state estimation. Thus, more efficient than EKF-JPDAF. The simulation results prove that the designed system meets the objectives set for MC-JPDA by referring to an experimental database using the MATLAB Software Development Framework

    Path sampling for particle filters with application to multi-target tracking

    Full text link
    In recent work (arXiv:1006.3100v1), we have presented a novel approach for improving particle filters for multi-target tracking. The suggested approach was based on drift homotopy for stochastic differential equations. Drift homotopy was used to design a Markov Chain Monte Carlo step which is appended to the particle filter and aims to bring the particle filter samples closer to the observations. In the current work, we present an alternative way to append a Markov Chain Monte Carlo step to a particle filter to bring the particle filter samples closer to the observations. Both current and previous approaches stem from the general formulation of the filtering problem. We have used the currently proposed approach on the problem of multi-target tracking for both linear and nonlinear observation models. The numerical results show that the suggested approach can improve significantly the performance of a particle filter.Comment: Minor corrections, 23 pages, 8 figures. This is a companion paper to arXiv:1006.3100v

    A track-before-detect labelled multi-Bernoulli particle filter with label switching

    Full text link
    This paper presents a multitarget tracking particle filter (PF) for general track-before-detect measurement models. The PF is presented in the random finite set framework and uses a labelled multi-Bernoulli approximation. We also present a label switching improvement algorithm based on Markov chain Monte Carlo that is expected to increase filter performance if targets get in close proximity for a sufficiently long time. The PF is tested in two challenging numerical examples.Comment: Accepted for publication in IEEE Transactions on Aerospace and Electronic System
    corecore