English
Related papers

Related papers: Signal Recovery under Cumulative Coherence

200 papers

We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occuring in clusters. Based on an uncertainty relation for block-sparse signals, we define a block-coherence measure and we show…

Information Theory · Computer Science 2008-12-02 Yonina C. Eldar , Helmut Bolcskei

We consider the recovery of sparse signals subject to sparse interference, as introduced in Studer et al., IEEE Trans. IT, 2012. We present novel probabilistic recovery guarantees for this framework, covering varying degrees of knowledge of…

Information Theory · Computer Science 2012-09-27 Graeme Pope , Annina Bracher , Christoph Studer

In this paper, we consider recovering the signal $\bm{x}\in\mathbb{R}^{n}$ from its few noisy measurements $\bm{b}=A\bm{x}+\bm{z}$, where $A\in\mathbb{R}^{m\times n}$ with $m\ll n$ is the measurement matrix, and $\bm{z}\in\mathbb{R}^{m}$ is…

Numerical Analysis · Computer Science 2018-12-11 Wendong Wang , Feng Zhang , Zhi Wang , Jianjun Wang

We study the problem of consistently recovering the sparsity pattern of a regression parameter vector from correlated observations governed by deterministic missing data patterns using Lasso. We consider the case in which the observed…

Machine Learning · Computer Science 2022-06-13 Chuyang Ke , Jean Honorio

We provide another framework of iterative algorithms based on thresholding, feedback and null space tuning for sparse signal recovery arising in sparse representations and compressed sensing. Several thresholding algorithms with various…

Information Theory · Computer Science 2012-11-13 Shidong Li , Yulong Liu , Tiebin Mi

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi

In high dimension, it is customary to consider Lasso-type estimators to enforce sparsity. For standard Lasso theory to hold, the regularization parameter should be proportional to the noise level, yet the latter is generally unknown in…

Machine Learning · Statistics 2017-10-19 Mathurin Massias , Olivier Fercoq , Alexandre Gramfort , Joseph Salmon

The most frequently used condition for sampling matrices employed in compressive sampling is the restricted isometry (RIP) property of the matrix when restricted to sparse signals. At the same time, imposing this condition makes it…

Information Theory · Computer Science 2013-03-11 Alexander Barg , Arya Mazumdar , Rongrong Wang

In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…

Information Theory · Computer Science 2017-06-05 Chen Li , Ben Adcock

We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs…

Statistics Theory · Mathematics 2020-09-29 Chao Gao , Anderson Y. Zhang

The performance of existing approaches to the recovery of frequency-sparse signals from compressed measurements is limited by the coherence of required sparsity dictionaries and the discretization of frequency parameter space. In this…

Information Theory · Computer Science 2014-07-15 Zhenqi Lu , Rendong Ying , Sumxin Jiang , Zenghui Zhang , Peilin Liu , Wenxian Yu

Mixture of linear regressions is a popular learning theoretic model that is used widely to represent heterogeneous data. In the simplest form, this model assumes that the labels are generated from either of two different linear models and…

Machine Learning · Statistics 2020-07-15 Arya Mazumdar , Soumyabrata Pal

For compressive sensing of dynamic sparse signals, we develop an iterative pursuit algorithm. A dynamic sparse signal process is characterized by varying sparsity patterns over time/space. For such signals, the developed algorithm is able…

Statistics Theory · Mathematics 2012-10-15 Dave Zachariah , Saikat Chatterjee , Magnus Jansson

In this paper, we will investigate the efficacy of IMAT (Iterative Method of Adaptive Thresholding) in recovering the sparse signal (parameters) for linear models with missing data. Sparse recovery rises in compressed sensing and machine…

Machine Learning · Computer Science 2016-06-14 Ashkan Esmaeili , Farokh Marvasti

We analyze the asymptotic performance of sparse signal recovery from noisy measurements. In particular, we generalize some of the existing results for the Gaussian case to subgaussian and other ensembles. An achievable result is presented…

Information Theory · Computer Science 2009-04-30 Paul Tune , Sibiraj Bhaskaran Pillai , Stephen Hanly

We study the compressed sensing (CS) signal estimation problem where an input signal is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the input signal…

Information Theory · Computer Science 2014-12-23 Junan Zhu , Dror Baron , Marco F. Duarte

We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in…

Information Theory · Computer Science 2014-10-24 Zai Yang , Lihua Xie

It is now well established that sparse signal models are well suited to restoration tasks and can effectively be learned from audio, image, and video data. Recent research has been aimed at learning discriminative sparse models instead of…

Computer Vision and Pattern Recognition · Computer Science 2009-09-29 Julien Mairal , Francis Bach , Jean Ponce , Guillermo Sapiro , Andrew Zisserman

Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is done by solving an l_1-regularized linear regression problem, usually called Lasso. In this work we first combine the…

Information Theory · Computer Science 2010-03-02 Pablo Sprechmann , Ignacio Ramirez , Guillermo Sapiro , Yonina C. Eldar

In this paper, we consider the classic measurement error regression scenario in which our independent, or design, variables are observed with several sources of additive noise. We will show that our motivating example's replicated…

Applications · Statistics 2012-07-10 David J. Biagioni , Ryan Elmore , Wesley Jones
‹ Prev 1 3 4 5 6 7 10 Next ›