English
Related papers

Related papers: The recoverability limit for superresolution via s…

200 papers

In this paper, we tackle the general compressive phase retrieval problem. The problem is to recover a K-sparse complex vector of length n, $x\in \mathbb{C}^n$, from the magnitudes of m linear measurements, $y=|Ax|$, where $A \in…

Information Theory · Computer Science 2015-02-18 Ramtin Pedarsani , Kangwook Lee , Kannan Ramchandran

The support recovery problem consists of determining a sparse subset of variables that is relevant in generating a set of observations. In this paper, we study the support recovery problem in the phase retrieval model consisting of noisy…

Information Theory · Computer Science 2020-09-29 Lan V. Truong , Jonathan Scarlett

A different compressive sensing framework, convolution with white noise waveform followed by subsampling at fixed (not randomly selected) locations, is studied in this paper. We show that its recoverability for sparse signals depends on the…

Optimization and Control · Mathematics 2009-09-30 Yin Xiang , Lianlin Li , Fang Li

This paper considers the problem of reconstructing sparse or compressible signals from one-bit quantized measurements. We study a new method that uses a log-sum penalty function, also referred to as the Gaussian entropy, for sparse signal…

Information Theory · Computer Science 2012-10-17 Jun Fang , Yanning Shen , Hongbin Li

An unknown vector f in R^n can be recovered from corrupted measurements y = Af + e where A^(m*n)(m>n) is the coding matrix if the unknown error vector e is sparse. We investigate the relationship of the fraction of errors and the recovering…

Information Theory · Computer Science 2010-06-03 Meng Wang , Weiyu Xu , Ao Tang

Consider the $n$-dimensional vector $y=X\be+\e$, where $\be \in \R^p$ has only $k$ nonzero entries and $\e \in \R^n$ is a Gaussian noise. This can be viewed as a linear system with sparsity constraints, corrupted by noise. We find a…

Information Theory · Computer Science 2009-10-13 Kamiar Rahnama Rad

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

We address the problem of recovering a signal (up to global phase) from its short-time Fourier transform (STFT) magnitude measurements. This problem arises in several applications, including optical imaging and speech processing. In this…

Information Theory · Computer Science 2015-10-06 Tamir Bendory , Yonina C. Eldar

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

The Unlimited Sensing Framework (USF) is a digital acquisition protocol that allows for sampling and reconstruction of high dynamic range signals. By acquiring modulo samples, the USF circumvents the clipping or saturation problem that is a…

Information Theory · Computer Science 2022-07-28 Ayush Bhandari

Let A be an n by m matrix with m>n, and suppose that the underdetermined linear system As=x admits a sparse solution s0 for which ||s0||_0 < 1/2 spark(A). Such a sparse solution is unique due to a well-known uniqueness theorem. Suppose now…

Information Theory · Computer Science 2016-11-17 Massoud Babaie-Zadeh , Christian Jutten , Hosein Mohimani

Context: in large-scale spatial surveys, the Point Spread Function (PSF) varies across the instrument field of view (FOV). Local measurements of the PSFs are given by the isolated stars images. Yet, these estimates may not be directly…

Computer Vision and Pattern Recognition · Computer Science 2016-11-04 F. M. Ngolè Mboula , J. -L. Starck , K. Okumura , J. Amiaux , P. Hudelot

We consider the \textit{phase retrieval} problem of recovering a sparse signal $\mathbf{x}$ in $\mathbb{R}^d$ from intensity-only measurements in dimension $d \geq 2$. Phase retrieval can be equivalently formulated as the problem of…

Combinatorics · Mathematics 2021-09-01 Alexei Novikov , Stephen White

The problem of super-resolution in general terms is to recuperate a finitely supported measure $\mu$ given finitely many of its coefficients $\hat{\mu}(k)$ with respect to some orthonormal system. The interesting case concerns situations,…

Functional Analysis · Mathematics 2019-07-12 H. N. Mhaskar

Precision measurement has been an important research area in sensing and metrology. In classical physics, the Fisher information determines the maximum extractable information from statistically unknown signals, based on a joint probability…

Quantum Physics · Physics 2024-09-04 Byoung S. Ham

We investigate analytically and numerically the role of quantum fluctuations in reconstruction of optical objects from diffraction-limited images. Taking as example of an input object two closely spaced Gaussian peaks we demonstrate that…

Quantum Physics · Physics 2009-11-10 Vladislav N. Beskrovnyy , Mikhail I. Kolobov

We give a short argument that yields a new lower bound on the number of subsampled rows from a bounded, orthonormal matrix necessary to form a matrix with the restricted isometry property. We show that a matrix formed by uniformly…

Information Theory · Computer Science 2023-05-10 Jarosław Błasiok , Patrick Lopatto , Kyle Luh , Jake Marcinek , Shravas Rao

This letter considers the problem of recovering a positive stream of Diracs on a sphere from its projection onto the space of low-degree spherical harmonics, namely, from its low-resolution version. We suggest recovering the Diracs via a…

Information Theory · Computer Science 2015-10-28 Tamir Bendory , Yonina C. Eldar

We study the recovery of sparse vectors from subsampled random convolutions via $\ell_1$-minimization. We consider the setup in which both the subsampling locations as well as the generating vector are chosen at random. For a subgaussian…

Information Theory · Computer Science 2018-03-28 Shahar Mendelson , Holger Rauhut , Rachel Ward

In this paper, we consider the "foreach" sparse recovery problem with failure probability $p$. The goal of which is to design a distribution over $m \times N$ matrices $\Phi$ and a decoding algorithm $\algo$ such that for every…

Data Structures and Algorithms · Computer Science 2013-04-24 Anna C. Gilbert , Hung Q. Ngo , Ely Porat , Atri Rudra , Martin J. Strauss