Topic
Discrete sine transform
About: Discrete sine transform is a research topic. Over the lifetime, 3269 publications have been published within this topic receiving 73181 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The author presents an improved algorithm to implement the forward and backward NEXT in MPEG layer III that requires less calculation than Britanak and Rao's algorithm and employs the same module to compute both theforward and backward MDCT.
Abstract: Britanak and Rao (see IEEE Signal Processing Lett., vol. 8, p. 48-51, Feb. 2001) recently proposed an efficient algorithm to implement the forward and backward modified discrete cosine transform (MDCT) in MPEG layer III. This algorithm employs discrete cosine transform of type II (DCT-II) and discrete sine transform of type II (DST-II) to compute the forward MDCT, and uses their inverses to compute the backward MDCT. The author presents an improved algorithm to implement the forward and backward NEXT in MPEG layer III. Notably, the proposed algorithm requires less calculation than Britanak and Rao's algorithm does. Furthermore, it employs the same module to compute both the forward and backward MDCT. Thus, when compared to the former algorithm, the proposed algorithm is implemented more easily.
51 citations
01 Jan 1996
51 citations
TL;DR: A new linear integral transform is defined, which is called the exponential chirp transform, which provides frequency domain image processing for space-variant image formats, while preserving the major aspects of the shift-invariant properties of the usual Fourier transform.
Abstract: Space-variant (or foveating) vision architectures are of importance in both machine and biological vision. In this paper, we focus on a particular space-variant map, the log-polar map, which approximates the primate visual map, and which has been applied in machine vision by a number of investigators during the past two decades. Associated with the log-polar map, we define a new linear integral transform, which we call the exponential chirp transform. This transform provides frequency domain image processing for space-variant image formats, while preserving the major aspects of the shift-invariant properties of the usual Fourier transform. We then show that a log-polar coordinate transform in frequency provides a fast exponential chirp transform. This provides size and rotation, in addition to shift, invariant properties in the transformed space. Finally, we demonstrate the use of the fast exponential chirp algorithm on a database of images in a template matching task, and also demonstrate its uses for spatial filtering.
51 citations
TL;DR: Some corrections are made for the original paper "A fast computational algorithm for the discrete cosine transform," 1 which contains some errors of indexes and of multiplication factors.
Abstract: Some corrections are made for the original paper "A fast computational algorithm for the discrete cosine transform," 1 which contains some errors of indexes and of multiplication factors.
51 citations
TL;DR: A new method for the discrete fractional Fourier transform (DFRFT) computation is given and the DFRFT of any angle can be computed by a weighted summation of the D FRFTs with the special angles.
Abstract: A new method for the discrete fractional Fourier transform (DFRFT) computation is given in this paper. With the help of this method, the DFRFT of any angle can be computed by a weighted summation of the DFRFTs with the special angles.
50 citations