Related papers: Unique wavelet sign retrieval from samples without…
Image restoration is one of the most important areas in imaging science. Mathematical tools have been widely used in image restoration, where wavelet frame based approach is one of the successful examples. In this paper, we introduce a…
The Phase Retrieval problem is dealt with for the challenging case where just a single set of (phaseless) radiated field data is available. In particular, even still emulating the solution of crosswords puzzles, we provide decisive…
The wavelet transform and related techniques are used to analyze singular and fractal signals. The normalized wavelet scalogram is introduced to detect singularities including jumps, cusps and other sharply changing points. The wavelet…
Recovering a signal (function) from finitely many binary or Fourier samples is one of the core problems in modern medical imaging, and by now there exist a plethora of methods for recovering a signal from such samples. Examples of methods,…
We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order…
This paper is concerned with jointly recovering $n$ node-variables $\left\{ x_{i}\right\}_{1\leq i\leq n}$ from a collection of pairwise difference measurements. Imagine we acquire a few observations taking the form of $x_{i}-x_{j}$; the…
We consider the phase retrieval problem of reconstructing a $n$-dimensional real or complex signal $\mathbf{X}^{\star}$ from $m$ (possibly noisy) observations $Y_\mu = | \sum_{i=1}^n \Phi_{\mu i} X^{\star}_i/\sqrt{n}|$, for a large class of…
We introduce a new multiscale restoration algorithm for images with few photons counts and its use for denoising XMM data. We use a thresholding of the wavelet space so as to remove the noise contribution at each scale while preserving the…
We address the problem of estimating time and frequency shifts of a known waveform in the presence of multiple measurement vectors (MMVs). This problem naturally arises in radar imaging and wireless communications. Specifically, a signal…
We study the recovery of functions in real spline spaces from unsigned sampled values. We consider two types of recovery. The one is to recover functions locally from finitely many unsigned samples. And the other is to recover functions on…
In this paper, we show that high-dimensional sparse wavelet signals of finite levels can be constructed from their partial Fourier measurements on a deterministic sampling set with cardinality about a multiple of signal sparsity.
We propose a coherent method for the detection and reconstruction of gravitational wave signals for a network of interferometric detectors. The method is derived using the likelihood functional for unknown signal waveforms. In the standard…
We investigate the recovery of vectors from magnitudes of frame coefficients when the frames have a low redundancy, meaning a small number of frame vectors compared to the dimension of the Hilbert space. We first show that for vectors in d…
We study phase retrieval from magnitude measurements of an unknown signal as an algebraic estimation problem. Indeed, phase retrieval from rank-one and more general linear measurements can be treated in an algebraic way. It is verified that…
In this paper, we study the sample complexity and develop efficient optimal algorithms for 1-bit phase retrieval: recovering a signal $\mathbf{x}\in\mathbb{R}^n$ from $m$ phaseless bits…
We consider the problem of recovering a $K$-sparse complex signal $x$ from $m$ intensity measurements. We propose the PhaseCode algorithm, and show that in the noiseless case, PhaseCode can recover an arbitrarily-close-to-one fraction of…
We are concerned with the inverse scattering problem of recovering an inhomogeneous medium by the associated acoustic wave measurement. We prove that under certain assumptions, a single far-field pattern determines the values of a…
Considering the ambiguousness of the discrete-time phase retrieval problem to recover a signal from its Fourier intensities, one can ask the question: what additional information about the unknown signal do we need to select the correct…
The goal of phaseless compressed sensing is to recover an unknown sparse or approximately sparse signal from the magnitude of its measurements. However, it does not take advantage of any support information of the original signal.…
Suppose we are given a vector $f$ in $\R^N$. How many linear measurements do we need to make about $f$ to be able to recover $f$ to within precision $\epsilon$ in the Euclidean ($\ell_2$) metric? Or more exactly, suppose we are interested…