Discrete Cosine and Sine Transforms

Britaňák, Vladimír; Yip, P.; Rao, K. R.

doi:10.1016/b978-012373624-6/50003-5

Cited by 88 publications

(69 citation statements)

References 118 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the dual transformation of the error signal, the computational cost is reduced by using the relationship between the DCT and DST (see e.g. [10]), and calculating only one of the transformations.…”

Section: Simulation Results and Complexity Analysismentioning

confidence: 99%

“…In addition, as the simulation results given in the next section show, this algorithm has better convergence rate compared to the previous implementations of SDC [6] and CDC [5]. This decomposition also has a cost-effective implementation, since it can be calculated using only DCT and DST, for which various efficient algorithms are available [10].…”

Section: Dual Transform Domain Echo Canceller Realizationmentioning

confidence: 89%

See 1 more Smart Citation

Dual Transform Domain Echo Canceller for Discrete Multitone Systems

Ehtiati

Champagne

2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

In communication systems where full-duplex transmission is required, digital echo cancellers are employed to cancel echo by means of adaptive filtering. In order to reduce the computational complexity of these cancellers, the structure of the Toeplitz matrix containing the transmitted signal is usually exploited to transform the time domain signals and perform the emulation and adaptive update in a more convenient domain (e.g. frequency domain). In this paper, we consider a general decomposition of the Toeplitz matrix and examine the effect of different components of the decomposition on the computational complexity and convergence behaviour of the canceller. Based on this general decomposition, a new dual transform domain canceller is proposed which has improved convergence compared to the current echo cancellers and also does not require the transmission of dummy data on the unused tones.

show abstract

Section: Simulation Results and Complexity Analysismentioning

confidence: 99%

Section: Dual Transform Domain Echo Canceller Realizationmentioning

confidence: 89%

Dual Transform Domain Echo Canceller for Discrete Multitone Systems

Ehtiati

Champagne

2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…The discrete cosine transform has been introduced in 1974 [ 16 ]. An in-depth discussion of the DCT and many additional references can be found in [ 17 ]. The DCT is well-known for its use in image compression (JPEG) and video compression (MPEG, Daala, and Theora) [ 18 ].…”

Section: Introductionmentioning

confidence: 99%

Convolution Comparison Pattern: An Efficient Local Image Descriptor for Fingerprint Liveness Detection

Gottschlich

2016

PLoS ONE

View full text Add to dashboard Cite

We present a new type of local image descriptor which yields binary patterns from small image patches. For the application to fingerprint liveness detection, we achieve rotation invariant image patches by taking the fingerprint segmentation and orientation field into account. We compute the discrete cosine transform (DCT) for these rotation invariant patches and attain binary patterns by comparing pairs of two DCT coefficients. These patterns are summarized into one or more histograms per image. Each histogram comprises the relative frequencies of pattern occurrences. Multiple histograms are concatenated and the resulting feature vector is used for image classification. We name this novel type of descriptor convolution comparison pattern (CCP). Experimental results show the usefulness of the proposed CCP descriptor for fingerprint liveness detection. CCP outperforms other local image descriptors such as LBP, LPQ and WLD on the LivDet 2013 benchmark. The CCP descriptor is a general type of local image descriptor which we expect to prove useful in areas beyond fingerprint liveness detection such as biological and medical image processing, texture recognition, face recognition and iris recognition, liveness detection for face and iris images, and machine vision for surface inspection and material classification.

show abstract

“…The discrete sine transform (DST) [1] with a real basis reproduces functionality in space or time dependence similar to the DFT. DST and DFT interrelate strict mathematical forms that allow finding an effective way to compute one transform through another.…”

Section: Introductionmentioning

confidence: 99%

“…There are 8 types of DST I-VIII discrete sine transform discussed in [1]. Information technologies widely use type DST-II, which can be represented respectively by the following formula (1)…”

Section: Introductionmentioning

confidence: 99%

Computational structure of DST-II using convolvers

Prots'ko

Teslyuk

2015

The Experience of Designing and Application of CAD Systems in Microelectronics

View full text Add to dashboard Cite

The computational structure of discrete sine transform (DST) using convolvers is considered. Hashing arrays on the basis of simplified arguments of basis DST of type II for size N=2 n , 3 n and computational structure are analyzed, what eliminate the analysis of the identity the cyclic submatrices in the basis matrix of DST-II transforms.Кеу wordsdiscrete sine transform, hashing array, computational structure, convolver, transform size.

show abstract

Discrete Cosine and Sine Transforms

Cited by 88 publications

References 118 publications

Dual Transform Domain Echo Canceller for Discrete Multitone Systems

Dual Transform Domain Echo Canceller for Discrete Multitone Systems

Convolution Comparison Pattern: An Efficient Local Image Descriptor for Fingerprint Liveness Detection

Computational structure of DST-II using convolvers

Contact Info

Product

Resources

About