Weakly Matching Pursuit Denoising Recovery for Compressed Sensing Based on Kalman Filtering

TIAN Wen-biao; KANG Jian; ZHANG Yang; RUI Guo-sheng; ZHANG Hai-bo

doi:10.3969/j.issn.0372-2112.2014.06.004

您当前的位置：

首页 >

文章列表页 >

Weakly Matching Pursuit Denoising Recovery for Compressed Sensing Based on Kalman Filtering

更新时间：2025-07-16

- Weakly Matching Pursuit Denoising Recovery for Compressed Sensing Based on Kalman Filtering
- Acta Electronica Sinica Vol. 42, Issue 6, Pages: 1061-1067(2014)
- 作者机构：
  
  海军航空工程学院信号与信息处理山东省重点实验室,山东,烟台,264001
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2014.06.004
  CLC： TN911.73
- Published：2014
- 稿件说明：
移动端阅览
TIAN Wen-biao, KANG Jian, ZHANG Yang, et al. Weakly Matching Pursuit Denoising Recovery for Compressed Sensing Based on Kalman Filtering[J]. Acta Electronica Sinica, 2014, 42(6): 1061-1067.
DOI：

TIAN Wen-biao, KANG Jian, ZHANG Yang, et al. Weakly Matching Pursuit Denoising Recovery for Compressed Sensing Based on Kalman Filtering[J]. Acta Electronica Sinica, 2014, 42(6): 1061-1067. DOI： 10.3969/j.issn.0372-2112.2014.06.004.

摘要

现有的贪婪迭代类压缩感知重构算法均基于最小二乘对信号进行波形估计，未考虑到可能将量测噪声引入信号估计的情况.针对以上不足，提出了一种基于线性Kalman滤波的压缩感知弱匹配去噪重构算法.该算法不需已知稀疏度先验，通过引入Kalman滤波，在最小均方误差准则下，每次迭代都获得最佳信号估计；并以弱匹配的方式同时筛选出有效的原子，并剔除冗余原子进而重构原信号.新算法继承了现有贪婪迭代类算法的有效性，同时避免了因噪声干扰或稀疏度未知导致的重构失败.理论分析和实验表明，新算法在同等条件下，重构性能优于现有典型贪婪迭代类算法，且其运算时间低于BPDN算法和同类的KFCS算法.

Abstract

Almost all of the existing greedy iterative compressed sensing reconstruction algorithms estimate the signal by the method of least squares

which introduces the measure noise into the signal estimation.Aiming at this problem

a new weakly matching pursuit denoising recovery for compressed sensing based on Kalman filtering is proposed.The new algorithm does not need the sparse prior while it estimates the signal best for each iteration according to the minimum mean-square error criterion by Kalman filtering.Meanwhile

weakly matching pursuit is used to sift the effective support set and pick out the redundancy to recover the original signal.The new algorithm is as effective as other greedy ones and is able to avoid recovery failure due to noise interference or unknown sparsity as well.The theoretical analysis and experimental simulation prove that the performance of the new algorithm is better than that of the existing greedy iterative reconstruction algorithms in the same condition.The operation time of the new algorithm is shorter than that of BPDN and the similar KFCS algorithm.

关键词

Keywords

references

Views

1547

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Millimeter-Wave-Assisted Airborne Laser Communications

Learnable Threshold Optimization for Massive Dynamic Multi-User Access Detection

Mobility-Aware Radio Resource Configuration for NB-IoT

Distributed Robust State Estimation for Nonlinear Systems Based on Multivariate Laplace Distribution

Research on High Precision Ranging and Positioning Based on GFDM Signal for B5G/6G

Related Author

GUO Wei-ran

ZHANG Shu-zhe

WEI Meng

WU Wen-zhou

SHI Chang-wei

GUO Li-ting

KANG Peng

DU Wei-qing

Related Institution

The 28-th Research Institute of China Electronics Technology Group Corporation

Harbin Institute of Technology

The 54-th Research Institute of China Electronics Technology Group Corporation

School of Physics and Information Engineering, Fuzhou University

School of Information Engineering, Guangdong University of Technology

⁰