scispace - formally typeset
Search or ask a question
Topic

Hartley transform

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


Papers
More filters
Proceedings ArticleDOI
01 Jan 2004
TL;DR: The numerical examples show that the continuous wavelet transform constructed in this paper has higher computing accuracy compared with the classical continuous wavelets transform.
Abstract: In this paper, we propose a new type of continuous wavelet transform. However we discretize the variables of integral a and b, any numerical integral has a high resolution and a does not appear in the denominator of the integrand. Furthermore, we give two discretization methods of the new wavelet transform. For the one-dimensional situation, we give quadrature formula of the discretized inverse wavelet transform. For the multidimensional situation, we develop the commonly wavelet network based on the discretized inverse wavelet transform of the new wavelet transform. Finally, the numerical examples show that the continuous wavelet transform constructed in this paper has higher computing accuracy compared with the classical continuous wavelet transform.

26 citations

01 Nov 1995
TL;DR: The basic terminology and the main concepts of the area are introduced, as well as several application domains, providing common ground for further discussion and study.
Abstract: The Fourier transform is among the most widely used tools for transforming data sequences and functions from what is referred to as the {\it time domain} to the {\it frequency domain}. Applications of the transform range from designing filters for noise reduction in audio-signals (such as music or speech), to fast multiplication of polynomials. This report is meant to serve as a brief introduction to the Fourier transform, for readers who are not familiar with frequency domain. It introduces the basic terminology and the main concepts of the area, as well as several application domains, providing common ground for further discussion and study.

26 citations

Proceedings ArticleDOI
15 Mar 1999
TL;DR: An information-theoretic approach is presented to obtain an estimate of the number of bits that can be hidden in compressed image sequences and shows how addition of the message signal in a suitable transform domain rather than the spatial domain can significantly increase the data hiding capacity.
Abstract: We present an information-theoretic approach to obtain an estimate of the number of bits that can be hidden in compressed image sequences. We show how addition of the message signal in a suitable transform domain rather than the spatial domain can significantly increase the data hiding capacity. We compare the data hiding capacities achievable with different block transforms and show that the choice of the transform should depend on the robustness needed. While it is better to choose transforms with good energy compaction property (like DCT, wavelet etc.) when the robustness required is low, transforms with poorer energy compaction property (like the Hadamard or Hartley transform) are preferable choices for higher robustness requirements.

26 citations

Journal ArticleDOI
TL;DR: This article traced the history of the Laplace Transform up to 1880, when Poincare reinvented the transform, but did so in a more powerful context, that of properly conceived complex analysis.
Abstract: An earlier paper, to which this is a sequel, traced the history of the Laplace Transform up to 1880. In that year Poincare reinvented the transform, but did so in a more powerful context, that of properly conceived complex analysis. Rapid developments followed, culminating in Doetsch' work in which the transform took its modern shape.

26 citations

Journal ArticleDOI
TL;DR: In this paper, Shih et al. proposed a new fractional Fourier transform with four periodic eigenvalues with respect to the order of Hermite-Gaussian functions.

25 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
81% related
Image processing
229.9K papers, 3.5M citations
80% related
Optimization problem
96.4K papers, 2.1M citations
79% related
Feature extraction
111.8K papers, 2.1M citations
78% related
Matrix (mathematics)
105.5K papers, 1.9M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202230
202110
202014
201915
201820