Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
Summary: In this paper, a novel method named splitting matching pursuit (SMP) is proposed to reconstruct \(K\)-sparse signals in compressed sensing. The proposed method selects \(Fl\) (\(Fl > 2K\)) largest components of the correlation vector \(c\), which are divided into \(F\) split sets with equal length \(l\). The searching area is thus expanded to incorporate more candidate components, which increases the probability of finding the true components at one iteration. The proposed method does not require the sparsity level \(K\) to be known in prior. The merging, estimation and pruning steps are carried out for each split set independently, which makes it especially suitable for parallel computation. The proposed SMP method is then extended to more practical condition, e.g. the direction of arrival (DOA) estimation problem in phased array radar system using compressed sensing. Numerical simulations show that the proposed method succeeds in identifying multiple targets in a sparse radar scene, outperforming other OMP-type methods. The proposed method also obtains more precise estimation of DOA angle using one snapshot compared with the traditional estimation methods such as Capon, APES (amplitude and phase estimation) and GLRT (generalized likelihood ratio test) based on hundreds of snapshots.
- Adaptive step-size matching pursuit algorithm for practical sparse reconstruction
- Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing
- Modified sparsity adaptive matching pursuit algorithm based on compressive sensing
- Convex feasibility modeling and projection methods for sparse signal recovery
- A sparse signal reconstruction method based on improved double chains quantum genetic algorithm
- Adaptive Compressed Sensing Radar Oriented Toward Cognitive Detection in Dynamic Sparse Target Scene
- Atomic Decomposition by Basis Pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Matching pursuits with time-frequency dictionaries
- Measurement Matrix Design for Compressive Sensing–Based MIMO Radar
- On compressive sensing applied to radar
- Sensitivity to Basis Mismatch in Compressed Sensing
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Tracking and data association
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- On a simple derivation of the complementary matching pursuit
- Adaptive step-size matching pursuit algorithm for practical sparse reconstruction
- A New Method Using Table to Sparse Representation in Pairs of Bases with Matching Pursuits
- Sparse Approximation Using M-Term Pursuit and Application in Image and Video Coding
This page was built for publication: Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375672)
