Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix

DOI10.1109/TSP.2006.890907zbMath1391.94598WikidataQ59341507 ScholiaQ59341507MaRDI QIDQ4564502

Martin Vetterli, Thierry Blu, Pier Luigi Dragotti

Publication date: 12 June 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Sampling theory in information and communication theory (94A20) Coding theorems (Shannon theory) (94A24) Modulation and demodulation in information and communication theory (94A14)

Related Items (51)

Robust recovery of stream of pulses using convex optimization ⋮ Sparse sampling: theory, methods and an application in neuroscience ⋮ Off-the-Grid Recovery of Piecewise Constant Images from Few Fourier Samples ⋮ Parameter estimation for nonincreasing exponential sums by Prony-like methods ⋮ On the convergence properties of sampling Durrmeyer‐type operators in Orlicz spaces ⋮ Approximation of non-decaying signals from shift-invariant subspaces ⋮ Spatially distributed sampling and reconstruction ⋮ Moment vanishing problem and positivity: some examples ⋮ Super-resolution of point sources via convex programming ⋮ On a class of non-uniform average sampling expansions and partial reconstruction in subspaces of \(L _{2}(\mathbb R)\) ⋮ Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain ⋮ A theory of super-resolution from short-time Fourier transform measurements ⋮ Sparse polynomial interpolation in Chebyshev bases ⋮ A novel sub-Nyquist FRI sampling and reconstruction method in linear canonical transform domain ⋮ Cardinal MK-spline signal processing: spatial interpolation and frequency domain filtering ⋮ Localized nonlinear functional equations and two sampling problems in signal processing ⋮ The generalized operator based Prony method ⋮ Reconstruction of stationary and non-stationary signals by the generalized Prony method ⋮ Nonlinear approximation by sums of nonincreasing exponentials ⋮ A Sampling Theorem for Deconvolution in Two Dimensions ⋮ Rate of innovation for (non-)periodic signals and optimal lower stability bound for filtering ⋮ A consistent and stable approach to generalized sampling ⋮ Parameter estimation and signal reconstruction ⋮ Linear versus non-linear acquisition of step-functions ⋮ Vector versions of Prony's algorithm and vector-valued rational approximations ⋮ Generalized sampling and infinite-dimensional compressed sensing ⋮ Weighted sampling and reconstruction in weighted reproducing kernel spaces ⋮ Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method ⋮ Towards a Mathematical Theory of Super‐resolution ⋮ On the existence of optimal unions of subspaces for data modeling and clustering ⋮ Reconstruction of aperiodic FRI signals and estimation of the rate of innovation based on the state space method ⋮ Sampling and reconstruction of signals in a reproducing kernel subspace of \(L^p(\mathbb R^d)\) ⋮ Parameter estimation for exponential sums by approximate prony method ⋮ Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval ⋮ Stable phaseless sampling and reconstruction of real-valued signals with finite rate of innovation ⋮ Stability and super-resolution of generalized spike recovery ⋮ Recovering finite parametric distributions and functions using the spherical mean transform ⋮ A Sheaf-Theoretic Perspective on Sampling ⋮ OperA: Operator-Based Annihilation for Finite-Rate-of-Innovation Signal Sampling ⋮ Random sampling and reconstruction of concentrated signals in a reproducing kernel space ⋮ Optimal non-linear models for sparsity and sampling ⋮ Sampling and Galerkin reconstruction in reproducing kernel spaces ⋮ Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums ⋮ Prony methods for recovery of structured functions ⋮ A Convex Approach to Superresolution and Regularization of Lines in Images ⋮ Nonlinear least squares in \(\mathbb R^{N}\) ⋮ Reconstructing signals with finite rate of innovation from noisy samples ⋮ Splines and wavelets on circulant graphs ⋮ Algebraic Fourier reconstruction of piecewise smooth functions ⋮ Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI ⋮ A new stochastic algorithm inspired on genetic algorithms to estimate signals with finite rate of innovation from noisy samples

This page was built for publication: Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix