Hartley transform

About: Hartley transform is a research topic. Over the lifetime, 2709 publications have been published within this topic receiving 79944 citations.

A watermarking method combined with Radon transform and 2D-wavelet transform

Abstract: In this paper, a new image digital watermarking algorithm which combined the Radon transform with 2D-wavelet transform is proposed. And the finite Radon transform has been adopted to make it possible for radon transform to carry out invertible transform for digital images. The point singularity is transformed into the line singularity by the Radon transform. And the 2D-wavelet is very efficient in dealing with the point singularity. Experimental results demonstrate that the proposed algorithm has good performance in invisibility and robust, especially in brightness enhancement and weakening.

An analysis of real-Fourier domain-based adaptive algorithms implemented with the Hartley transform using cosine-sine symmetries

Abstract: The least mean squared (LMS) algorithm and its variants have been the most often used algorithms in adaptive signal processing. However the LMS algorithm suffers from a high computational complexity, especially with large filter lengths. The Fourier transform-based block normalized LMS (FBNLMS) reduces the computation count by using the discrete Fourier transform (DFT) and exploiting the fast algorithms for implementing the DFT. Even though the savings achieved with the FBNLMS over the direct-LMS implementation are significant, the computational requirements of FBNLMS are still very high, rendering many real-time applications, like audio and video estimation, infeasible. The Hartley transform-based BNLMS (HBNLMS) is found to have a computational complexity much less than, and a memory requirement almost of the same order as, that of the FBNLMS. This paper is based on the cosine and sine symmetric implementation of the discrete Hartley transform (DHT), which is the key in reducing the computational complexity of the FBNLMS by 33% asymptotically (with respect to multiplications). The parallel implementation of the discrete cosine transform (DCT) in turn can lead to more efficient implementations of the HBNLMS.

Method and apparatus for fast machine learning using probability maps and fourier transforms

Abstract: The present invention provides a method of constructing recognition models. Under the method, a set of probabilities is estimated for values of a hidden variable. A Fourier transform is determined for the set of probabilities and is used to determine a Fourier transform of an estimated prototype pattern. The inverse Fourier transform is then determined for the Fourier transform of the estimated prototype pattern to form an estimated prototype pattern.

Application of the discrete Laguerre transform to speech coding

Abstract: The discrete Laguerre transform (DLT) displays characteristics which make it amenable to the coding of speech. In this paper, the DLT is used in a classic transform coding method for speech and compared to the discrete cosine transform (DCT), which has been widely applied to speech coding. The results show promise, as the DLT outperforms the DCT at very low bitrates.