An improved greedy matching pursuit algorithm for multiple target localization

Bing Cui, Chun Hui Zhao, Chi Feng, Yun Long Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2013
PublisherIEEE Computer Society
Pages926-930
Number of pages5
ISBN (Print)9780769551227
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event3rd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2013 - Shenyang, Liaoning, China
Duration: 21 Sept 201323 Sept 2013

Publication series

NameProceedings - 3rd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2013

Conference

Conference3rd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2013
Country/TerritoryChina
CityShenyang, Liaoning
Period21/09/1323/09/13

Keywords

  • compressive sensing
  • multiple target localization
  • wireless sensor networks

Fingerprint

Dive into the research topics of 'An improved greedy matching pursuit algorithm for multiple target localization'. Together they form a unique fingerprint.

Cite this