A Fast Karhunen-Loeve Transform for a Class of Random Processes
From MaRDI portal
Publication:4130263
Cited in
(15)- Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
- Integer modified sine-cosine transforms type VII. A construction method and separable directional adaptive transforms for intra prediction with \(8 \times 8\) chroma blocks in image/video coding
- Signal flow graph approach to efficient and forward stable DST algorithms
- A fast algorithm for solving the first biharmonic boundary value problem
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
- Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors
- Fast restoration of finite objects degraded by finite PSF
- Algorithms for fast implementation of 4-point integer sine type VII transforms without multiplication and separable directional adaptive transforms for intra prediction in image/video coding
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- Partial differential equations and finite-difference methods in image processing. I: Image representation
- Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
- Modification of Karhunen-Loève transform for pattern recognition.
- Stochastic elastic properties of composite matrix material with random voids based on radial basis function network
- The discrete W transform
- Surrogate Modeling with Gaussian Processes for an Inverse Problem in Polymer Dynamics
This page was built for publication: A Fast Karhunen-Loeve Transform for a Class of Random Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4130263)