Results 1  10
of
12,080
The discrete cosine transform
 SIAM Rev
, 1999
"... Abstract. Each discrete cosine transform (DCT) uses N real basis vectors whose components are cosines. In the DCT4, for example, the jth component of vk is cos(j+ 12)(k+ 1 ..."
Abstract

Cited by 119 (2 self)
 Add to MetaCart
Abstract. Each discrete cosine transform (DCT) uses N real basis vectors whose components are cosines. In the DCT4, for example, the jth component of vk is cos(j+ 12)(k+ 1
Discrete Cosine Transform
, 1998
"... Discrete frequency transforms provide a method to obtain a global view of data within a window. Discrete cosine transform is the frequency transform for practical image processing because of its excellent energy compaction property. Another reason for its popularity is the existence of a fast implem ..."
Abstract
 Add to MetaCart
Discrete frequency transforms provide a method to obtain a global view of data within a window. Discrete cosine transform is the frequency transform for practical image processing because of its excellent energy compaction property. Another reason for its popularity is the existence of a fast
Discrete Cosine Transforms on Quantum Computers
 PROCEEDINGS OF THE 2ND INTERNATIONAL SYMPOSIUM ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS
, 2001
"... A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show
Generalized Discrete Cosine Transform
 PacificAsia Conference on Circuits, Communications and System, Chegdu
, 2009
"... ar ..."
Discrete cosine transform of encrypted images
 in Proceedings of IEEE International Conference on Image Processing
, 2008
"... Processing a signal directly in the encrypted domain provides an elegant solution in application scenarios where valuable signals must be protected from a malicious processing device. In a previous paper we considered the implementation of the 1D Discrete Fourier Transform (DFT) in the encrypted d ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
blocks. Index Terms — Discrete Cosine transforms, error analysis, homomorphic encryption, image encryption, signal processing in the encrypted domain 1.
Progressive Pattern Matching Approach Using Discrete Cosine Transform
"... AbstractThe discrete cosine transform (DCT) is ..."
Image compression using the discrete cosine transform,"
 Mathematica Journal,
, 1994
"... Abstract The discrete cosine transform (DCT) is a technique for converting a signal into elementary frequency components. It is widely used in image compression. Here we develop some simple functions to compute the DCT and to compress images. These functions illustrate the power of Mathematica in t ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
Abstract The discrete cosine transform (DCT) is a technique for converting a signal into elementary frequency components. It is widely used in image compression. Here we develop some simple functions to compute the DCT and to compress images. These functions illustrate the power of Mathematica
Windowing the Discrete Cosine Transform in the Transform Domain *
"... Abstract: When processing a signal or an image using the Discrete Cosine Transform (DCT) or Discrete Sine Transform (DST), a typical approach is to extract a portion of the signal by windowing and then form the DCT or DST of the window contents. In this paper, an algorithm is developed to apply Hann ..."
Abstract
 Add to MetaCart
Abstract: When processing a signal or an image using the Discrete Cosine Transform (DCT) or Discrete Sine Transform (DST), a typical approach is to extract a portion of the signal by windowing and then form the DCT or DST of the window contents. In this paper, an algorithm is developed to apply
Orthogonal Approximation Of The Discrete Cosine Transform
 In Proc. Eur. Conf. on Circuit Theory and Design
, 1995
"... The efficient implementation of the discrete cosine tansform is discussed in this paper. The architecture, that is used, is a systolic processor array consisting of orthonormal rotations. The angles of these rotations are denoted by fi ij . With respect to a simple VLSI implementation an approximati ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The efficient implementation of the discrete cosine tansform is discussed in this paper. The architecture, that is used, is a systolic processor array consisting of orthonormal rotations. The angles of these rotations are denoted by fi ij . With respect to a simple VLSI implementation
An asynchronous matrixvector multiplier for discrete cosine transform
 in Proceedings of the 2000 International Symposium on Low Power Electronics and Design, ISLPED’00
, 2000
"... This paper proposes an efficient asynchronous hardwired matrixvector multiplier for the twodimensional discrete cosine transform and inverse discrete cosine transform (DCT/IDCT). The design achieves low power and high performance by taking advantage of the typically large fraction of zero and smal ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper proposes an efficient asynchronous hardwired matrixvector multiplier for the twodimensional discrete cosine transform and inverse discrete cosine transform (DCT/IDCT). The design achieves low power and high performance by taking advantage of the typically large fraction of zero
Results 1  10
of
12,080