scientific article; zbMATH DE number 4043752
[For the entire collection see Zbl 0614.00001.] This paper presents an adaptive algorithm for the restoration of lost sample values in discrete-time signals that can locally be modelled as autoregressive processes. The only restrictions are that the positions of the unknown samples should be known and that they should be embedded in a sufficiently large neighbourhood of known samples. The estimates of the unknown samples are obtained by iteratively minimizing the sum of squares of the residual errors that involve estimates of the autoregressive parameters. A statistical analysis shows that, for a burst of lost samples, the expected quadratic restoration error per sample converges to the signal variance when the burst length tends to infinity. The numerical robustness of the method is investigated. The method has been developed to be used on digitized music and speech signals.
- Missing Data Restoration Algorithm
- Restoring lost samples from an oversampled band-limited signal
- Some nonlinear/adaptive methods for fast recovery of the missing samples of signals
- The ill-posedness of restoring lost samples and regularized restoration for band-limited signals
- Regularized restoration for two dimensional band-limited signals
- scientific article; zbMATH DE number 3854954 (Why is no real title available?)
- scientific article; zbMATH DE number 4008264 (Why is no real title available?)
- scientific article; zbMATH DE number 1051023 (Why is no real title available?)
- scientific article; zbMATH DE number 2112196 (Why is no real title available?)
- Some nonlinear/adaptive methods for fast recovery of the missing samples of signals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780880)