A Fast Karhunen-Loeve Transform for a Class of Random Processes

From MaRDI portal
Publication:4130263

DOI10.1109/TCOM.1976.1093409zbMath0357.62081OpenAlexW2014512781MaRDI QIDQ4130263

Anil K. Jain

Publication date: 1976

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1976.1093409




Related Items (15)

The decimation-in-frequency algorithms for a family of discrete sine and cosine transformsStochastic Elastic Properties of Composite Matrix Material with Random Voids Based on Radial Basis Function NetworkSurrogate Modeling with Gaussian Processes for an Inverse Problem in Polymer DynamicsFast restoration of finite objects degraded by finite PSFAlgorithms for fast implementation of 4-point integer sine type VII transforms without multiplication and separable directional adaptive transforms for intra prediction in image/video codingSignal flow graph approach to efficient and forward stable DST algorithmsPartial differential equations and finite-difference methods in image processing. I: Image representationModification of Karhunen-Loève transform for pattern recognition.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 codingA fast algorithm for solving the first biharmonic boundary value problemSignal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal FactorsFast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transformsThe discrete W transformFast decimation-in-time algorithms for a family of discrete sine and cosine transformsOptimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model




This page was built for publication: A Fast Karhunen-Loeve Transform for a Class of Random Processes