Pages that link to "Item:Q4031486"
From MaRDI portal
The following pages link to Fast algorithms for the discrete cosine transform (Q4031486):
Displaying 50 items.
- Simple FFT and DCT algorithms with reduced number of operations. (Q554691) (← links)
- An efficient algorithm for the 2-D discrete cosine transform (Q673366) (← links)
- The vector-radix fast cosine transform: Pruning and complexity analysis (Q673542) (← links)
- A novel quantum image compression method based on JPEG (Q725964) (← links)
- Calculation scheme based on a weighted primitive: application to image processing transforms (Q836454) (← links)
- Łukasiewicz transform and its application to compression and reconstruction of digital images (Q865924) (← links)
- A generalized approach to linear transform approximations with applications to the discrete cosine transform (Q938993) (← links)
- Comments on ``Canonical transformations of the discrete cosine transform'' (Q971208) (← links)
- An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm (Q980564) (← links)
- Fast extraction of wavelet-based features from JPEG images for joint retrieval with JPEG2000 images (Q991933) (← links)
- Shift, scaling and derivative properties for the discrete cosine transform (Q1031153) (← links)
- Bilinear algorithms for discrete cosine transforms of prime lengths (Q1031295) (← links)
- A fast algorithm for the \(n\)-D discrete cosine transform (Q1129829) (← links)
- Coshar transform (Q1174332) (← links)
- Fast radix-\(p\) discrete cosine transform (Q1197099) (← links)
- A parallel algorithm for \(4\times 4\) DCT (Q1291021) (← links)
- Fast algorithms for the discrete cosine transformation (Q1309087) (← links)
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327) (← links)
- On algebras related to the discrete cosine transform (Q1372961) (← links)
- Invertible integer DCT algorithms (Q1406574) (← links)
- Methods of synthesis of efficient orthogonal transforms of high and low correlation and their fast algorithms for coding and compressing digital images (Q1407092) (← links)
- Fast recursive algorithms for 2-D discrete cosine transform. (Q1575779) (← links)
- Using DCT for a fractal image compression optimization (Q1607548) (← links)
- Fast and numerically stable algorithms for discrete cosine transforms (Q1765902) (← links)
- Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format (Q1847372) (← links)
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms (Q1855852) (← links)
- Direct content access and extraction from JPEG compressed images (Q1860232) (← links)
- A unified algorithm for subband-based discrete cosine transform (Q1955339) (← links)
- Low-complexity 8-point DCT approximation based on angle similarity for image and video coding (Q2002406) (← links)
- An orthogonal 16-point approximate DCT for image and video compression (Q2014160) (← links)
- Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding (Q2267025) (← links)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- One- and two-dimensional constant geometry fast cosine transform algorithms and architectures (Q2723637) (← links)
- Architecture-oriented regular algorithms for discrete sine and cosine transforms (Q2732828) (← links)
- Compact recursive structures for discrete cosine transform (Q2732944) (← links)
- A generalized fast algorithm for \(n\)-D discrete cosine transform and its application to motion picture coding (Q2733052) (← links)
- On the computation of two-dimensional DCT (Q2734324) (← links)
- Constant geometry algorithm for discrete cosine transform (Q2734344) (← links)
- New adaptive cosine-Walsh transform and its application to nuclear data compression (Q2734406) (← links)
- Two new fast cosine transform (FCT) algorithms based on product system (Q2778242) (← links)
- Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors (Q2813064) (← links)
- (Q3033283) (← links)
- Fast Three-Dimensional Discrete Cosine Transform (Q3648604) (← links)
- Fast odd discrete cosine transform algorithms (Q3981761) (← links)
- Fast algorithms for the discrete cosine transform and for the discrete Fourier transform (Q3982444) (← links)
- A new algorithm to compute the DCT and its inverse (Q3985196) (← links)
- The Arithmetic Cosine Transform: Exact and Approximate Algorithms (Q4570298) (← links)
- COMPRESSION OF SEGMENTED 3D SEISMIC DATA (Q4672224) (← links)
- Efficient index mapping for computing discrete cosine transform (Q4710942) (← links)
- Integer DCTs and fast algorithms (Q5353568) (← links)
