DocumentCode
691141
Title
An Improved Greedy Matching Pursuit Algorithm for Multiple Target Localization
Author
Bing Cui ; Chun-hui Zhao ; Chi Feng ; Yun-log Xu
Author_Institution
Coll. of Inf. & Commun. Eng., Harbin Eng. Univ., Harbin, China
fYear
2013
fDate
21-23 Sept. 2013
Firstpage
926
Lastpage
930
Abstract
In this paper, an improved algorithm is proposed to estimate the multiple target location based on compressive sensing in wireless sensor networks. The targets may not exactly locate in the grid center point, which can induce localization errors. To improve the localization accuracy, we employ the multi-resolution analysis (MRA) to the greedy matching pursuit (GMP) algorithm. The proposed algorithm can estimate the target location with low computational complexity and high level of localization accuracy. The simulations show that the performance of the proposed algorithm outperforms that of the GMP algorithm.
Keywords
compressed sensing; computational complexity; greedy algorithms; target tracking; wireless sensor networks; compressive sensing; computational complexity; greedy matching pursuit algorithm; grid center point; multiple target localization; multiresolution analysis; wireless sensor networks; Algorithm design and analysis; Compressed sensing; Educational institutions; Matching pursuit algorithms; Signal processing algorithms; Vectors; Wireless sensor networks; compressive sensing; multiple target localization; wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Instrumentation, Measurement, Computer, Communication and Control (IMCCC), 2013 Third International Conference on
Conference_Location
Shenyang
Type
conf
DOI
10.1109/IMCCC.2013.206
Filename
6840596
Link To Document