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.

A Real Formalism Of Discrete Fourier Transform In Terms Of Skew-Circular Correlations And Its Computation By Fast Correlation Techniques

Abstract: Discrete fourier transform is represented as a real transform through using number groups and removing redundancy. The resulting configuration is further written in terms of (skew) circular correlations, which can be implemented by fast correlation techniques. The number of data points considered is a power of 2, even though the method can be generalized to any number of data points.© (1983) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

On the on-line computation of DCT-IV and DST-IV transforms

Abstract: Various options available for the on-line computation of discrete cosine transform-IV (DCT-IV) and discrete sine transform-IV (DST-IV) in hardware are considered and compared. A novel architecture for the simultaneous, real-time computation of both the transforms, based on the decomposition of the odd-time, odd-frequency discrete Fourier transform (O/sup 2/ DFT), is also proposed. >

Satellite Image Processing Using Discrete Cosine Transform and Singular Value Decomposition

Abstract: In this paper, a novel contrast enhancement technique for contrast enhancement of a low-contrast satellite image has been proposed based on the singular value decomposition (SVD) and discrete cosine transform (DCT). The singular value matrix represents the intensity information of the given image and any change on the singular values change the intensity of the input image. The proposed technique converts the image into the SVD-DCT domain and after normalizing the singular value matrix; the enhanced image is reconstructed by using inverse DCT. The visual and quantitative results suggest that the proposed SVD-DCT method clearly shows the increased efficiency and flexibility of the proposed method over the exiting methods such as the histogram equalization, gamma correction and SVD-DWT based techniques.

Order of N complexity transform domain adaptive filters

Abstract: Implementation of the transform domain adaptive filters is addressed. Recent results have shown that if the input data to a radix-2 fast Fourier transform (FFT) structure is sliding one sample at a time, only N-1 butterflies need to be calculated for updating the FFT structure, after the arrival of every new data sample. This is opposed to most of the previous reports that, assume order of N log N complexity, for such implementation. In this paper the sliding implementation of the other useful transforms, that can also be implemented with the order of N complexity, are worked out in detail. >

Optimal Discrete Gaussian Function: The Closed-Form Functions Satisfying Tao’s and Donoho’s Uncertainty Principle With Nyquist Bandwidth

Abstract: In this paper, closed-form discrete Gaussian functions are proposed. The first property of these functions is that their discrete Fourier transforms are still discrete Gaussian functions with different index parameter. This index parameter, which is an analogy to the variance in continuous Gaussian functions, controls the width of the function shape. Second, the discrete Gaussian functions are positive and bell-shaped. More important, they also have finite support and consecutive zeros. Thus, they satisfy Tao’s and Donoho’s uncertainty principle of discrete signal. The construction of these discrete Gaussian functions is inspired by Kong’s zeroth-order discrete Hermite Gaussian functions. Three examples are discussed.