Feature extraction capability of some discrete transforms

The feature extraction capability of discrete cosine transform (DCT), Walsh-Hadamard transform (WHT), discrete Hartley transform (DHT) and their sign transformations are investigated and compared for the recognition of two-dimensional binary patterns. It is shown that the noise immunity of the transform-based feature extraction is rather promising.<<ETX>>

[1]  Okan K. Ersoy,et al.  A two-stage representation of DFT and its applications , 1987, IEEE Trans. Acoust. Speech Signal Process..

[2]  Okan K. Ersoy,et al.  Image recognition with the discrete rectangular-wave transform , 1988 .

[3]  M. Schroeder.  Number Theory in Science and Communication , 1984 .

[4]  Ja-Ling Wu,et al.  Comments on 'A two-stage representation of DFT and its applications' by O.K. Ersoy , 1988, IEEE Trans. Acoust. Speech Signal Process..

[5]  J. Pearl,et al.  Comparison of the cosine and Fourier transforms of Markov-1 signals , 1976 .

[6]  J.-L. Wu,et al.  Two-stage convolver-based DCT and IDCT algorithms , 1991 .

[7]  K. R. Rao,et al.  Orthogonal Transforms for Digital Signal Processing , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  O. Ersoy,et al.  Image recognition with the discrete rectangular wave transform , 1986, Annual Meeting Optical Society of America.

[9]  B. J. Stanton,et al.  Speech recognition with the discrete rectangular wave transform , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[10]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .