English
Related papers

Related papers: Subsampling at Information Theoretically Optimal R…

200 papers

In this work we propose a nonconvex two-stage \underline{s}tochastic \underline{a}lternating \underline{m}inimizing (SAM) method for sparse phase retrieval. The proposed algorithm is guaranteed to have an exact recovery from $O(s\log n)$…

Numerical Analysis · Mathematics 2022-11-23 Jian-Feng Cai , Yuling Jiao , Xiliang Lu , Juntao You

This paper deals with the problem of reconstructing a band-limited signal when a finite subset of its samples and of its derivative are missing. The technique used, due to P.J.S.G. Ferreira, is based on the use of a particular frame for…

Functional Analysis · Mathematics 2010-09-13 Paola Brianzi , Vincenza Del Prete

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

This paper proposes a compressed sensing (CS) framework for the acquisition and reconstruction of frequency-sparse signals with chaotic dynamical systems. The sparse signal is acting as an excitation term of a discrete-time chaotic system…

Information Theory · Computer Science 2016-12-21 Zhong Liu , Shengyao Chen , Feng Xi

We give an overview of recent developments in the problem of reconstructing a band-limited signal from non-uniform sampling from a numerical analysis view point. It is shown that the appropriate design of the finite-dimensional model plays…

Numerical Analysis · Mathematics 2025-10-20 Thomas Strohmer

A conditional sampling oracle for a probability distribution D returns samples from the conditional distribution of D restricted to a specified subset of the domain. A recent line of work (Chakraborty et al. 2013 and Cannone et al. 2014)…

Data Structures and Algorithms · Computer Science 2016-08-18 Themistoklis Gouleakis , Christos Tzamos , Manolis Zampetakis

This paper revisits the problem of sampling and transmitting status updates through a channel with random delay under a sampling frequency constraint \cite{sun_17_tit}. We use the Age of Information (AoI) to characterize the status…

Information Theory · Computer Science 2023-01-05 Haoyue Tang , Yuchao Chen , Jintao Wang , Pengkun Yang , Leandros Tassiulas

The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received…

Data Structures and Algorithms · Computer Science 2017-08-18 Michael Kapralov

Design of Random Modulation Pre-Integration systems based on the restricted-isometry property may be suboptimal when the energy of the signals to be acquired is not evenly distributed, i.e. when they are both sparse and localized. To…

Information Theory · Computer Science 2015-03-20 Mauro Mangia , Riccardo Rovatti , Gianluca Setti

Signal-to-noise ratio (SNR) statistics play a central role in many applications. A common situation where SNR is studied is when a continuous time signal is sampled at a fixed frequency with some noise in the background. While estimation…

Methodology · Statistics 2021-11-05 Francesco Giordano , Pietro Coretto

In Fourier-based medical imaging, sampling below the Nyquist rate results in an underdetermined system, in which linear reconstructions will exhibit artifacts. Another consequence of under-sampling is lower signal to noise ratio (SNR) due…

Computer Vision and Pattern Recognition · Computer Science 2016-10-04 Patrick Virtue , Michael Lustig

This paper presents an approach for instantaneous bandwidth estimation from level-crossing (LC) samples using a long short-term memory (LSTM) encoder-decoder architecture. LC sampling is a nonuniform sampling technique that is particularly…

Signal Processing · Electrical Eng. & Systems 2025-04-29 Johannes Königs , Carsten Bockelmann , Armin Dekorsy

In this paper, the instantaneous frequency estimation of nonstationary signals is considered. The instantaneous frequency is estimated from the timefrequency representation where certain percent of the coefficients is missing. The…

Signal Processing · Electrical Eng. & Systems 2019-02-08 Bozidar Androvic , Marko Kovac , Andjela Kandic

Choosing an appropriate frequency definition and norm is critical in graph signal sampling and reconstruction. Most previous works define frequencies based on the spectral properties of the graph and use the same frequency definition and…

Signal Processing · Electrical Eng. & Systems 2024-09-17 Darukeesan Pakiyarajah , Eduardo Pavez , Antonio Ortega

This paper discusses sample allocation problem (SAP) in frequency-domain Compressive Sampling (CS) of time-domain signals. An analysis that is relied on two fundamental CS principles; the Uniform Random Sampling (URS) and the Uncertainty…

Information Theory · Computer Science 2014-12-22 Andriyan B. Suksmono

In this paper, we present an approach to the reconstruction of signals exhibiting sparsity in a transformation domain, having some heavily disturbed samples. This sparsity-driven signal recovery exploits a carefully suited random sampling…

Information Theory · Computer Science 2020-03-30 Ljubisa Stankovic , Milos Brajovic , Isidora Stankovic , Jonatan Lerga , Milos Dakovic

Phase retrieval arises in various fields of science and engineering and it is well studied in a finite-dimensional setting. In this paper, we consider an infinite-dimensional phase retrieval problem to reconstruct real-valued signals living…

Information Theory · Computer Science 2016-03-07 Yang Chen , Cheng Cheng , Qiyu Sun , Haichao Wang

Early stopping is a well known approach to reduce the time complexity for performing training and model selection of large scale learning machines. On the other hand, memory/space (rather than time) complexity is the main constraint in many…

Machine Learning · Statistics 2018-02-02 Tomas Angles , Raffaello Camoriano , Alessandro Rudi , Lorenzo Rosasco

The problem of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy is addressed. Basics of the sampling theory are outlined to show that the lower bound of signal sampling…

Computer Vision and Pattern Recognition · Computer Science 2018-03-01 Leonid P. Yaroslavsky

We address the problem of recovering signals from samples taken at their rate of innovation. Our only assumption is that the sampling system is such that the parameters defining the signal can be stably determined from the samples, a…

Information Theory · Computer Science 2015-05-28 Tomer Michaeli , Yonina C. Eldar