Results 211 to 220 of about 64,508 (261)
The Discrete Cosine Transform [PDF]
SIAM Review, 1999 In this paper the author derives the Discrete Cosine Transform (DCT) bases as eigenvectors of a symmetric second-difference matrix with certain boundary conditions. The type of boundary condition (Dirichlet or Neumann, centered at a meshpoint or a midpoint) determines the applications that are appropriate for each transform.
Gilbert Strang
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Computers, 1974
A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Nasir Ahmed 0001 +2 more
exaly +3 more sources
A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Nasir Ahmed 0001 +2 more
exaly +3 more sources
Numerical Algorithms, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas J. Higham, Matthew I. Smith
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas J. Higham, Matthew I. Smith
openaire +3 more sources
Journal of Elliptic and Parabolic Equations, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdelmjid Benmerrous +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdelmjid Benmerrous +4 more
openaire +2 more sources
IEEE Transactions on Computers, 1980
A new discrete cosine transform is developed in such a way that its closeness to the Karhunen–Loeve transform can be established straightforwardly. The transform is characterized by a symmetric matrix and will be referred to as the symmetric cosine transform (SCT).
openaire +1 more source
A new discrete cosine transform is developed in such a way that its closeness to the Karhunen–Loeve transform can be established straightforwardly. The transform is characterized by a symmetric matrix and will be referred to as the symmetric cosine transform (SCT).
openaire +1 more source
Journal of Visual Communication and Image Representation, 1993
In this work, we propose to improve the performance of the DCT by weighting the DCT matrices with some simple structured orthonormal matrices. The new transform thus generated is called the weighted cosine transform (WCT). This method of modification ensures that fast computational algorithms exist for the WCT.
Kwok-Tung Lo, Wai-Kuen Cham
openaire +1 more source
In this work, we propose to improve the performance of the DCT by weighting the DCT matrices with some simple structured orthonormal matrices. The new transform thus generated is called the weighted cosine transform (WCT). This method of modification ensures that fast computational algorithms exist for the WCT.
Kwok-Tung Lo, Wai-Kuen Cham
openaire +1 more source
Mathematical Notes, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source