[1] Nanjing Univ Posts & Telecommun, Coll Telecommun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
来源:
PROCEEDINGS OF THE 2015 10TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA CHINACOM 2015
|
2015年
关键词:
compressed sensing;
target localization;
the false alarm probability;
the missing probability;
greedy matching pursuit (GMP) algorithm;
D O I:
暂无
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
In order to improve the identification performance under unknown target population conditions, a new greedy matching pursuit algorithm (GMP) based localization algorithm is proposed. First of all, based on the possible target position estimations by traditional GMP algorithm, a redefined threshold is proposed to choose more possible target positions from the remaining grids. So the missing probability can be improved. Afterwards, the least square (LS) method is utilized to remove several outliers of the target position estimations and then the false alarm probability can be reduced. Simulation results illustrate that the proposed algorithm has better target identification ability than traditional GMP approach in unknown target population scenarios.