Signal recognition: Fourier transform vs. Hartley transform.

DOI10.1016/S0031-3203(03)00220-6MaRDI QIDQ1425976zbMATH OpenFDO

Authors D. Massart, Leonid Gelman, Michael J. Sanderson, Christopher G. Thompson

Publication date 14 March 2004

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0031-3203(03)00220-6

zbMATH Keywords

Gaussian recognitionHartley transformLikelihood ratioReal and imaginary Fourier componentsStatistical pattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Fourier and Hartley transforms -- a mathematical twin
• scientific article; zbMATH DE number 4114088
• scientific article; zbMATH DE number 3926793
• Anwendung der Hartley-Transformation bei der Maschinenüberwachung und -diagnose
• scientific article; zbMATH DE number 5257523

Cites work

• Estimation of general 2D affine motion using Fourier descriptors
• Fourier Descriptors for Plane Closed Curves
• Fourier Preprocessing for Hand Print Character Recognition
• High accuracy character recognition algorithm using Fourier and topological descriptors
• scientific article; zbMATH DE number 4031028 (Why is no real title available?)
• scientific article; zbMATH DE number 3893753 (Why is no real title available?)

Cited in

(2)

• Potential functions-based wavelet transforms in pattern recognition problems
• New convolutions for the Hartley integral transform imbedded in the Banach algebras and convolution-type integral equations

This page was built for publication: Signal recognition: Fourier transform vs. Hartley transform.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1425976)