A global method for invertible integer DCT and integer wavelet algorithms
The author presents a new global approach to derive integers transforms from given linear transforms. More specifically, for a given linear transform \( \hat{F}: \mathbb{R} ^{n}\longrightarrow \mathbb{R} ^{n}\) given by \(\hat{F}\left( x\right) =H_{n}X\), where \(H_{n}\in \mathbb{R} ^{n}\) is an invertible matrix, one can find an invertible integer transform \( F: \mathbb{Z} ^{n}\longrightarrow \mathbb{Z} ^{n}\) approximating \(\hat{F}\) by \(F\left( x\right) =\text{rd}\left( H_{n}X\right) \) if \(H_{n}\) satisfies this condition. Since \(H_{n}\) does not satisfy this condition, one can blow up the matrix \(H_{n}\) with a suitable expansion factor \(a_{n}>1\) such that \(a_{n}H_{n}\left( \left( -1/2,1/2\right] ^{n}\right) \) completely covers the unit cube \(\left[ -1/2,1/2\right) ^{n}\). An invertible mapping \(F: \mathbb{Z} ^{n}\longrightarrow \mathbb{Z} ^{n}\) can now simply be defined by \(F\left( x\right) =\text{rd}\left( a_{n}H_{n}X\right) \), and is very close to the exact (scaled) transform \( a_{n}H_{n}X\) since the error \(a_{n}H_{n}X-F\left( x\right) \) is at most 1/2 in each component. This idea is applied in order to derive a new integer discrete cosine transform (DCT)-II algorithm of radix-\(2\) length and new integer wavelet algorithms.
- Classification of nonexpansive symmetric extension transforms for multirate filter banks
- Factoring wavelet transforms into lifting steps
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 1329125 (Why is no real title available?)
- scientific article; zbMATH DE number 2020194 (Why is no real title available?)
- Integer DCTs and fast algorithms
- Integer fast Fourier transform
- Invertible integer DCT algorithms
- Lossless and lossy image compression using biorthogonal wavelet transforms with multiplierless operations
- Matrix factorizations for reversible integer mapping
- Reversible integer-to-integer wavelet transforms for image compression: Performance evaluation and analysis
- Ten Lectures on Wavelets
- The lifting scheme: A custom-design construction of biorthogonal wavelets
- Wavelet transforms that map integers to integers
- Wavelets and filter banks
- Invertible integer DCT algorithms
- A general approach for orthogonal 4-tap integer multiwavelet transforms
- The integer transforms analogous to discrete trigonometric transforms
- An integer approximation method for discrete sinusoidal transforms
- scientific article; zbMATH DE number 2020194 (Why is no real title available?)
- New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
This page was built for publication: A global method for invertible integer DCT and integer wavelet algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433015)
