Calculation scheme based on a weighted primitive: application to image processing transforms
From MaRDI portal
Recommendations
- Improvement of the discrete cosine transform calculation by means of a recursive method
- Application of the fast Fourier transform to calculating pruned convolution
- Compression and decompression based on discrete weighted transform
- The weighted redundancy transform
- scientific article; zbMATH DE number 123802
Cites work
- A fast 4*4 DCT algorithm for the recursive 2-D DCT
- A new systolic array for discrete Fourier transform
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Compact recursive structures for discrete cosine transform
- Direct Recursive Structures for Computing Radix-<tex>$r$</tex>Two-Dimensional DCT/IDCT/DST/IDST
- Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
- Fast Fourier transforms: A tutorial review and a state of the art
- Fast algorithms for the discrete cosine transform
- Multiprocessor FFTs
- Self-Sorting In-Place Fast Fourier Transforms
Cited in
(2)
This page was built for publication: Calculation scheme based on a weighted primitive: application to image processing transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836454)