Fast multiplierless approximations of the DCT with the lifting scheme

IEEE Transactions on Signal Processing

Volumn 49, Issue 12, 2001, Pages 3032-3044

  Liang, Jie ^a,b   Tran, Trac D ^a,b  

^a IEEE   (United States)

^b Johns Hopkins University   (United States)

Author keywords

BinDCT; DCT; Integer DCT; Lifting scheme; Lossless compression; Multiplierless; Scaled DCT

Indexed keywords

DISCRETE COSINE TRANSFORMS (DCT);

ALGORITHMS; APPROXIMATION THEORY; COSINE TRANSFORMS; MATRIX ALGEBRA; OPTIMIZATION;

IMAGE COMPRESSION;

EID: 0035673741     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.969511     Document Type: Article

References (52)

1. Discrete cosine transform
2. A fast cosine transform in one and two dimensions
3. Simple FFT and DCT algorithms with reduced number of operations
4. A fast DCT-SQ scheme for images
5. On a real-time Walsh-Hadamard cosine transform image processor
6. Discrete transform via the Walsh-Hadamard transform
7. Fast computation of the discrete cosine transform and the discrete Hartley transform
8. A fast computational algorithm for the discrete cosine transform
9. Adaptive coding of monochrome and color images
10. Fast algorithm for the discrete W transform and for the discrete Fourier transform
11. Practical fast 1-D DCT algorithms with 11 multiplications
12. A new algorithm to compute the discrete cosine transform
13. A fast recursive algorithm for computing the discrete cosine transform
14. A single chip solution for an 8 by 8 two-dimensional DCT
15. Polynomial transform computation of the 2-D DCT
16. A new two-dimentional fast cosine transform algorithm
17. Fast algorithms for the discrete cosine transform
18. n DCT algorithms suitable for VLSI implementation
19. On the multiplicative complexity of discrete cosine transform
20. Fast 2-D discrete cosine transform
21. A fast scaled DCT algorithm
22. On the fixed-point-error analysis of several fast DCT algorithms
23. Comparative performance of fast cosine transform with fixed-point roundoff error analysis
24. A fast algorithm suitable for DCT implementation with integer multiplication
25. Development of integer cosine transforms by the principle of dyadic symmetry
26. New networks for perfect inversion and perfect reconstruction
27. The lifting scheme: A custom-design construction of biorthogonal wavelets
28. Factoring wavelet transforms into lifting step
29. Lattice structures for optimal design and robust implementation of two-band perfect reconstruction QMF banks
30. Reversible discrete cosine transform
31. Design of lossless LOT and its performance evaluation
32. Fast multiplierless approximation of the DCT
33. Fast multiplierless approximation of the DCT with the lifting scheme
34. A fast multiplierless block transform for image and video compression
35. The binDCT: Fast multiplierless approximation of the DCT
36. Integer discrete cosine transform (IntDCT)
37. Fast algorithm for the DFT and other sinusoidal transforms
38. Performance evaluation of subband coding and optimization of its filter coefficients
39. On unitary transform approximations
40. Dynamic range analysis for the implementation of fast transform
41. A new fast and efficient image codec based on set partitioning in hierarchical trees
42. A progressive transmission image coder using linear phase filter banks as block transforms
43. The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS
44. Context-based, adaptive, lossless image coding