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 published on a yearly basis
Papers
More filters
TL;DR: The author comments on the paper by Hu et al. (IEEE Trans. Signal Processing, vol.40, no.12, p.2951-60, 1992) about transforms and convolution procedures defined in the above paper.
Abstract: The author comments on the paper by Hu et al. (IEEE Trans. Signal Processing, vol.40, no.12, p.2951-60, 1992). Information is provided about prior published work that precedes the transforms and convolution procedures defined in the above paper. >
22 citations
TL;DR: In this paper, a piecewise Hilbert transform was proposed to suppress the background intensity of the deformed fringe pattern using only one fringe pattern in Fourier transform profilometry according to the approximation that the background of the fringe is a slowly varying function and its distribution in each half period of a fringe can be regarded as a constant.
22 citations
10 Sep 2000
TL;DR: The generalized lapped biorthogonal transform embedded inverse discrete cosine transform (ge-IDCT) with nonlinear weighting in the embedded transform domain can reconstruct the signal with alleviated blockishness.
Abstract: This paper presents the generalized lapped biorthogonal transform embedded inverse discrete cosine transform (ge-IDCT) as an alternative to the IDCT. The ge-IDCT with nonlinear weighting in the embedded transform domain can reconstruct the signal with alleviated blockishness. Additional complexity, imposed by the replacement, is trivial thanks to an efficient lattice structure. The proposed ge-IDCT is applied in the JPEG still image compression standard to demonstrate its validity.
22 citations
TL;DR: In this article, a real color fractional Fourier transform hologram (FLFTH) was proposed for anti-counterfeiting, which is based on the FFTH.
22 citations
01 Dec 1988
TL;DR: It is shown that by using an index mapping scheme, the multidimensional discrete Hartley transform can be changed into convolutions that can be calculated very efficiently via the Fermat number transform.
Abstract: It is shown that by using an index mapping scheme, the multidimensional discrete Hartley transform can be changed into convolutions that can be calculated very efficiently via the Fermat number transform. Compared with existing algorithms, the number of multiplications is reduced by a factor of 8 to 20, at the expense of a slight increase in the number of shift and add operations, that are assumed to be simpler than multiplications.
22 citations