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 Oct 1971
TL;DR: An odd discrete Fourier transform (ODFT) which relates in several ways to the usual discrete Fouriers transform (DFT) is introduced and discussed and can readily be applied to spectrum and correlation computations on real signals.
Abstract: An odd discrete Fourier transform (ODFT) which relates in several ways to the usual discrete Fourier transform (DFT) is introduced and discussed. Its main advantage is that it can readily be applied to spectrum and correlation computations on real signals, by halving the storage capacity and greatly reducing the number of necessary steps.
27 citations
••
10 Nov 2003TL;DR: The algorithm is based on a novel contrast measure that is defined for each DCT coefficient that can be applied to the enhancement of images compressed with JPEG and it is especially useful when it is applied to enhance the direction contrast of the images.
Abstract: In this paper a new algorithm is presented for image enhancement in the discrete cosine transform (DCT) domain. The algorithm is based on a novel contrast measure that is defined for each DCT coefficient. This algorithm can be applied to the enhancement of images compressed with JPEG and it is especially useful when it is applied to enhance the direction contrast of the images. Experimental results show the effectiveness of the proposed algorithm.
27 citations
••
10 Jun 2013
27 citations
••
TL;DR: A (q,h)-Laplace transform on specific time scales is developed and it is shown that the transform is reduced for h=0 to the q- Laplace transform, reduce for q=1 to the h-Laplacetransform and reduced for q =h= 1 to the Z-transform.
Abstract: In this paper, we develop a (q,h)-Laplace transform on specific time scales. We show that the transform is reduced for h=0 to the q-Laplace transform, reduce for q=1 to the h-Laplace transform and reduced for q=h=1 to the Z-transform. Finally, we employ the (q,h)-Laplace transform to produce some key results.
27 citations
••
TL;DR: The results show that of all the interpolation schemes via fast sinusoidal transforms, the proposed scheme is the most promising.
27 citations