Proceedings ArticleDOI
A nearly optimal transformation
Zhongde Wang
- Vol. 11, pp 997-1000
TLDR
Criteria for measuring the closeness of a transform to the Karhunen-Loeve transform show that the phase shift cosine transform measures closer to the even part of the KLT than the version II of the discrete Cosine transform (DCT-II).Abstract:
A new transform, the phase shift cosine transform (PSCT), is introduced. It almost diagonizes the even part of the covariance matrix of a high correlated Markov-I sequence. Several criteria are established for measuring the closeness of a transform to the Karhunen-Loeve transform (KLT). All these criteria show that the PSCT measures closer to the even part of the KLT than the version II of the discrete cosine transform (DCT-II).read more
Citations
More filters
A fast Karhunen-Loeve transform for a class of random processes
TL;DR: 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.
Adaptive coding of monochrome and color images
Wen-Hsiung Chen,C. Smith +1 more
TL;DR: An efficient adaptive encoding technique using a new implementation of the Fast Discrete Cosine Transform (FDCT) for bandwidth compression of monochrome and color images is described, demonstrating excellent performance in terms of mean square error and direct comparison of original and reconstructed images.
Patent
Merge and split generalized block transform method
TL;DR: A generalized radix-2 block transform method enables true split and merge transform processing of equal sized data halves in the transform domain enabling recursive merges and splits in transform domain data degradation.
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.
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
Adaptive Coding of Monochrome and Color Images
Wen-Hsiung Chen,C. Smith +1 more
TL;DR: In this article, an efficient adaptive encoding technique using a new implementation of the Fast Discrete Cosine Transform (FDCT) for bandwidth compression of monochrome and color images is described.
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.
Journal ArticleDOI
A Fast Karhunen-Loeve Transform for a Class of Random Processes
TL;DR: In this paper, the Karhunen-Loeve transform for a class of signals is proven to be a set of periodic sine functions and this k-means expansion can be obtained via an FFT algorithm.
Related Papers (5)
Use of Fourier and Karhunen-Loeve decomposition for fast pattern matching with a large set of templates
Michihiro Uenohara,Takeo Kanade +1 more