K. R. Rao and P. Yip. Discrete Cosine Transform - Algorithms, Advantages and Applications. Academic Press, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Fast DCT Domain Filtering - Using The Dct (Correct)
....specific transforms, and the CMP s involving them. The above transforms are defined in terms of matrices that left multiply an input vector. The transform matrices of order N of DCT Ie, DST Ie, DCT IIe, and DST IIe are denoted by C Ie , S Ie , C IIe , and C IIe , respectively, and are defined by [10]: C Ie ] mn = N km k n cos [S Ie ] mn = sin [C IIe ] mn = N km cos m(n [S IIe ] mn = N km sin m(n Gamma where k i = 1, for 1 i N Gamma 1, and k 0 = kN = 1= 2. A clarification about the indices is required: For the cosine matrices, the indices m and ....
K. R. Rao, and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press 1990.
Fast Multiplierless Approximations of the DCT with the Lifting.. - Liang, Tran (2001) (7 citations) (Correct)
....with the floating point DCT. The performance of the binDCT in JPEG, H.263 , and lossless compression is also demonstrated. Index Terms binDCT, DCT, integer DCT, lifting scheme, lossless compression, multiplierless, scaled DCT. I. INTRODUCTION T HE discrete cosine transform (DCT) 1] [2] is a robust approximation of the optimal Karhunen Love transform (KLT) for a first order Markov source with large correlation coefficient. It has satisfactory performance in terms of energy compaction capability, and many fast DCT algorithms with efficient hardware and software implementations ....
....implementations have been proposed. The DCT has found wide applications in image video processing and other fields. It has become the heart of many international standards such as JPEG, H. 26x, and the MPEG family [3] 5] There are mainly four types of the DCT, and they are labeled I IV [2]. Among them, the DCT II is the most useful. Many different fast algorithms for the DCT computation have been developed for image and video applications. Some of them take advantage of the relationships between the DCT and various existing fast transforms, including the FFT [1] 6] 8] the ....
[Article contains additional citation context not shown here]
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. New York: Academic, 1990.
Invertible Integer DCT Algorithms - Plonka, Tasche (Correct)
....data compression, factorization of cosine matrix, lifting matrix, rounding o , integer DCT, invertible integer DCT, worst case error, error estimate. 1 Introduction The discrete cosine transform of type II (DCT II) has found a wide range of applications in signal and image processing (see [17, 19]) especially in image compression. It has become the heart of international standards in image compression such as JPEG and MPEG (see [1] In some applications, the input data consists of integer vectors or integer matrices. But the output of DCT II does not consist of integers. For lossless ....
.... n (j) cos j(2k 1) 2j 1) 2k 1) where n (0) 2=2 and n (j) 1 for j 2 f1; n 1g. In our notation a subscript of a matrix denotes the corresponding order, while a superscript gives the type of the matrix. Observe that these matrices are orthogonal (see e.g. [17], pp. 13 14, 18, 19] The discrete cosine transforms of type II (DCT II) and of type IV (DCT IV) are linear mappings of R onto R , which are generated by C n , respectively. In [15] simple split radix algorithms are proposed for these transforms of radix 2 length n, which are based ....
K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, Boston, 1990.
IEEE SIGNAL PROCESSING LETTERS, VOL. 7, NO. 6, JUNE 2000 141.. - The Dct Trac (Correct)
....all employ the 8 8 discrete cosine transform (DCT) at its transformation stage. From an energy compaction standpoint, the DCT is a robust approximation to the optimal discrete time Karhunen Love transform (KLT) of a first order Gauss Markov process with a positive correlation coefficient when [2]. Since the KLT is signal dependent, and therefore, computationally complex and expensive, the DCT has proven to be a much better alternative in practice. It is signal independent and has linear phase, real coefficients, and fast algorithms. Exploiting the symmetry of the basis functions, the DCT ....
....phase, real coefficients, and fast algorithms. Exploiting the symmetry of the basis functions, the DCT transform matrix can be factored into a series of 1 butterflies and rotation angles as illustrated in Fig. 1. This factorization results in one of the fastest DCT implementation known up to date [2]: eight coefficients can be computed using 13 multiplications and 29 additions. However, the DCT is a floating point transform. It cannot map integers to integers losslessly. More importantly, floating point implementations in hardware are slow, require more space, and consume more power. Several ....
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. New York: Academic, 1990.
Split-Radix Algorithms for Discrete Trigonometric Transforms - Plonka, Tasche (Correct)
....discrete cosine transform, arithmetical complexity, numerical stability, factorization of cosine matrix, direct sum decomposition, sparse orthogonal matrix factors. 1 Introduction Discrete trigonometric transforms are widely used in processing and compression of signals and images (see [17]) Examples of such transforms are discrete cosine transforms (DCT) and discrete sine transforms (DST) of types I IV. These transforms are generated by orthogonal cosine and sine matrices, respectively. Especially, the DCT II and its inverse DCT III have been shown to be well applicable for ....
....an algebraic approach to fast algorithms of discrete trigonometric transforms we refer to [16] We may distinguish the following three methods to obtain fast DCT algorithms: 1. Fast DCT algorithms via FFT: It is natural to focus rst on the computation of DCT by using the FFT (see [15, 25, 7] [17], pp. 49 53, and [24] pp. 229 245) Such DCT algorithms are easy to implement using standard FFT routines and possess a good numerical stability (see [2, 23] However, the real matrix vector product C n x is computed in complex arithmetic. Therefore the arithmetical complexity of these ....
[Article contains additional citation context not shown here]
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, Boston, 1990.
Learning Matrix Space Image Representations - Rangarajan (Correct)
....between images in the training set. Results are shown on face images and natural scenes. 1 Introduction In recent years, there has been a lot of progress in the mathematical representation of natural scenes [7] Once it became clear that coding methods using the discrete cosine transform (DCT) [9], Gabor expansions [4] wavelets [3] etc. were quite successful in generating compact codes for images, there was an increased interest in directly learning such bases from natural images. Directly learning the basis vectors presents a more challenging computational problem than the usual coding ....
K. Rao and P. Yip. Discrete Cosine Transform|Algorithms, Advantages and Applications. Academic Press, London, UK, 1990.
Unknown - (Correct)
No context found.
K. R. Rao and P. Yip. Discrete Cosine Transform - Algorithms, Advantages and Applications. Academic Press, 1990.
Pure Java-based Streaming MPEG Player - Tolba, Briceño, McMillan (Correct)
No context found.
Rao, K.R. and P. Yip. Discrete Cosine Transform: algorithms, advantages, applications. Academic Press, Boston, 1990.
A Low-Power DCT Core Using Adaptive Bitwidth - And Arithmetic Activity (2000) (Correct)
No context found.
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. New York: Academic, 1990.
Parallel Huffman Decoding with Applications to JPEG Files - Klein, Wiseman (2003) (Correct)
No context found.
Rao, K. R. and Yip, P. (1990) Discrete Cosine Transform Algorithms, Advantages, Applications. Academic Press, London.
The Finite Ridgelet Transform for Image Representation - Do, Vetterli (2003) (1 citation) (Correct)
No context found.
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. New York: Academic, 1990.
Unknown - Background We Measured (Correct)
No context found.
K. P. Rao, Discrete Cosine Transform: Algorithms, Advantages, applications, Academic Press, 1990.
Time-scale Modification using the Phase Vocoder - Hammer (2001) (Correct)
No context found.
Rao, K. and Yip, P. Discrete Cosine Transform: Algorithms, Advantages, Applications. Boston: Academic Press, 1990.
Blockiness Detection in Compressed Data - Triantafyllidis, Tzovaras.. (Correct)
No context found.
K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, New York: Academic, 1990.
Faster MPEG-1 Layer III Audio Decoding - Scott Marovich Hewlett-Packard (2000) (Correct)
No context found.
Rao, K. R. and P. Yip. Discrete Cosine Transform; Algorithms, Advantages, Applications. (New York: Academic Press) 1990.
Spatially Adaptive High-Resolution Image.. - Park, Kang, Segall.. (2004) (Correct)
No context found.
K. R. Rao, Discrete Cosine Transform : Algorithms, Advantages, Applications. New York: Academic, 1990.
A Parallel Software-Only Video Effect Processing System - Mayer-Patel (1999) (Correct)
No context found.
K. R. Rao and P. Yip. Discrete Cosine Transform: Algorithms, Advantages, Applications. Academic Press, Inc., 1990.
Register Transfer Leven Simulation - Baclet, Pacalet, Petit (2004) (Correct)
No context found.
K. R. Rao and P. Yip. Discrete cosine transform: algorithms, advantages, applications. Academic Press Professional, Inc., 1990.
Integer Fast Fourier Transform (INTFFT) - Oraintara, Chen, Nguyen (2001) (Correct)
No context found.
K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, 1990.
Fast Algorithm For The 3-D Dct - Alshibami And Boussakta (1995) (Correct)
No context found.
K. R. Rao, and P. Yip, Discrete cosine transform: algorithms, advantages, and applications. Academic Press Inc., Sept. 1990.
A global method for invertible integer DCT and integer wavelet.. - Plonka (Correct)
No context found.
K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, Boston, 1990. 20
Theoretical Foundations of Transform Coding - Goyal (2001) (6 citations) (Correct)
No context found.
K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. San Diego, CA: Academic, 1990.
Reversible integer DCT algorithms - Plonka, Tasche (Correct)
No context found.
K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, Boston, 1990.
Lapped Transform via Time-Domain Pre- And Post-Filtering - Tran, Liang, Tu (2003) (Correct)
No context found.
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. New York: Academic, 1990.
Regularity-Constrained Pre- and Post-Filtering for Block DCT.. - Dai, Tran (2001) (Correct)
No context found.
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, New York, 1990.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC