English
Related papers

Related papers: Non-uniform sampling, image recovery from sparse d…

200 papers

We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary.…

Information Theory · Computer Science 2011-12-08 Christoph Studer , Patrick Kuppinger , Graeme Pope , Helmut Bölcskei

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

Continuous-domain visual signals are usually captured as discrete (digital) images. This operation is not invertible in general, in the sense that the continuous-domain signal cannot be exactly reconstructed based on the discrete image,…

Information Theory · Computer Science 2016-01-20 Mitra Fatemi , Arash Amini , Loic Baboulaz , Martin Vetterli

Sampling theories lie at the heart of signal processing devices and communication systems. To accommodate high operating rates while retaining low computational cost, efficient analog-to digital (ADC) converters must be developed. Many of…

Information Theory · Computer Science 2010-10-12 Moslem Rashidi

We derive fundamental sample complexity bounds for recovering sparse and structured signals for linear and nonlinear observation models including sparse regression, group testing, multivariate regression and problems with missing features.…

Information Theory · Computer Science 2017-02-17 Cem Aksoylar , George Atia , Venkatesh Saligrama

With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources…

Information Theory · Computer Science 2015-07-28 Yi Lu

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

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

The task of finding a sparse signal decomposition in an overcomplete dictionary is made more complicated when the signal undergoes an unknown modulation (or convolution in the complementary Fourier domain). Such simultaneous sparse recovery…

Information Theory · Computer Science 2019-10-02 Youye Xie , Michael B. Wakin , Gongguo Tang

We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of…

Statistics Theory · Mathematics 2008-06-04 Wei Wang , Martin J. Wainwright , Kannan Ramchandran

It is previously shown that proper random linear samples of a finite discrete signal (vector) which has a sparse representation in an orthonormal basis make it possible (with probability 1) to recover the original signal. Moreover, the…

Information Theory · Computer Science 2009-01-23 Arash Amini , Farokh Marvasti

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

Numerical Analysis · Mathematics 2022-05-04 Ben Adcock , Milana Gataric , José Luis Romero

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 2022-04-12 Martin Genzel , Maximilian März , Robert Seidel

In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of…

Machine Learning · Statistics 2017-06-29 Amirhossein Javaheri , Hadi Zayyani , Farokh Marvasti

In this paper we aim to tackle the problem of reconstructing a high-resolution image from a single low-resolution input image, known as single image super-resolution. In the literature, sparse representation has been used to address this…

Computer Vision and Pattern Recognition · Computer Science 2016-03-23 Mohammad Rostami , Zhou Wang

Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as…

Information Theory · Computer Science 2013-09-24 Ljubisa Stankovic , Milos Dakovic , Stefan Vujovic

This paper investigates the problem of recovering missing samples using methods based on sparse representation adapted especially for image signals. Instead of $l_2$-norm or Mean Square Error (MSE), a new perceptual quality measure is used…

Machine Learning · Computer Science 2017-10-18 Amirhossein Javaheri , Hadi Zayyani , Farokh Marvasti

Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in…

Information Theory · Computer Science 2015-11-23 Kiryung Lee , Yanjun Li , Marius Junge , Yoram Bresler

In a previous paper, the author constructed frames and oversampling formulas for band-limited functions, in the framework of the theory of shift-invariant spaces. In this article we study the problem of recovering missing samples. We find a…

Functional Analysis · Mathematics 2009-01-17 Vincenza Del Prete