Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations

By V. Britanak, P. Yip, K. Rao. 2006

371 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A review on singular spectrum analysis for economic and financial time series (2010, background): “This distribution does not have finite second moments so the meaning of q is not the same as before.”
A generalized grid connectivity–based parameterization for subsurface flow model calibration (2011, background): “The DCT, of which there are eight formulations that vary on the basis of the assumption of symmetry at domain boundaries, is a type of Fourier transform that reconstructs a discrete n‐length signal as the sum of n cosine harmonics [Britanak et al., 2007].”
Seven Challenges in Image Quality Assessment: Past, Present, and Future Research (2013, background): “, [344]) and by exploiting various other algebraic and structural properties of the transform, for example, via recursion [345], lifting [346], matrix factorization [347], cyclic convolution [348], and many other techniques (see [349] for a review).”