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
11 Dec 2002
TL;DR: In this article, a fast discrete cosine transform (DCT) method was proposed to perform fast DCT by computing the DCT in five stages using three coefficients, and scaling the outputs using a plurality of scaling coefficients.
Abstract: Systems and methods are disclosed to perform fast discrete cosine transform (DCT) by computing the DCT in five stages using three coefficients, and scaling the outputs using a plurality of scaling coefficients.

23 citations

Journal ArticleDOI
TL;DR: A method for converting any nesting DFT algorithm to the type-I discrete W transform (DWT-I) is introduced and is more efficient that either WFTA or PFA for large N, and it is more flexible for the choice of transform length.
Abstract: A method for converting any nesting DFT algorithm to the type-I discrete W transform (DWT-I) is introduced. A nesting algorithm that differs from either the Windograd Fourier transform algorithm (WFTA) or the prime factor FFT algorithm (PFA) is presented. New small-N DETs, which are suitable for this nesting algorithm, are developed based on using sparse matrix decomposition. The proposed algorithm is more efficient that either WFTA or PFA for large N, and it is more flexible for the choice of transform length, because 32 points are used. For 2D processing, the proposed algorithm is more efficient than the polynomial transform. >

23 citations

Journal ArticleDOI
TL;DR: In this paper, a 2D semi-adaptive local cosine transform is proposed for the SEG-EAEG salt model synthetic data set for compression, which can preserve important features of the data set even in the high compression ratio (CR=40:1) case.
Abstract: The local cosine/sine basis is a localized version of the cosine/sine basis with a window function which can have arbitrary smoothness. It has orthogonality and good time and frequency localization properties. The adaptive local cosine/sine basis is a best-basis obtained from an overabundant library of cosine/sine packets based on a cost-functional. We propose a 2D semi-adaptive (time-adaptive or space-adaptive) local cosine transform (referred to as a 2D semi-ALCT) and apply it to the SEG–EAEG salt model synthetic data set for compression. From the numerical results, we see that most of the important features of the data set can be well preserved even in the high compression ratio (CR=40:1) case. Using reconstructed data from the highly compressed ALCT coefficients (CR=40:1) for migration, we can still obtain a high-quality image including subsalt structures. Furthermore, we find that the window partition, generated by the 2D semi-ALCT, is well adapted to the characteristics of the seismic data set, and the compression capability of the 2D semi-ALCT is greater than that of the 2D uniform local cosine transform (2D ULCT). We find also that a (32, 32) or (32, 64) minimum (time, space) window size can generate the best compression results for the SEG–EAEG salt data set.

23 citations

Patent
Fumie Hazu1, Masahiro Iwadare1
12 Jul 1991
TL;DR: In this paper, the transform coefficients are weighted according to a prescribed pattern such as human's auditory sensitivity, and a second bit assignment value is further adaptively assigned to each transform coefficient according to the power distribution of the weighted transform coefficients.
Abstract: Digital samples of an underlying analog audio-frequency signal are converted to transform coefficients and a first bit assignment value indicating the number of quantization levels or bits is adaptively assigned to each coefficient according to the power distribution of the transform coefficients. The transform coefficients are weighted according to a prescribed pattern such as human's auditory sensitivity, and a second bit assignment value is further adaptively assigned to each transform coefficient according to the power distribution of the weighted transform coefficients. One of the first and second bit assignment values is selected according to the power distribution of the transform coefficients and used to quantize the transform coefficients. The quantized transform coefficients are multiplexed with supplemental information derived from the transform coefficients for transmission to a receiving site. A process inverse to that at the transmitting site is performed on the multiplexed signal to recover the original digital samples.

23 citations

Journal ArticleDOI
TL;DR: The Heisenberg Uncertainty principles for the two-dimensional nonseparable linear canonical transform (2-D NSLCT) are derived and the functions that can achieve the lower bound of the inequality are found.

23 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