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
Proceedings ArticleDOI
22 May 2005
TL;DR: It is found from the experimental results, that 3-D discrete Hartley transform yields the best results for magnetic resonance brain images whereas for X-ray angiograms the 3- D discrete cosine transform is found to be superior to the other two transforms.
Abstract: In this paper, 3-D discrete Hartley, cosine and Fourier transforms are used for the compression of magnetic resonance images and X-ray angiograms. The performance results are then compared and evaluated. The transforms are applied on image blocks of sizes 8times8timesM where M represents the number of slices. The resultant transform coefficients are quantized and then encoded using a combination of run length and Huffman coding schemes to achieve maximum compression. The performances of the transforms are evaluated in terms of peak signal to noise ratio and bit rate. It is found from the experimental results, that 3-D discrete Hartley transform yields the best results for magnetic resonance brain images whereas for X-ray angiograms the 3-D discrete cosine transform is found to be superior to the other two transforms

13 citations

Journal ArticleDOI
TL;DR: An in-place algorithm for the fast, direct computation of the forward and inverse discrete cosine transform is presented and evaluated.
Abstract: An in-place algorithm for the fast, direct computation of the forward and inverse discrete cosine transform is presented and evaluated. The transform length may be an arbitrary power of two.

13 citations

Proceedings ArticleDOI
13 May 2002
TL;DR: A number of new applications, such as frequency estimation of noise-corrupted short length sinusoids, discrete multitone transmission, and oversampled nonuniform filter banks, are described.
Abstract: The recently introduced concept of warped discrete Fourier transform (WDFT) [2] is reviewed and its main properties are compared with that of their well-known DFT counterparts. A number of new applications, such as frequency estimation of noise-corrupted short length sinusoids, discrete multitone transmission, and oversampled nonuniform filter banks, are described. In addition, some important design issues, such as the sensitivity of computing the inverse WDFT, are included.

13 citations

Proceedings ArticleDOI
18 Mar 2005
TL;DR: A new signal transform for computing the spectrum of a signal given on a two-dimensional directional quincunx lattice is introduced and derived using recently discovered connections between signal transforms and polynomial algebras.
Abstract: We introduce a new signal transform for computing the spectrum of a signal given on a two-dimensional directional quincunx lattice. The transform is non-separable, but closely related to a two-dimensional (separable) discrete Fourier transform. We derive the transform using recently discovered connections between signal transforms and polynomial algebras. These connections also yield several important properties of the new transform.

13 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