English
Related papers

Related papers: Subspace Methods for Joint Sparse Recovery

200 papers

We study the problem of recovering sparse signals from compressed linear measurements. This problem, often referred to as sparse recovery or sparse reconstruction, has generated a great deal of interest in recent years. To recover the…

Methodology · Statistics 2016-01-01 Jian Wang , Ping Li

This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key…

Information Theory · Computer Science 2013-10-23 T. Tony Cai , Anru Zhang

Compressive sensing (CS) is a technique for estimating a sparse signal from the random measurements and the measurement matrix. Traditional sparse signal recovery methods have seriously degeneration with the measurement matrix uncertainty…

Information Theory · Computer Science 2011-06-21 Yipeng Liu , Qun Wan , Fei Wen , Jia Xu , Yingning Peng

We consider the recovery of a low rank and jointly sparse matrix from under sampled measurements of its columns. This problem is highly relevant in the recovery of dynamic MRI data with high spatio-temporal resolution, where each column of…

Numerical Analysis · Computer Science 2015-06-03 Sampurna Biswas , Sunrita Poddar , Soura Dasgupta , Raghuraman Mudumbai , Mathews Jacob

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

A robust algorithm is proposed to reconstruct the spatial support and the Lam\'e parameters of multiple inclusions in a homogeneous background elastic material using a few measurements of the displacement field over a finite collection of…

Numerical Analysis · Mathematics 2017-02-27 Jaejun Yoo , Younghoon Jung , Mikyoung Lim , Jong Chul Ye , Abdul Wahab

In many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the sparsifying dictionary is usually characterized by a set of unknown parameters in a continuous domain. To apply the conventional…

Information Theory · Computer Science 2015-06-18 Jun Fang , Jing Li , Yanning Shen , Hongbin Li , Shaoqian Li

We consider the recovery of sparse signals that share a common support from multiple measurement vectors. The performance of several algorithms developed for this task depends on parameters like dimension of the sparse signal, dimension of…

Methodology · Statistics 2015-04-08 Deepa K. G. , Sooraj K. Ambat , K. V. S. Hari

Many practical sensing applications involve multiple sensors simultaneously acquiring measurements of a single object. Conversely, most existing sparse recovery guarantees in compressed sensing concern only single-sensor acquisition…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\mathbf{x}\in\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key…

Information Theory · Computer Science 2018-02-27 Xiao Li , Dong Yin , Sameer Pawar , Ramtin Pedarsani , Kannan Ramchandran

We consider the problem of exact support recovery of sparse signals via noisy measurements. The main focus is the sufficient and necessary conditions on the number of measurements for support recovery to be reliable. By drawing an analogy…

Information Theory · Computer Science 2010-03-04 Yuzhe Jin , Young-Han Kim , Bhaskar D. Rao

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

The purpose of this paper is to propose a non-iterative method for the inverse conductivity problem of recovering multiple small anomalies from the boundary measurements. When small anomalies are buried in a conducting object, the electric…

Analysis of PDEs · Mathematics 2015-06-11 Ok Kyun Lee , Hyeonbae Kang , Jong Chul Ye , Mikyoung Lim

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm…

Information Theory · Computer Science 2012-06-05 Yipeng Liu , Ivan Gligorijevic , Vladimir Matic , Maarten De Vos , Sabine Van Huffel

In this paper, we study a support set reconstruction problem in which the signals of interest are jointly sparse with a common support set, and sampled by joint sparsity model-2 (JSM-2) in the presence of noise. Using mathematical tools, we…

Information Theory · Computer Science 2016-04-05 Sangjun Park , Nam Yul Yu , Heung-No Lee

Compressed sensing (CS) demonstrates that sparse signals can be recovered from underdetermined linear measurements. We focus on the joint sparse recovery problem where multiple signals share the same common sparse support sets, and they are…

Information Theory · Computer Science 2011-02-17 Jongmin Kim , Woohyuk Chang , Bangchul Jung , Dror Baron , Jong Chul Ye

Sparse signal recoveries from multiple measurement vectors (MMV) with joint sparsity property have many applications in signal, image, and video processing. The problem becomes much more involved when snapshots of the signal matrix are…

Information Theory · Computer Science 2021-01-25 Ningning Han , Shidong Li , Jian Lu

The problem of recovering signals of high complexity from low quality sensing devices is analyzed via a combination of tools from signal processing and harmonic analysis. By using the rich structure offered by the recent development in…

Information Theory · Computer Science 2020-03-16 Roza Aceska , Jean-Luc Bouchot , Shidong Li

In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This…

Numerical Analysis · Mathematics 2019-05-28 Armenak Petrosyan , Hoang Tran , Clayton Webster

Subspace methods are essential to high-resolution environment sensing in the emerging unmanned systems, if further combined with the millimeter-wave (mm-Wave) massive multi-input multi-output (MIMO) technique. The estimation of signal/noise…

Signal Processing · Electrical Eng. & Systems 2021-01-13 Li Bin , Wang Shuseng , Zhang Jun , Cao Xianbin , Zhao Chenglin