English
Related papers

Related papers: What is the Largest Sparsity Pattern that Can Be R…

200 papers

The problem of multiple sensors simultaneously acquiring measurements of a single object can be found in many applications. In this paper, we present the optimal recovery guarantees for the recovery of compressible signals from multi-sensor…

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

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

Information Theory · Computer Science 2013-09-10 Junhong Lin , Song Li

Phase retrieval refers to a classical nonconvex problem of recovering a signal from its Fourier magnitude measurements. Inspired by the compressed sensing technique, signal sparsity is exploited in recent studies of phase retrieval to…

Computational Physics · Physics 2013-02-04 Zai Yang , Cishen Zhang , Lihua Xie

We initiate the study of trade-offs between sparsity and the number of measurements in sparse recovery schemes for generic norms. Specifically, for a norm $\|\cdot\|$, sparsity parameter $k$, approximation factor $K>0$, and probability of…

Data Structures and Algorithms · Computer Science 2015-04-07 Arturs Backurs , Piotr Indyk , Eric Price , Ilya Razenshteyn , David P. Woodruff

We consider the problem of recovering an $N$-dimensional sparse vector $\vm{x}$ from its linear transformation $\vm{y}=\vm{D} \vm{x}$ of $M(< N)$ dimension. Minimizing the $l_{1}$-norm of $\vm{x}$ under the constraint $\vm{y} = \vm{D}…

Information Theory · Computer Science 2015-03-20 Yoshiyuki Kabashima , Mikko Vehkapera , Saikat Chatterjee

We formulate sparse support recovery as a salient set identification problem and use information-theoretic analyses to characterize the recovery performance and sample complexity. We consider a very general model where we are not restricted…

Information Theory · Computer Science 2014-03-14 Cem Aksoylar , Venkatesh Saligrama

Sparsity is one of the key concepts that allows the recovery of signals that are subsampled at a rate significantly lower than required by the Nyquist-Shannon sampling theorem. Our proposed framework uses arbitrary multiscale transforms,…

Optimization and Control · Mathematics 2017-05-31 Jackie Ma , Maximilian März

A signal is sparse in one of its representation domain if the number of nonzero coefficients in that domain is much smaller than the total number of coefficients. Sparse signals can be reconstructed from a very reduced set of…

Information Theory · Computer Science 2017-06-19 Ljubisa Stankovic , Milos Dakovic , Srdjan Stankovic , Irena Orovic

Signal recovery from a given set of linear measurements using a sparsity prior has been a major subject of research in recent years. In this model, the signal is assumed to have a sparse representation under a given dictionary. Most of the…

Information Theory · Computer Science 2013-03-25 Raja Giryes , Michael Elad

Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many…

Information Theory · Computer Science 2015-03-13 Ignacio Ramirez , Guillermo Sapiro

Fusion frames are collection of subspaces which provide a redundant representation of signal spaces. They generalize classical frames by replacing frame vectors with frame subspaces. This paper considers the sparse recovery of a signal from…

Information Theory · Computer Science 2018-04-09 Ulaş Ayaz

We derived the first sparse recovery guarantees for weighted $\ell_1$ minimization with sparse random matrices and the class of weighted sparse signals, using a weighted versions of the null space property to derive these guarantees. These…

Numerical Analysis · Mathematics 2016-05-10 Bubacarr Bah

We consider a minimization problem whose objective function is the sum of a fidelity term, not necessarily convex, and a regularization term defined by a positive regularization parameter $\lambda$ multiple of the $\ell_0$ norm composed…

Optimization and Control · Mathematics 2021-11-17 Yuesheng Xu

In many areas of imaging science, it is difficult to measure the phase of linear measurements. As such, one often wishes to reconstruct a signal from intensity measurements, that is, perform phase retrieval. In several applications the…

Information Theory · Computer Science 2015-06-16 Afonso S. Bandeira , Dustin G. Mixon

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2020-09-09 Martin Genzel , Maximilian März , Robert Seidel

We consider the problem of recovering the support of a sparse signal using noisy projections. While extensive work has been done on the dense measurement matrix setting, the sparse setting remains less explored. In this work, we establish…

Machine Learning · Statistics 2025-09-03 Youssef Chaabouni , David Gamarnik

We present a novel approach for recovering a sparse signal from cross-correlated data. Cross-correlations naturally arise in many fields of imaging, such as optics, holography and seismic interferometry. Compared to the sparse signal…

Signal Processing · Electrical Eng. & Systems 2021-04-28 Miguel Moscoso , Alexei Novikov , George Papanicolaou , Chrysoula Tsogka

This paper tackles algorithmic and theoretical aspects of dictionary learning from incomplete and random block-wise image measurements and the performance of the adaptive dictionary for sparse image recovery. This problem is related to…

Computer Vision and Pattern Recognition · Computer Science 2015-08-04 Mohammad Aghagolzadeh , Hayder Radha

We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input…

Information Theory · Computer Science 2019-05-27 Aleksandr Aravkin , James Burke , Daiwei He

We investigate the reconstruction of multivariate functions from samples using sparse recovery techniques. For Square Root Lasso, Orthogonal Matching Pursuit, and Compressive Sampling Matching Pursuit, we demonstrate both theoretically and…

Numerical Analysis · Mathematics 2026-01-21 Moritz Moeller , Sebastian Neumayer , Kateryna Pozharska , Tizian Sommerfeld , Tino Ullrich
‹ Prev 1 4 5 6 7 8 10 Next ›