English
Related papers

Related papers: How to get high resolution results from sparse and…

200 papers

Conventional sub-Nyquist sampling methods for analog signals exploit prior information about the spectral support. In this paper, we consider the challenging problem of blind sub-Nyquist sampling of multiband signals, whose unknown…

Information Theory · Computer Science 2015-05-13 Moshe Mishali , Yonina C. Eldar

This paper studies the recovery of a superposition of point sources from noisy bandlimited data. In the fewest possible words, we only have information about the spectrum of an object in a low-frequency band bounded by a certain cut-off…

Information Theory · Computer Science 2013-07-11 Emmanuel Candes , Carlos Fernandez-Granda

This paper investigates the problem of signal estimation from undersampled noisy sub-Gaussian measurements under the assumption of a cosparse model. Based on generalized notions of sparsity, we derive novel recovery guarantees for the…

Information Theory · Computer Science 2021-02-23 Martin Genzel , Gitta Kutyniok , Maximilian März

We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic…

Numerical Analysis · Mathematics 2012-07-27 David Lawlor , Yang Wang , Andrew Christlieb

Efficient estimation of wideband spectrum is of great importance for applications such as cognitive radio. Recently, sub-Nyquist sampling schemes based on compressed sensing have been proposed to greatly reduce the sampling rate. However,…

Signal Processing · Electrical Eng. & Systems 2018-05-23 Haoyu Fu , Yuejie Chi

Extremely Large-scale MIMO (XL-MIMO) systems operating in Near-Field (NF) introduce new degrees of freedom for accurate source localisation, but make dense arrays impractical. Sparse or distributed arrays can reduce hardware complexity…

Signal Processing · Electrical Eng. & Systems 2026-02-03 Baptiste Sambon , Gilles Monnoyer , Luc Vandendorpe , Claude Oestges

This paper studies two spectrum estimation methods for the case that the samples are obtained at a rate lower than the Nyquist rate. The first method is the correlogram method for undersampled data. The algorithm partitions the spectrum…

Statistics Theory · Mathematics 2013-11-25 Mahdi Shaghaghi , Sergiy A. Vorobyov

One-bit compressive sensing (CS) is an advanced version of sparse recovery in which the sparse signal of interest can be recovered from extremely quantized measurements. Namely, only the sign of each measurement is available to us. In many…

Information Theory · Computer Science 2019-10-22 Hossein Beheshti , Sajad Daei , Farzan Haddadi

A sparse or compressible signal can be recovered from a certain number of noisy random projections, smaller than what dictated by classic Shannon/Nyquist theory. In this paper, we derive the closed-form expression of the mean square error…

Information Theory · Computer Science 2014-03-10 Giulio Coluccia , Aline Roumy , Enrico Magli

Binary measurements arise naturally in a variety of statistical and engineering applications. They may be inherent to the problem---e.g., in determining the relationship between genetics and the presence or absence of a disease---or they…

Information Theory · Computer Science 2014-08-01 Richard Baraniuk , Simon Foucart , Deanna Needell , Yaniv Plan , Mary Wootters

A novel framework to construct an efficient sensing (measurement) matrix, called mixed adaptive-random (MAR) matrix, is introduced for directly acquiring a compressed image representation. The mixed sampling (sensing) procedure hybridizes…

Information Theory · Computer Science 2015-04-07 Jun Yang , Wei E. I. Sha , Hongyang Chao , Zhu Jin

Traditional radar sensing typically involves matched filtering between the received signal and the shape of the transmitted pulse. Under the confinement of classic sampling theorem this requires that the received signals must first be…

Information Theory · Computer Science 2013-07-09 Eliahu Baransky , Gal Itzhak , Idan Shmuel , Noam Wagner , Eli Shoshan , Yonina C. Eldar

In this paper, we introduce a computational framework for recovering a high-resolution approximation of an unknown function from its low-resolution indirect measurements as well as high-resolution training observations by merging the…

Statistics Theory · Mathematics 2021-10-15 Milana Gataric

Weighted average sampling is more practical and numerically more stable than sampling at single points as in the classical Shannon sampling framework. Using the frame theory, one can completely reconstruct a bandlimited function from its…

Information Theory · Computer Science 2014-07-04 Haizhang Zhang

Recovering a sparse signal from its low-pass projections in the Fourier domain is a problem of broad interest in science and engineering and is commonly referred to as super-resolution. In many cases, however, Fourier domain may not be the…

Information Theory · Computer Science 2019-02-20 Ayush Bhandari , Yonina C. Eldar

In this work, we consider the problem of recovering analysis-sparse signals from under-sampled measurements when some prior information about the support is available. We incorporate such information in the recovery stage by suitably tuning…

Information Theory · Computer Science 2019-01-30 Sajad Daei , Farzan Haddadi , Arash Amini

We present a procedure that adds a number of desirable features to standard exponential analysis algorithms, among which output reliability, a divide-and-conquer approach, the automatic detection of the exponential model order, robustness…

Numerical Analysis · Mathematics 2020-07-29 Matteo Briani , Annie Cuyt , Ferre Knaepkens , Wen-shin Lee

Imaging devices exploit the Nyquist-Shannon sampling theorem to avoid both aliasing and redundant oversampling by design. Conversely, in medical image resampling, images are considered as continuous functions, are warped by a spatial…

Image and Video Processing · Electrical Eng. & Systems 2021-01-19 M. Jorge Cardoso , Marc Modat , Tom Vercauteren , Sebastien Ourselin

We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below…

Information Theory · Computer Science 2019-05-28 Ramin Ayanzadeh , Milton Halem , Tim Finin

In large-scale spatial surveys, such as the forthcoming ESA Euclid mission, images may be undersampled due to the optical sensors sizes. Therefore, one may consider using a super-resolution (SR) method to recover aliased frequencies, prior…

Computer Vision and Pattern Recognition · Computer Science 2014-10-30 Fred Maurice Ngolè Mboula , Jean-Luc Starck , Samuel Ronayette , Koryo Okumura , Jérôme Amiaux