Extended Target Tracking with Clustering of Measurement Partitioning
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A novel K-means algorithm of measurement partitioning is proposed to overcome the problem of distance partitioning algorithm in Gaussian mixture probability hypothesis density filter for extended target tracking. The number of the targets is estimated by maximum-likelihood estimator and then the estimates of the target number are used as the cluster number of K-means. An elliptical gate is introduced to remove the clutter measurements for depressing the influence of clusters. Simulation results show that the proposed algorithm reduces the computational complexity obviously, and obtains an improved performance.

    Reference
    Related
    Cited by
Get Citation

Zhang Tao, Lai Ran, Wu Renbiao. Extended Target Tracking with Clustering of Measurement Partitioning[J].,2017,32(1):78-85.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: April 09,2018
  • Published:
Article QR Code