Invertible integer DCT algorithms (Q1406574)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1975008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Invertible integer DCT algorithms |
scientific article; zbMATH DE number 1975008 |
Statements
Invertible integer DCT algorithms (English)
0 references
4 September 2003
0 references
The paper presents two new algorithms for the integer DCT-II (discrete cosine transform) and integer DCT-IV of radix-2 length. Then it estimates the worst case error between the resulting vectors of the exact DCT and the corresponding integer DCT. Some numerical experiments for the integer DCT-II of length 8 and for the 2-dimensional integer DCT-II of size \(8\times 8\) are also presented.
0 references
discrete cosine transform
0 references
loseless coding
0 references
data compression
0 references
factorization of cosine matrix
0 references
lifting matrix
0 references
rounding-off
0 references
integer DCT
0 references
invertible integer DCT
0 references
worst case error
0 references
error estimate
0 references
numerical experiments
0 references
0.8539963364601135
0 references
0.8207970857620239
0 references
0.8198500871658325
0 references
