期刊名称:International Journal of Computer Science Issues
印刷版ISSN:1694-0784
电子版ISSN:1694-0814
出版年度:2011
卷号:8
期号:3
出版社:IJCSI Press
摘要:In this paper, a new method, named optimum innovation data association (OI-DA), is proposed to give the nearest neighbor data association the ability to track maneuvering multi- target in dense clutter environment. Using the measurements of two successive scan and depending on the basic principle of moving target indicator (MTI) filter, the proposed algorithm avoids measurements in the gate size of predicted target position that are not originated from the target and detects the candidate measurement with the lowest probability of error. The finding of optimum innovation corresponding to the candidate valid measurement increases the data association performance compared to nearest neighbor (NN) filter. Simulation results show the effectiveness and better performance when compared to conventional algorithms as NNKF and JPDAF.