scispace - formally typeset
Search or ask a question
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
More filters
Patent
03 Mar 1975
TL;DR: In this paper, a transform structure employing surface wave devices performs Fourier transform operations on a time-limited substantially band limited signal, and the output signal of the transform structure is related to the input signal in a manner which permits forming the product of this output with a similar output of a second transform structure.
Abstract: A transform structure employing surface wave devices performs Fourier transform operations on a time-limited substantially band limited signal. The output signal of the transform structure is related to the Fourier transform of the input signal in a manner which permits forming the product of this output with a similar output of a second transform structure. This product is inverted by a third transform structure so as to provide the convolution of the two original input functions. The overall structure comprises a filter apparatus readily programable in either the time or frequency domain.

16 citations

Journal ArticleDOI
TL;DR: Experimental results conclude that the proposed CAD system using MFCC technique for AD recognition has a great improvement for the system performance with small number of significant extracted features, as compared with the CAD system based on DCT, DST, DWT, and the hybrid combination methods of the different transform techniques.
Abstract: The different discrete transform techniques such as discrete cosine transform (DCT), discrete sine transform (DST), discrete wavelet transform (DWT), and mel-scale frequency cepstral coefficients (MFCCs) are powerful feature extraction techniques. This article presents a proposed computer-aided diagnosis (CAD) system for extracting the most effective and significant features of Alzheimer’s disease (AD) using these different discrete transform techniques and MFCC techniques. Linear support vector machine has been used as a classifier in this article. Experimental results conclude that the proposed CAD system using MFCC technique for AD recognition has a great improvement for the system performance with small number of significant extracted features, as compared with the CAD system based on DCT, DST, DWT, and the hybrid combination methods of the different transform techniques.

16 citations

Journal ArticleDOI
TL;DR: A modified version of the Winograd-Fourier transform algorithm is presented for use in transforming real vectors, using real arithmetic and real storage of intermediate results throughout while retaining the economy of Winog rad's basic method.
Abstract: A modified version of the Winograd-Fourier transform algorithm is presented for use in transforming real vectors. The new algorithm uses real arithmetic and real storage of intermediate results throughout while retaining the economy of Winograd's basic method. The derivation of the transform is explained and some programming techniques are discussed and illustrated.

16 citations

Journal ArticleDOI
TL;DR: An efficient time-splitting compact finite difference method for Gross–Pitaevskii equation (GPE) that does not need linear-algebraic-equations-solver, whose computation cost will be much higher when the spatial dimension increases.

16 citations

Proceedings ArticleDOI
01 Sep 2013
TL;DR: An extended performance comparison of HWT for image compression is presented with varying the constituent transforms and the proportions of the constituent performs better as compared to 1:1 proportion of constituent transforms for different compression ratios.
Abstract: The rapid growth of digital imaging applications have increased the need for effective image compression techniques Image compression minimizes the size of the image without degrading the quality of the image to an unacceptable level Image compression in transform domain is one of the most popular techniques Previous work has proved that the hybrid wavelet transforms (HWT) are better than the respective constituent orthogonal transforms in image compression[1, 2] Here the extended performance comparison of HWT for image compression is presented with varying the constituent transforms and the proportions of the constituent transforms to test the effect on quality of image compression The experimentation is done on set of 20 images by varying the constituent transforms, proportion of constituent transforms and compression ratios (CR) The constituent transforms used to generated HWT are Cosine transform, Sine transform, Slant transform, Kekre transform, Walsh transform and Haar transform Here five proportions of constituent transforms alias 1:16, 1:4, 1:1, 4:1, 16:1 are considered for generation of HWT Results prove that 4:1, 1:1, 1:4 proportions of constituent transforms in HWT gives better performance as compared to 1:1 proportion of constituent transforms for different compression ratios Also for 95% compression ratio, 4:1 ratio of DCT-Haarconstituent transforms in HWT gives better results 1:1 ratio of DCT-Haarconstituent transforms give better results for compression ratios between 70% and 90% For lower compression ratios, 1:4 proportions of DCT-Haarconstituent transformsin HWT gives better performance

16 citations


Network Information
Related Topics (5)
Feature extraction
111.8K papers, 2.1M citations
84% related
Image processing
229.9K papers, 3.5M citations
82% related
Image segmentation
79.6K papers, 1.8M citations
82% related
Optimization problem
96.4K papers, 2.1M citations
81% related
Network packet
159.7K papers, 2.2M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20234
202234
202124
202021
201925
201833