Related papers: ESPRIT versus ESPIRA for reconstruction of short c…
We introduce a new method for Estimation of Signal Parameters based on Iterative Rational Approximation (ESPIRA) for sparse exponential sums. Our algorithm uses the AAA algorithm for rational approximation of the discrete Fourier transform…
In this survey we describe some modifications of Prony's method. In particular, we consider the recovery of general expansions into eigenfunctions of linear differential operators of first order and show, how these expansions can be…
In this paper, we derive a new reconstruction method for real non-harmonic Fourier sums, i.e., real signals which can be represented as sparse exponential sums of the form $f(t) = \sum_{j=1}^{K} \gamma_{j} \, \cos(2\pi a_{j} t + b_{j})$,…
Representing real-time data as a sum of complex exponentials provides a compact form that enables both denoising and extrapolation. As a fully data-driven method, the Estimation of Signal Parameters via Rotational Invariance Techniques…
In this paper we derive a new recovery procedure for the reconstruction of extended exponential sums of the form $y(t) = \sum_{j=1}^{M} \left( \sum_{m=0}^{n_j} \, \gamma_{j,m} \, t^{m} \right) {\mathrm e}^{2\pi \lambda_j t}$, where the…
In this paper, we introduce a new approach for the recovery of rational functions. The concept we propose is based on using the exponential structure of the Fourier coefficients of rational functions and the reconstruction of this…
In this paper, we derive a new method for optimal $\ell^{1}$- and $\ell^2$-approximation of discrete signals on ${\mathbb N}_{0}$ whose entries can be represented as an exponential sum of finite length. Our approach employs Prony's method…
The problem of approximating a sampled function using sums of a fixed number of complex exponentials is considered. We use alternating projections between fixed rank matrices and Hankel matrices to obtain such an approximation. Convergence,…
We propose a new fast algorithm for simultaneous recovery of the coil sensitivities and of the magnetization image from incomplete Fourier measurements in parallel MRI. Our approach is based on a parameter model for the coil sensitivities…
In this work, we present a comprehensive framework for approximating the weakly singular power-law kernel $t^{\alpha-1}$ of fractional integral and differential operators, where $\alpha \in (0,1)$ and $t \in [\delta,T]$ with…
We introduce SPIRAL, a SuPerlinearly convergent Incremental pRoximal ALgorithm, for solving nonconvex regularized finite sum problems under a relative smoothness assumption. Each iteration of SPIRAL consists of an inner and an outer loop.…
In this paper Estimation of Signal Parameters via Rotational Invariance Techniques (ESPRIT) is developed for spectral estimation with single-snapshot measurement. Stability and resolution analysis with performance guarantee for…
In this paper, we propose a method to approximate the Gaussian function on ${\mathbb R}$ by a short cosine sum. We generalise and extend the differential approximation method proposed in [4, 40] to approximate $\mathrm{e}^{-t^{2}/2\sigma}$…
Subspace-based signal processing techniques, such as the Estimation of Signal Parameters via Rotational Invariant Techniques (ESPRIT) algorithm, are popular methods for spectral estimation. These algorithms can achieve the so-called…
Given $\beta>0$ and $\delta>0$, the function $t^{-\beta}$ may be approximated for $t$ in a compact interval $[\delta,T]$ by a sum of terms of the form $we^{-at}$, with parameters $w>0$ and $a>0$. One such an approximation, studied by…
Prony's method, in its various concrete algorithmic realizations, is concerned with the reconstruction of a sparse exponential sum from integer samples. In several variables, the reconstruction is based on finding the variety for a zero…
In this work, we propose a subspace-based algorithm for direction-of-arrival (DOA) estimation, referred to as two-step knowledge-aided iterative estimation of signal parameters via rotational invariance techniques (ESPRIT) method (Two-Step…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
One of the greatest success stories of randomized algorithms for linear algebra has been the development of fast, randomized algorithms for highly overdetermined linear least-squares problems. However, none of the existing algorithms is…
Purpose: Parallel imaging methods in MRI have resulted in faster acquisition times and improved noise performance. ESPIRiT is one such technique that estimates coil sensitivity maps from the auto-calibration region using an eigenvalue-based…