Results 201 to 210 of about 8,544 (259)
2D-Cosine power sine coupled map with fractal-Fibonacci fusion for hyperchaotic image encryption. [PDF]
Sci RepKumar M, Ch D.
europepmc +1 more source
Visual Self-Refinement for Autoregressive Models. [PDF]
Find ACL EMNLPWang J +7 more
europepmc +1 more source
An improved blind watermarking scheme for color image copyright protection using Hahn moments. [PDF]
Sci RepElbatawy NI +3 more
europepmc +1 more source
Fast Fourier transform is a training-free, ultrafast, highly efficient, and fully interpretable approach for epigenomic data compression. [PDF]
Sci RepWard M, Dao B, Datta A, Li Z.
europepmc +1 more source
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.
Ahmed, N., Natarajan, T., Rao, K. R.
openaire +4 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.
Ahmed, N., Natarajan, T., Rao, K. R.
openaire +4 more sources
Discrete cosine transform filtering
Signal Processing, 1990Circular convolution-multiplication relationships for the discrete cosine transform (DCT) that are similar to those for the discrete Fourier transform (DFT) are developed. The relations are valid if the filter frequency response is real and even. Two fairly simple relations are developed.
B. Chitprasert, K.R. Rao
openaire +1 more source
Running discrete cosine transform
Journal of Biomedical Engineering, 1992The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was
openaire +2 more sources
Adaptive discrete cosine transform
Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers, 2002The theory and performance of the adaptive discrete cosine transform filter is examined. The discrete cosine transform filter is a realization of an FIR filter as the cascade of an all-zero FIR filter with a bank of IIR digital resonators. Each bank has a single magnitude and a single phase. The result of such a realization is that each coefficient can
S.J. Bukowinski +3 more
openaire +1 more source
The Discrete Cosine Transform (DCT)
2009The Fourier transform and the DFT are designed for processing complex-valued signals, and they always produce a complex-valued spectrum even in the case where the original signal was strictly realvalued. The reason is that neither the real nor the imaginary part of the Fourier spectrum alone is sufficient to represent (i.e., reconstruct) the signal ...
Wilhelm Burger, Mark J. Burge
openaire +1 more source