Integer DCTs have important applications in lossless coding. In this paper, an integer DCT of radix-2 length n is understood to be a nonlinear, (left-)invertible mapping which acts on Z n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of typ
โฆ LIBER โฆ
Integer DCTs and fast algorithms
โ Scribed by Yonghong Zeng; Lizhi Cheng; Guoan Bi; Kot, A.C.
- Book ID
- 118691172
- Publisher
- IEEE
- Year
- 2001
- Tongue
- English
- Weight
- 201 KB
- Volume
- 49
- Category
- Article
- ISSN
- 1053-587X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Invertible integer DCT algorithms
โ
Gerlind Plonka; Manfred Tasche
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 152 KB
A global method for invertible integer D
โ
Gerlind Plonka
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 253 KB
Fast algorithms for complex integer tran
โ
Liu, K.; Reed, I.; Truong, T.
๐
Article
๐
1977
๐
IEEE
โ 337 KB
Fast algorithm for DCT domain image up-c
โ
Li Hong-dong; Xie Rong; Liu Ji-lin; Gu Wei-kang
๐
Article
๐
2000
๐
SP Zhejiang University Press
๐
English
โ 552 KB
New fast algorithm for multidimensional
โ
Cheng, L.Z.; Zeng, Y.H.
๐
Article
๐
2001
๐
The Institution of Electrical Engineers
๐
English
โ 511 KB
A Fast 8 ร 8 Pruned DCT Algorithm
โ
Mohamed El-Sharkawy; Waleed Eshmawy
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 199 KB
Pruned DCT Algorithm, Digital Signal Processing 6 other important aspect of DCT is its ability to quan- (1996), 145-154. tize the DCT coefficients using visually weighted quantization values. A new algorithm that computes the 8 1 8 pruned Discrete The two-dimensional DCT can be computed using Cosi