Kamanagar, F. A. and K. R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform", IEEE Trans. On Computers, vol. C-31, no. 9, pp. 899-906, Sep 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Grounded Human-Robot Communication - Lopes, Wang (2002) (2 citations) (Correct)
....used in image compression can be used for dimensionality reduction. The work reported in this paper is based on the Discrete Cosine Transform (DCT) 4. 1 Discrete Cosine Transform The Discrete Cosine Transform (DCT) transforms a signal from a spatial representation into a frequency representation [3,10,16]. Generally, lower frequencies contribute more to an image than higher frequencies. So, if we transform an image into its frequency components using DCT and throw away a lot of data, here called DCT coefficients, about higher frequencies we could reduce the amount of data needed to describe the ....
....image quality. This is called loss image compression and used widely with quite good performance in JPEG and MPEG. And this is what could play a role when we need to reduce the dimension of input space of the learning algorithm. The following are the formulas for a 2D DCT for NM size images [10,16], where F(u,v) is the DCT coefficient at point (u,v) for u=0,1, N 1, v=0,1, M 1 and f(x,y) is the original pixel intensity at point (x, y) y v N x x M y NM 2 1 2 cos 2 1 2 0 1 0 where = otherwise for C , 1 0 , 2 1 A 2D DCT ....
[Article contains additional citation context not shown here]
Kamangar, F. A. and K. R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform", IEEE Transactions on Computers, Vol. 31(9), pp. 899906, 1982.
Fast Methods for Extraction and Sparsification of Substrate.. - Kanapka (2002) (2 citations) (Correct)
....0 in our case) conditions on each face, but not a mixture of both on the same face. The methods work by using the fact that in the case of uniform boundary condi tions there is a change of basis, which can be applied cheaply using the 2 D Discrete Cosine Transform (DCT) in the x and y directions [28, 29], in which the grid of resistors system becomes many decoupled tridiagonal systems, each of which is easy to solve. An implementation can be found in [30] We emphasize that the uniform boundary condition requirement is not satisfied for us, so the fast solvers cannot be used directly. In ....
F. A. Kamangar and K. R. Rao, "Fast algorithms for the 2-d discrete cosine transform," IEEE Transactions on Computers, vol. C-31, no. 9, pp. 899 906, September 1982.
An Efficient Algorithm for the 2-D Discrete Cosine Transform - Lee, Liu (1996) (Correct)
....role in many multi media applications. A complete survey of DCT algorithms is provided in [15] For the fast computation of the 2 D DCT, the conventional approach is the row column method, which requires evaluating 2N sets of N point 1 D DCT s for an (N Theta N) point 2 D DCT. Kamangar and Rao [9], who arranged the 2 D input data and output data into 1 D arrays in lexicographical order, wrote the needed 2 D transform coefficients as the Kronecker product of the two 1D DCT coefficient matrices, which yielded the sparse matrix factorization for that 2 D coefficient matrix. Haque [7] Chan ....
F. A. Kamangar and K. R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform", IEEE Trans. Comput., Vol. 31, No. 9, Sep. 1982, pp. 899--906.
Pure Java-based Streaming MPEG Player - Tolba, Briceño, McMillan (Correct)
No context found.
Kamanagar, F. A. and K. R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform", IEEE Trans. On Computers, vol. C-31, no. 9, pp. 899-906, Sep 1982.
Wavelet-based Indoor Object Recognition - Through Human Interaction (2003) (Correct)
No context found.
F. A Kamangar, and K. R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform", IEEE Transactions on Computers, Vol. 31(9), pp. 899906, 1982.
Implementation of an MPEG-2 Video Decoder - Bhadra (1999) (Correct)
No context found.
F.A. Kamangar and K.R. Rao, "Fast algorithms for the 2-D discrete cosine transform", IEEE Trans. Comput., vol. C-31, pp. 899-906, Sep 1982.
Pure Java-based Streaming MPEG Player - Tolba, Briceño, McMillan (Correct)
No context found.
Kamanagar, F. A. and K. R. Rao, "Fast Algorithms for the 2-D Discrete Cosine Transform", IEEE Trans. On Computers, vol. C-31, no. 9, pp. 899-906, Sep 1982.
A Forward-Mapping Realization of the Inverse Discrete.. - McMillan, Westover (1992) (5 citations) (Correct)
No context found.
Kamangar, F. A. and K. R. Rao, [1982] "Fast Algorithms for the 2-D Discrete Cosine Transform," IEEE Trans. on Computers, vol. C-31, no. 9, pp. 899-806, Sept 1982.
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