A Fast Karhunen Loeve Transform for a Class of Random Processes

IEEE Transactions on Communications

Volumn 24, Issue 9, 1976, Pages 1023-1029

  Jain, Anil K ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL PROCESSING;

EID: 0016996505     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1976.1093409     Document Type: Article

References (23)

1. A. K. Jain, “A fast Karhunen Loeve transform for finite discrete images,” in Proc. Nat. Electron. Conf., Chicago, IL, Oct. 1974
2. H. C. Andrews, Computer Techniques in Image Processing. New York: Academic Press, 1970.
3. W. H. Chen, “Slant transform image coding,” Ph.D. dissertation, Univ. of Southern California, Los Angeles, May 1973.
4. W. K. Pratt, “A comparison of digital image transforms,” presented at the Mervin J. Kelly Communication Conf., Univ. of Missouri, Rolla, MO, Oct. 1970.
5. A. Habibi and P. A. Wintz, “Image coding by linear transformation and block quantization,” IEEE Trans. Commun. Tech., vol. COM-19, Feb. 1971.
6. N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. C-23, pp. 90–93, Jan. 1974.
7. P. A. Wintz, “Transform picture coding,” Proc. IEEE, vol. 60, pp. 809–820, July 1972.
8. W. K. Pratt, “Karhunen Loeve transform coding of images,” in Proc. 1970 IEEE Int. Symp. Inform. Theory, 1970.
9. H. P. Kramer and M. V. Mathews, “A linear coding for transmitting a set of correlated signals,” IRE Trans. Inform. Theory, vol. IT-2, pp. 41–46, Sept. 1956.
10. H. Hotelling, “Analysis of a complex of statistical variables into principal components,” J. Educ. Psychology, vol. 24, pp. 417-441,498-520,1933. 441, 498-520, 1933.
11. W. D. Ray and R. M. Driver, “Further decomposition of the Karhunen Loeve series representation of a stationary random process,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 663–668, 668, Nov. 1970.
12. V. R. Algazi and D. J. Sakrison, “On the optimality of the Karhunen Loeve expansion,” IEEE Trans. Inform. Theory (Corre s p.), pp. 319–321, Mar.1969.
13. S. Watanabe, “Karhunen Loeve expansion and factor analysis, theoretical remarks and applications,” in Trans. 4th Prague Conf. Inform. Theory, Statist. Decision Functions and Random Processes, Prague, The Netherlands, pp. 635-660, 1965.
14. A. K. Jain, “Image coding via a nearest neighbors image model,” IEEE Trans. Commun., vol. COM-23, pp. 318–331, Mar. 1975.
15. A. K. Jain and E. Angel, “Image restoration, modelling and reduction of dimensionality,” IEEE Trans. Comput., vol. C-23, May 1974.
16. I. J. Good, “The interaction algorithm and practical Fourier analysis,” J. Royal Statistical Soc. (London), vol. B20, p. 361, 1958.
17. E. O. Brigham, The Fast Fourier Transform. Englewood Cliffs, NJ: Prentice Hall, pp. 167-169, 1974.
18. A. K. Jain, “A fast Karhunen Loeve transform for recursive filtering of images corrupted by white and colored noise,” to be published.
19. “Computer program for fast Karhunen Loeve transform algorithm,” Dep. Electr. Eng., SUNY, Buffalo, NY, Final Rep. NASA Contract NAS8-31434, Feb. 1976.
20. A. K. Jain and D. G. Lainiotis, “A fast biorthogonal expansion for optimum feature extraction of a class of image data,” presented at the Johns Hopkins Conf. on Inform. & Syst. Sc., Baltimore, MD, Apr. 1975.
21. A. K. Jain, “Image restoration by operator factorization of point spread function and image covariance function,” Dep. Elects. Eng., SUNY, Buffalo, NY, Tech. Rep. 75–001, Oct. 1975.
22. A. K. Jain, S. H. Wang, and Y. Z. Liao, “Fast KL transform data compression studies,” in Proc. Nat. Telecommun. Conf, Dallas, TX, to be published.
23. A. K. Jain, Multidimensional Techniques in Computer Image Processing, to be published.