Online Recovery of Temporally Correlated Sparse Signals Using Multiple Measurement Vectors

Author(s):  
Geethu Joseph ◽  
Chandra R. Murthy ◽  
Ranjitha Prasad ◽  
Bhaskar D. Rao
2018 ◽  
Vol 13 (4) ◽  
pp. 683-691 ◽  
Author(s):  
Mehrrad Mehrkam ◽  
Mohammad Ali Tinati ◽  
Tohid Yousefi Rezaii

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Hanwei Liu ◽  
Yongshun Zhang ◽  
Yiduo Guo ◽  
Qiang Wang ◽  
Yifeng Wu

In a heterogeneous environment, to efficiently suppress clutter with only one snapshot, a novel STAP algorithm for multiple-input multiple-output (MIMO) radar based on sparse representation, referred to as MIMOSR-STAP in this paper, is presented. By exploiting the waveform diversity of MIMO radar, each snapshot at the tested range cell can be transformed into multisnapshots for the phased array radar, which can estimate the high-resolution space-time spectrum by using multiple measurement vectors (MMV) technique. The proposed approach is effective in estimating the spectrum by utilizing Temporally Correlated Multiple Sparse Bayesian Learning (TMSBL). In the sequel, the clutter covariance matrix (CCM) and the corresponding adaptive weight vector can be efficiently obtained. MIMOSR-STAP enjoys high accuracy and robustness so that it can achieve better performance of output signal-to-clutter-plus-noise ratio (SCNR) and minimum detectable velocity (MDV) than the single measurement vector sparse representation methods in the literature. Thus, MIMOSR-STAP can deal with badly inhomogeneous clutter scenario more effectively, especially suitable for insufficient independent and identically distributed (IID) samples environment.


2012 ◽  
Vol 92 (12) ◽  
pp. 3075-3079 ◽  
Author(s):  
Yang You ◽  
Laming Chen ◽  
Yuantao Gu ◽  
Wei Feng ◽  
Hui Dai

Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 247 ◽  
Author(s):  
Mohammad Shekaramiz ◽  
Todd Moon ◽  
Jacob Gunther

We consider the sparse recovery problem of signals with an unknown clustering pattern in the context of multiple measurement vectors (MMVs) using the compressive sensing (CS) technique. For many MMVs in practice, the solution matrix exhibits some sort of clustered sparsity pattern, or clumpy behavior, along each column, as well as joint sparsity across the columns. In this paper, we propose a new sparse Bayesian learning (SBL) method that incorporates a total variation-like prior as a measure of the overall clustering pattern in the solution. We further incorporate a parameter in this prior to account for the emphasis on the amount of clumpiness in the supports of the solution to improve the recovery performance of sparse signals with an unknown clustering pattern. This parameter does not exist in the other existing algorithms and is learned via our hierarchical SBL algorithm. While the proposed algorithm is constructed for the MMVs, it can also be applied to the single measurement vector (SMV) problems. Simulation results show the effectiveness of our algorithm compared to other algorithms for both SMV and MMVs.


Sign in / Sign up

Export Citation Format

Share Document