Shifted fourier transform-based tensor algorithms for the 2-D DCT

IEEE Transactions on Signal Processing

Volumn 49, Issue 9, 2001, Pages 2113-2126

  Grigoryan, A M ^a   Agaian, S S ^a  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Fast 1 D and 2 D discrete cosine transforms; Fourier and shifted Fourier transforms; Multiplicative complexity; Splitting of the transform

Indexed keywords

ALGORITHMS; DISCRETE FOURIER TRANSFORMS; IMAGE COMPRESSION; TENSORS;

DISCRETE COSINE TRANSFORM (DCT);

IMAGE CODING;

EID: 0035447446     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.942639     Document Type: Article

References (49)

1. A visual model weighted cosine transform for image compression and quality assessment
2. Transform-coding of images with reduced complexity
3. Lossless image compression using the discrete cosine transform
4. Bit reduction of DCT basis for transform coding
5. DCT transform coding of stereo images for multimedia applications
6. Comparision of the cosine and Fourier transforms of Markov-1 signals
7. Optimal approximation of uniformly rotated images: Relationship between Karhunen-Loeve expansion and discrete cosine transform
8. Discrete cosine transform
9. A fast computational algorithm for discrete cosine transform
10. A fast recursive algorithm for computing discrete cosine transform
11. A fast recursive algorithm for computing discrete cosine transform
12. Practical fast 1-D DCT algorithms with 11 multiplications
13. Fast algorithm for the discrete cosine transform
14. New fast recursive algorithms for the computation of the discrete cosine and sine transforms
15. Recursive algorithms for discrete cosine transform
16. Fast 2-D discrete cosine transform
17. Polynomial transform computation of the two-dimensional DCT
18. A new algorithm to compute the discrete cosine transform
19. A 2-D fast cosine transform algorithm based on Hou's approach
20. DCT algorithms for composite sequence lengths
21. Prime factor decomposition of the discrete cosine transform
22. Input and output mapping for a prime-factor-decomposed computation of discrete cosine transform
23. One- and two-dimensional algorithms for length 15 and 30 discrete cosine transform
24. A method for fast approximate computation discrete cosine transforms
25. On arithmetic cosine transform algorithm
26. Scaled DCT's on input series that are composite
27. Local cosine bases in two dimensions
28. A fast cosine transform in one and two dimensions
29. A new 2-D discrete cosine transform algorithm
30. A two-dimensional fast cosine transform
31. An efficient algorithm for the 2-D discrete cosine transform
32. A cost-effective architecture for 8 × 8 2-dimensional DCT/IDCT using direct method
33. A fast 4 × 4 DCT algorithm for the recursive DCT
34. Comments on 'Fast algorithm and implementation of 2-D discrete cosine transform'
35. Fast algorithm for the discrete cosine transform
36. Two-dimensional Fourier transform algorithm
37. Tensor representation of the two-dimensional discrete Fourier transform and new orthogonal functions
38. An optimal algorithm for computing the two-dimensional discrete Fourier transform
39. New algorithms for calculating the discrete Fourier transforms
40. 2-D and 1-D multipaired transforms: Frequency-time type wavelets
41. Split manageable efficient algorithm for Fourier and Hadamard transforms
42. Efficient computation of the DFT with only a subset of input or output points
43. Pruning the fast discrete cosine transform