On recovering missing values in a pathwise setting
@article{Dokuchaev2016OnRM, title={On recovering missing values in a pathwise setting}, author={Nikolai Dokuchaev}, journal={ArXiv}, year={2016}, volume={abs/1604.04967} }
The paper suggests a frequency criterion of error-free recoverability of a missing value for sequences, i.e., discrete time processes, in a pathwise setting, without using probabilistic assumptions on the ensemble. This setting targets situations where we deal with a sole sequence that is deemed to be unique and such that we cannot rely on statistics collected from other similar samples. A missing value has to be recovered using the intrinsic properties of this sole sequence. In the paper…
5 Citations
On exact and optimal recovering of missing values for sequences
- Computer Science, MathematicsSignal Process.
- 2017
On sampling theorem with sparse decimated samples: exploring branching spectrum degeneracy
- Mathematics
- 2017
The paper investigates possibility of recovery of sequences from their decimated subsequences. It is shown that this recoverability is associated with certain spectrum degeneracy of a new kind, and…
Optimal data recovery and forecasting with dummy long-horizon forecasts
- Computer ScienceArXiv
- 2016
A method of recovering missing values for sequences, including sequences with a multidimensional index, based on optimal approximation by processes featuring spectrum degeneracy is suggested, without using probabilistic assumptions on the ensemble.
On recovery of signals with single point spectrum degeneracy
- Mathematics, Computer ScienceArXiv
- 2018
Recovery problem for discrete time signals with a finite number of missing values for signals with Z-transform vanishing with a certain rate at a single point is studied.
On sampling theorem with sparse decimated samples
- MathematicsArXiv
- 2016
Application of the classical sampling Nyquist-Shannon-Kotelnikov theorem to general non-bandlimited functions allows an arbitrarily close uniform approximation by functions that are uniquely defined by the extremely sparse subsamples representing arbitrarily small fractions of one-sided equidist sample series with fixed oversampling parameter.
References
SHOWING 1-10 OF 19 REFERENCES
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Computer ScienceIEEE Transactions on Information Theory
- 2006
If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
ESTIMATION AND INTERPOLATION OF MISSING VALUES OF A STATIONARY TIME SERIES
- Engineering, Computer Science
- 1989
Abstract. A complete solution of the important problem of estimating (interpolating) the missing values of a stationary time series is obtained by decomposing it into a prediction plus regression…
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Computer ScienceIEEE Transactions on Information Theory
- 2007
This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln…
Complex analysis, operators, and related topics : the S.A. Vinogradov memorial volume
- Mathematics
- 2000
Stanislav Aleksandrovich Vinogradov, his life and mathematics.- List of publications of S.A.Vinogradov.- Interpolation problems for analytic functions continuous in the closed disk and for functions…
Band-limited extrapolation on the sphere for signal reconstruction in the presence of noise
- Mathematics2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
- 2014
An analytic solution to the extrapolation problem based on the expansion of a signal in Slepian basis corresponding to an orthogonal set of eigenfunctions of an associated energy concentration problem is presented.
SIGNAL RECOVERY FROM PARTIAL INFORMATION VIA ORTHOGONAL MATCHING PURSUIT
- Computer Science
- 2005
This article demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m…
On Minimality and Interpolation of Harmonizable Stable Processes
- Mathematics
- 1984
It is shown that a harmonizable symmetric $\alpha $-stable process, i.e. the Fourier coefficients of a process with independent symmetric $\alpha $-stable increments, with spectral density w is…
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Computer ScienceIEEE Transactions on Information Theory
- 2006
It is shown how one can reconstruct a piecewise constant object from incomplete frequency samples - provided that the number of jumps (discontinuities) obeys the condition above - by minimizing other convex functionals such as the total variation of f.
Predictors for Discrete Time Processes With Energy Decay on Higher Frequencies
- PhysicsIEEE Transactions on Signal Processing
- 2012
A family of one-step-ahead predictors is suggested for processes of which the energy decays at higher frequencies for which the prediction error can be made arbitrarily small.