Open Access
A fast Karhunen-Loeve transform for a class of random processes
A. Jain
- Vol. 76, pp 1023-1029
Reads0
Chats0
TLDR
The Karhunter-Loeve transform for a class of signals is proven to be a set of periodic sine functions and this Karhunen- Loeve series expansion can be obtained via an FFT algorithm, which could be useful in data compression and other mean-square signal processing applications.Abstract:
The Karhunen-Loeve transform for a class of signals is proven to be a set of periodic sine functions and this Karhunen-Loeve series expansion can be obtained via an FFT algorithm. This fast algorithm obtained could be useful in data compression and other mean-square signal processing applications.read more
Citations
More filters
Journal ArticleDOI
Image data compression: A review
TL;DR: A large variety of algorithms for image data compression are considered, starting with simple techniques of sampling and pulse code modulation (PCM) and state of the art algorithms for two-dimensional data transmission are reviewed.
Journal ArticleDOI
Fast algorithms for the discrete W transform and for the discrete Fourier transform
TL;DR: A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform as well as for the discrete Fourier transform, which makes new algorithms more efficient than conventional algorithms.
Journal ArticleDOI
Picture coding: A review
Arun N. Netravali,J.O. Limb +1 more
TL;DR: This paper presents a review of techniques used for digital encoding of picture material, covering statistical models of picture signals and elements of psychophysics relevant to picture coding, followed by a description of the coding techniques.
Journal ArticleDOI
Advances in mathematical models for image processing
TL;DR: Several state-of-the-art mathematical models useful in image processing are considered, including the traditional fast unitary transforms, autoregessive and state variable models as well as two-dimensional linear prediction models.
Journal ArticleDOI
A Sinusoidal Family of Unitary Transforms
TL;DR: A new family of unitary transforms is introduced and it is shown that the well-known discrete Fourier, cosine, sine, and the Karhunen-Loeve (KL) (for first-order stationary Markov processes) transforms are members of this family.
References
More filters
Journal ArticleDOI
Discrete Cosine Transform
TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
The fast Fourier Transform
TL;DR: A computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained and examples and detailed procedures are provided to assist the reader in learning how to use the algorithm.
Journal ArticleDOI
Image data compression: A review
TL;DR: A large variety of algorithms for image data compression are considered, starting with simple techniques of sampling and pulse code modulation (PCM) and state of the art algorithms for two-dimensional data transmission are reviewed.
Journal ArticleDOI
Fast algorithms for the discrete W transform and for the discrete Fourier transform
TL;DR: A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform as well as for the discrete Fourier transform, which makes new algorithms more efficient than conventional algorithms.