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
••
01 Apr 1970
TL;DR: In this paper, a Hilbert transformation procedure for discrete data has been developed, which is useful in a variety of applications such as the analysis of sampled data systems and the simulation of filters.
Abstract: A Hilbert transformation procedure for discrete data has been developed. This transform could be useful in a variety of applications such as the analysis of sampled data systems and the simulation of filters.
119 citations
••
26 Apr 1985TL;DR: A fast radix-2 two dimensional discrete cosine transform (DCT) is presented and a reduction of more than 50% in the number of multiplications and a comparable amount of additions is obtained in comparison to other algorithm.
Abstract: A fast radix-2 two dimensional discrete cosine transform (DCT) is presented. First, the mapping into a 2-D discrete Fourier transform (DFT) of a real signal is improved. Then an usual polynomial transform approach is used in order to map the 2-D DFT into a reduced size 2-D DFT and one dimensional odd DFT's. Finally, optimized odd DFT algorithms for real signals are developped. All together, a reduction of more than 50% in the number of multiplications and a comparable amount of additions is obtained in comparison to other algorithm.
117 citations
••
TL;DR: In this article, the authors compared the effectiveness of the discrete cosine and Fourier transforms in decorrelating sampled signals with Markov-1 statistics, and showed that the DCT offers a higher (or equal) effectiveness than the discrete Fourier transform for all values of the correlation coefficient.
Abstract: This correspondence compares the effectiveness of the discrete cosine and Fourier transforms in decorrelating sampled signals with Markov-1 statistics. It is shown that the discrete cosine transform (DCT) offers a higher (or equal) effectiveness than the discrete Fourier transform (DFT) for all values of the correlation coefficient. The mean residual correlation is shown to vanish as the inverse square root of the sample size.
116 citations
••
TL;DR: A watermarking method, which minimizes the impact of the watermark implementation on the overall quality of an image, is developed using a peak signal-to-noise ratio to evaluate quality degradation.
Abstract: In this paper, we evaluate the degradation of an image due to the implementation of a watermark in the frequency domain of the image. As a result, a watermarking method, which minimizes the impact of the watermark implementation on the overall quality of an image, is developed. The watermark is embedded in magnitudes of the Fourier transform. A peak signal-to-noise ratio is used to evaluate quality degradation. The obtained results were used to develop a watermarking strategy that chooses the optimal radius of the implementation to minimize quality degradation. The robustness of the proposed method was evaluated on the dataset of 1000 images. Detection rates and receiver operating characteristic performance showed considerable robustness against the print-scan process, print-cam process, amplitude modulated, halftoning, and attacks from the StirMark benchmark software.
115 citations
••
TL;DR: In this paper, the same rules can be applied to create a new type of fractional-order Fourier transform which results in a smooth transition of a function when transformed between the real and Fourier spaces.
112 citations