quotation:		[Copy]
		Weihua QIN,Fei HU,Chaoyin QIN.[en_title][J].Control Theory and Technology,2005,3(4):383~386.[Copy]

This Paper:Browse 825 Download 113	码上扫一扫！

WeihuaQIN,FeiHU,ChaoyinQIN
0 Fontlarge +\|Default\|Small
()

摘要:

关键词:

DOI：

Received:October 09, 2004Revised:September 05, 2005

基金项目:

A new fast algorithm f or multitarget t racking in dense clutter

Weihua QIN , Fei HU , Chaoyin QIN

(Department of Computer Science and Engineering ,Northwestern Polytechnic University , Xi’an Shaanxi 710072 , China ;Department of Applied Mathematics ,Northwestern Polytechnic University , Xi’an Shaanxi 710072 , China)

Abstract:

A fast joint probabilistic data association (FJPDA) algorithm is proposed in this paper. Cluster probability matrix is approximately calculated by a new method , whose elements βti( K) can be taken as evaluation functions. According to values of βti ( K) , N events with larger joint probabilities can be searched out as the events with guiding joint probabilities , thus , the number of searching nodes will be greatly reduced. As a result ,this method effectively reduces the calculation load and makes it possible to be realized on real- time. Theoretical analysis and Monte Carlo simulation results show that this method is efficient .

Key words: Data association Multitarget tracking Cluster probability matrix Search- tree