首页> 外文会议>International Conference on Instrumentation, Measurement, Computer, Communication and Control >An Improved Greedy Matching Pursuit Algorithm for Multiple Target Localization
【24h】

An Improved Greedy Matching Pursuit Algorithm for Multiple Target Localization

机译:一种改进的多目标定位贪婪匹配追踪算法

获取原文

摘要

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.
机译:本文提出了一种改进的算法来估计无线传感器网络中的压缩感测的多目标位置。目标可能不完全定位在网格中心点中,这可以引起本地化误差。为了提高本地化准确性,我们采用多分辨率分析(MRA)贪婪匹配追求(GMP)算法。所提出的算法可以估计具有低计算复杂度和高级别的定位精度的目标位置。模拟表明,所提出的算法的性能优于GMP算法的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号