针对杂波环境下的多目标跟踪数据关联存在跟踪精度低、实时性差的问题,提出了一种基于最大熵模糊聚类的联合概率数据关联算法(joint probabilistic data association algorithm based on maximum entropy fuzzy clustering,MEFC-JPDA)...针对杂波环境下的多目标跟踪数据关联存在跟踪精度低、实时性差的问题,提出了一种基于最大熵模糊聚类的联合概率数据关联算法(joint probabilistic data association algorithm based on maximum entropy fuzzy clustering,MEFC-JPDA)。首先,采用最大熵模糊聚类求得的隶属度初步表征目标与有效量测之间的关联概率。其次,采用基于目标距离的量测修正因子对关联概率进行调整,并建立关联概率矩阵。最后,结合卡尔曼滤波算法,对目标的状态进行加权更新。仿真结果表明,所提算法在杂波环境下的跟踪性能相比现有的两种关联算法有较大提升,是一种有效的多目标跟踪数据关联算法。展开更多
Constructing a batch of differentiable entropy functions touniformly approximate an objective function by means of the maximum-entropy principle, a new clustering algorithm, called maximum-entropy clustering algorithm...Constructing a batch of differentiable entropy functions touniformly approximate an objective function by means of the maximum-entropy principle, a new clustering algorithm, called maximum-entropy clustering algorithm, is proposed based on optimization theory. This algorithm is a soft generalization of the hard C-means algorithm and possesses global convergence. Its relations with other clustering algorithms are discussed.展开更多
文摘针对杂波环境下的多目标跟踪数据关联存在跟踪精度低、实时性差的问题,提出了一种基于最大熵模糊聚类的联合概率数据关联算法(joint probabilistic data association algorithm based on maximum entropy fuzzy clustering,MEFC-JPDA)。首先,采用最大熵模糊聚类求得的隶属度初步表征目标与有效量测之间的关联概率。其次,采用基于目标距离的量测修正因子对关联概率进行调整,并建立关联概率矩阵。最后,结合卡尔曼滤波算法,对目标的状态进行加权更新。仿真结果表明,所提算法在杂波环境下的跟踪性能相比现有的两种关联算法有较大提升,是一种有效的多目标跟踪数据关联算法。
基金This work was supported by the National Natural Science Foundation of China (Grant No. 69735010) the Doctorate Foundation of Xi' an Jiaotong University.
文摘Constructing a batch of differentiable entropy functions touniformly approximate an objective function by means of the maximum-entropy principle, a new clustering algorithm, called maximum-entropy clustering algorithm, is proposed based on optimization theory. This algorithm is a soft generalization of the hard C-means algorithm and possesses global convergence. Its relations with other clustering algorithms are discussed.
