Accuracy of reconstruction of spike-trains with two near-colliding nodes

@article{Akinshin2017AccuracyOR,
title={Accuracy of reconstruction of spike-trains with two near-colliding nodes},
author={Andrey Akinshin and Gil Goldman and Vladimir P. Golubyatnikov and Yosef Yomdin},
journal={arXiv: Classical Analysis and ODEs},
year={2017}
}
• Published 5 January 2017
• Mathematics
• arXiv: Classical Analysis and ODEs
We consider a signal reconstruction problem for signals $F$ of the form $F(x)=\sum_{j=1}^{d}a_{j}\delta\left(x-x_{j}\right),$ from their moments $m_k(F)=\int x^kF(x)dx.$ We assume $m_k(F)$ to be known for $k=0,1,\ldots,N,$ with an absolute error not exceeding $\epsilon > 0$. We study the "geometry of error amplification" in reconstruction of $F$ from $m_k(F),$ in situations where two neighboring nodes $x_i$ and $x_{i+1}$ near-collide, i.e $x_{i+1}-x_i=h \ll 1$. We show that the error…
8 Citations

Figures from this paper

Error amplification in solving Prony system with near-colliding nodes
• Computer Science
• 2017
On this base accurate, up to the constants, lower and upper bounds on the worst case reconstruction error are produced, and how the Prony leaves can help in improving reconstruction accuracy is shown.
On Algebraic Properties of Low Rank Approximations of Prony Systems
• Mathematics
Complex Analysis and Operator Theory
• 2018
We consider the reconstruction of spike train signals of the form \begin{aligned} F(x) = \sum _{i=1}^d a_i \delta (x-x_i), \end{aligned}F(x)=∑i=1daiδ(x-xi),from their moments measurements
Accuracy of noisy Spike-Train Reconstruction: a Singularity Theory point of view
• Mathematics
• 2018
This is a survey paper discussing one specific (and classical) system of algebraic equations - the so called "Prony system". We provide a short overview of its unusually wide connections with many
Geometry and Singularities of Prony varieties
• Mathematics
• 2018
We start a systematic study of the topology, geometry and singularities of the Prony varieties $S_q(\mu)$, defined by the first $q+1$ equations of the classical Prony system \sum_{j=1}^d a_j x_j^k
Geometry of error amplification in solving the Prony system with near-colliding nodes
• Computer Science
Math. Comput.
• 2021
The reconstruction problem for “spike-train” signals is considered and a reconstruction solution is proposed for an a priori known form of this form.
Prony Scenarios and Error Amplification in a Noisy Spike-Train Reconstruction
• Mathematics
• 2018
The paper is devoted to the characterization of the geometry of Prony curves arising from spike-train signals. We give a sufficient condition which guarantees the blowing up of the amplitudes of a
N A ] 5 J un 2 01 8 Geometry and Singularities of Prony varieties
• Mathematics
• 2018
We start a systematic study of the topology, geometry and singularities of the Prony varieties Sq(μ), defined by the first q+1 equations of the classical Prony system ∑d j=1 ajx k j = μk, k = 0, 1, .
Algebraic Geometry of Error Amplification: the Prony leaves
• Mathematics
• 2017
We provide an overview of some results on the "geometry of error amplification" in solving Prony system, in situations where the nodes near-collide. It turns out to be governed by the "Prony

References

SHOWING 1-10 OF 30 REFERENCES
Geometry and Singularities of the Prony mapping
• Mathematics
• 2013
Prony mapping provides the global solution of the Prony system of equations $\Sigma_{i=1}^{n}A_{i}x_{i}^{k}=m_{k},\ k=0,1,...,2n-1.$ This system appears in numerous theoretical and applied
Accuracy of spike-train Fourier reconstruction for colliding nodes
• Computer Science
2015 International Conference on Sampling Theory and Applications (SampTA)
• 2015
An absolute lower bound is given for the “worst case” reconstruction error of F from F(F) for situations where the x<sub>j</sub> nodes are known to form an I elements cluster contained in an interval of length h.
Superresolution via sparsity constraints
Consider the problem of recovering a measure $\mu$ supported on a lattice of span $\Delta$, when measurements are only available concerning the Fourier Transform $\hat \mu (\omega )$ at frequencies
The recoverability limit for superresolution via sparsity
• Mathematics
ArXiv
• 2015
In the presence of additive deterministic noise of norm $\sigma$, upper and lower bounds on the minimax error rate that both scale like $(SRF)^{2k-1} \sigma$ are shown, providing a partial answer to a question posed by Donoho in 1992.
Exact Support Recovery for Sparse Spikes Deconvolution
• Computer Science, Mathematics
Found. Comput. Math.
• 2015
This paper shows that when the signal-to-noise level is large enough, and provided the aforementioned dual certificate is non-degenerate, the solution of the discretized problem is supported on pairs of Diracs which are neighbors of the Diracs of the input measure, as the grid size tends to zero.
Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolution
• Geology
• 1981
An algorithm is proposed for the reconstruction of a sparse spike train from an incomplete set of its Fourier components. It is shown that as little as 20–25 percent of the Fourier spectrum is
Nonlinear Approximation by Sums of Exponentials and Translates
• Mathematics
SIAM J. Sci. Comput.
• 2011
This paper solves the numerical solution of two nonlinear approximation problems by an approximate Prony method and proves the stability of the solution in the square and uniform norm.
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
The threshold at which noisy super-resolution is possible is exactly resolved, and a sharp phase transition is established for the relationship between the cutoff frequency and the separation, which allows the first noise tolerance bounds for the matrix pencil method to be given.