| 基于SMC-PHDF的部分可分辨的群目标跟踪算法 |
| |
| 引用本文： | 连峰,韩崇昭,刘伟峰,元向辉.基于SMC-PHDF的部分可分辨的群目标跟踪算法[J].自动化学报,2010,36(5):731-741. |
| |
| 作者姓名： | 连峰 韩崇昭 刘伟峰 元向辉 |
| |
| 作者单位： | 1.西安交通大学电子与信息工程学院综合自动化研究所 西安 710049 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划)(2007CB311006);;国家自然科学基金(60574033)资助~~ |
| |
| 摘 要： | 提出一种基于粒子概率假设密度滤波器(Sequential Monte Carlo probability hypothesis density filter, SMC-PHDF)的部分可分辨的群目标跟踪算法. 该算法可直接获得群而非个体的个数和状态估计. 这里群的状态包括群的质心状态和形状. 为了估计群的个数和状态, 该算法利用高斯混合模型(Gaussian mixture models, GMM)拟合SMC-PHDF中经重采样后的粒子分布, 这里混合模型的元素个数和参数分别对应于群的个数和状态. 期望最大化(Expectation maximum, EM)算法和马尔科夫链蒙特卡洛(Markov chain Monte Carlo, MCMC)算法分别被用于估计混合模型的参数. 混合模型的元素个数可通过删除、合并及分裂算法得到. 100次蒙特卡洛(Monte Carlo, MC)仿真实验表明该算法可有效跟踪部分可分辨的群目标. 相比EM算法, MCMC算法能够更好地提取群的个数和状态, 但它的计算量要大于EM算法.
|
| 关 键 词： | 群目标跟踪 粒子概率假设密度滤波器 高斯混合模型 期望最大化算法 马尔科夫链蒙特卡洛算法 |
| 收稿时间： | 2009-3-6 |
| 修稿时间： | 2009-6-24 |
Tracking Partly Resolvable Group Targets Using SMC-PHDF |
| |
| LIAN Feng HAN Chong-Zhao LIU Wei-Feng YUAN Xiang-Hui.Tracking Partly Resolvable Group Targets Using SMC-PHDF[J].Acta Automatica Sinica,2010,36(5):731-741. |
| |
| Authors: | LIAN Feng HAN Chong-Zhao LIU Wei-Feng YUAN Xiang-Hui |
| |
| Affiliation: | 1.Institute of Integrated Automation, School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an 710049;2.School of Automation, Hangzhou Dianzi University, Hangzhou 310018 |
| |
| Abstract: | This paper proposes to track the partly resolvable groups using sequential Monte Carlo probability hypothesis density filter (SMC-PHDF). The estimate of the number and the states of the groups, rather than the individuals, are directly derived by the algorithm. The states of a group here consist of their centroid states and shapes. In order to estimate the number and the states of the groups, the proposed algorithm fits the distribution of the resampled particles of the SMC-PHDF via Gaussian mixture models (GMM), whose component number and parameters correspond to the number and the states of the groups. Expectation maximum (EM) and Markov chain Monte Carlo (MCMC) algorithms are respectively used to estimate the parameters of the mixture. The component number of the mixture is derived by the strategy of pruning, merging and splitting. 100 Monte Carlo (MC) simulations show that the proposed approach can track the partly resolvable groups effectively. Besides, the MCMC algorithm outperforms the EM algorithm significantly in extracting the number and the states of the groups, although its computational requirement is larger than the EM algorithm. |
| |
| Keywords: | Group targets tracking (GTT) sequential Monte Carlo probability hypothesis density filter (SMC-PHDF) Gaussian mixture models (GMM) expectation maximum (EM) Markov chain Monte Carlo (MCMC) |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
