New clustering methods are proposed to develop novel particle filters with Gaussian mixture models (PFGMM). In the PFGMM, the propagated samples are clustered to recover a Gaussian mixture model (GMM) using a clustering algorithm, which plays a fundamental role in the filter’s performance. Two clustering methods are introduced that simultaneously minimize the covariance of each of the GMM components and maximize the likelihood function. Under the scenarios considered in this article, it is shown through numerical simulation that the PFGMMs with the proposed clustering algorithms lead to better performance than the PFGMM employing the K-means or the expectation-maximization algorithms as well as the regularized particle filter (PF) and the Gaussian sum PF.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Clustering Methods for Particle Filters With Gaussian Mixture Models


    Contributors:


    Publication date :

    2022-04-01


    Size :

    1205697 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Distributed Cubature Gaussian Mixture Filters

    JIa, Bin / Xin, Ming / Sun, Tao | AIAA | 2017


    Fusing heterogeneous traffic data by Kalman filters and Gaussian mixture models

    Chunhui Wang / Qianqian Zhu / Zhenyu Shan et al. | IEEE | 2014


    Simultaneous high-dimensional clustering and feature selection using asymmetric Gaussian mixture models

    Elguebaly, T. / Bouguila, N. | British Library Online Contents | 2015


    Rao-Blackwellized particle filtering with Gaussian mixture models for robust visual tracking

    Kim, J. / Lin, Z. / Kweon, I. S. | British Library Online Contents | 2014