Data compression under constraints of causality and variable finite memory
From MaRDI portal
Publication:1957277
DOI10.1016/j.sigpro.2010.04.001zbMath1197.94129OpenAlexW1968515662MaRDI QIDQ1957277
Stanley J. Miklavcic, Anatoli Torokhti
Publication date: 24 September 2010
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.04.001
Related Items (2)
Filtering of infinite sets of stochastic signals: an approach based on interpolation techniques ⋮ Operator Approximation for Processing of Large Random Data Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The SVD and reduced rank signal processing
- Best approximation of the identity mapping: The case of variable finite memory
- Computational methods for modelling of nonlinear systems
- Towards theory of generic principal component analysis
- Optimal multilinear estimation of a random vector under constraints of causality and limited memory
- Filtering and compression for infinite sets of stochastic signals
- Rank-One Approximation to High Order Tensors
- A theory for multiresolution signal decomposition: the wavelet representation
- The Distributed Karhunen–Loève Transform
- Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
- Wavelets and filter banks: theory and design
- Wavelets
- Abstract Optimal Linear Filtering
- Generic Weighted Filtering of Stochastic Signals
- Optimal transform formed by a combination of nonlinear operators: the case of data dimensionality reduction
- Wavelet footprints: theory, algorithms, and applications
- A Generalized Karhunen–Loeve Basis for Efficient Estimation of Tropospheric RefractivityUsing Radar Clutter
- Computational signal processing with wavelets
This page was built for publication: Data compression under constraints of causality and variable finite memory
