Related papers: Effective support, Dirac combs, and signal recover…
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…
One of the most powerful approaches to imaging at the nanometer or subnanometer length scale is coherent diffraction imaging using X-ray sources. For amorphous (non-crystalline) samples, the raw data can be interpreted as the modulus of the…
This paper considers the use of total variation regularization in the recovery of approximately gradient sparse signals from their noisy discrete Fourier samples in the context of compressed sensing. It has been observed over the last…
Conventional analog-to-digital converters (ADCs) clip when signals exceed their input range. Modulo (unlimited) sampling overcomes this limitation by folding the signal before digitization, but existing recovery methods are either…
The recently proposed modified-compressive sensing (modified-CS), which utilizes the partially known support as prior knowledge, significantly improves the performance of recovering sparse signals. However, modified-CS depends heavily on…
Clipping or saturation in audio signals is a very common problem in signal processing, for which, in the severe case, there is still no satisfactory solution. In such case, there is a tremendous loss of information, and traditional methods…
Given an overcomplete dictionary $A$ and a signal $b = Ac^*$ for some sparse vector $c^*$ whose nonzero entries correspond to linearly independent columns of $A$, classical sparse signal recovery theory considers the problem of whether…
One of the basic questions in harmonic analysis is to study the decay properties of the Fourier transform of measures or distributions supported on thin sets in $\mathbb{R}^n$. When the support is a smooth enough manifold, an almost…
Suppose that a sequence of numbers $x_n$ (a `signal') is transmitted through a noisy channel. The receiver observes a noisy version of the signal with additive random fluctuations, $x_n + \xi_n$, where $\xi_n$ is a sequence of independent…
In this paper, we propose a generalized expectation consistent signal recovery algorithm to estimate the signal $\mathbf{x}$ from the nonlinear measurements of a linear transform output $\mathbf{z}=\mathbf{A}\mathbf{x}$. This estimation…
Signal decomposition is an effective tool to assist the identification of modal information in time-domain signals. Two signal decomposition methods, including the empirical wavelet transform (EWT) and Fourier decomposition method (FDM),…
In this paper we show the existence of the generalized Eberlein decomposition for Fourier transformable measures with Meyer set support. We prove that each of the three components is also Fourier transformable and has Meyer set support. We…
The group synchronization problem is to estimate unknown group elements at the vertices of a graph when given a set of possibly noisy observations of group differences at the edges. We consider the group synchronization problem on finite…
This paper introduces a novel Knockoff-guided compressive sensing framework, referred to as \TheName{}, which enhances signal recovery by leveraging precise false discovery rate (FDR) control during the support identification phase. Unlike…
In phase retrieval, the goal is to recover a signal $\mathbf{x}\in\mathbb{C}^N$ from the magnitudes of linear measurements $\mathbf{Ax}\in\mathbb{C}^M$. While recent theory has established that $M\approx 4N$ intensity measurements are…
Infinite-dimensional compressed sensing deals with the recovery of analog signals (functions) from linear measurements, often in the form of integral transforms such as the Fourier transform. This framework is well-suited to many real-world…
In this paper we study the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling. Our first result demonstrates that…
We consider the problem of "algebraic reconstruction" of linear combinations of shifts of several known signals $f_1,\ldots,f_k$ from the Fourier samples. Following \cite{Bat.Sar.Yom2}, for each $j=1,\ldots,k$ we choose sampling set $S_j$…
We study the problem of learning tree-structured Markov random fields (MRF) on discrete random variables with common support when the observations are corrupted by a $k$-ary symmetric noise channel with unknown probability of error. For…
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…