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: An image coding method for low bit rates based on alternate use of the discrete cosine transform and the discrete sine transform on image blocks achieves the removal of redundancies in the correlation between neighboring blocks as well as the preservation of continuity across the block boundaries.
Abstract: An image coding method for low bit rates is proposed. It is based on alternate use of the discrete cosine transform (DCT) and the discrete sine transform (DST) on image blocks. This procedure achieves the removal of redundancies in the correlation between neighboring blocks as well as the preservation of continuity across the block boundaries. An outline of the mathematical justification of the method, assuming a certain first-order Gauss-Markov model, is given. The resulting coding method is then adapted to nonstationary real images by locally adapting the model parameters and improving the block classification technique. Simulation results are shown and compared with the performance of related previous methods, namely adaptive DCT and fast Karhunen-Loeve transform (FKLT). >
73 citations
TL;DR: This letter defines a DFRFT based on a centered version of the DFT (CDFRFT) using eigenvectors derived from the Gru/spl uml/nbaum tridiagonal commutor that serve as excellent discrete approximations to the Hermite-Gauss functions.
Abstract: Existing versions of the discrete fractional Fourier transform (DFRFT) are based on the discrete Fourier transform (DFT). These approaches need a full basis of DFT eigenvectors that serve as discrete versions of Hermite-Gauss functions. In this letter, we define a DFRFT based on a centered version of the DFT (CDFRFT) using eigenvectors derived from the Gru/spl uml/nbaum tridiagonal commutor that serve as excellent discrete approximations to the Hermite-Gauss functions. We develop a fast and efficient way to compute the multiangle version of the CDFRFT for a discrete set of angles using the FFT algorithm. We then show that the associated chirp-frequency representation is a useful analysis tool for multicomponent chirp signals.
72 citations
TL;DR: A novel color image encryption algorithm based on Arnold- and discrete Hartley transform in gyrator transform domain is proposed, which can be well protected under chosen- and known plaintext attacks.
72 citations
TL;DR: The new fast algorithm can be adopted for the MDCT computation in the current audio coding standards such as MPEG family, and in commercial products such as Sony MiniDisc/ATRAC/ ATRAC2/SDDS digital audio coding systems, the AT & T Perceptual Audio Coder or Lucent Technologies PAC/Enhanced PAC/Multichannel PAC, and Dolby Labs AC-3 digital audio compression algorithm.
72 citations
TL;DR: The most efficient of the reviewed methods, which uses the Zak transform as an operational calculus, performs Gabor analysis and synthesis transforms with complexity of the same order as a fast Fourier transform (FFT).
Abstract: Equations for the continuous-parameter Gabor transform are presented and converted to finite discrete form suitable for digital computation. A comparative assessment of the computational complexity of several algorithms that execute the finite discrete equations is given, with results in the range O ( P 2 ) to O ( P log, P), where P is the number of input data points being transformed. The most efficient of the reviewed methods, which uses the Zak transform as an operational calculus, performs Gabor analysis and synthesis transforms with complexity of the same order as a fast Fourier transform (FFT).
72 citations