Calculation scheme based on a weighted primitive: application to image processing transforms

DOI10.1155/2007/45321zbMath1168.94350OpenAlexW1996846141WikidataQ59214200 ScholiaQ59214200MaRDI QIDQ836454

Juan Manuel García Chamizo, Gregorio de Miguel Casado, María Teresa Signes Pont, Higinio Mora-Mora

Publication date: 1 September 2009

Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2007/45321

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (1)

Improvement of the discrete cosine transform calculation by means of a recursive method

Cites Work

• Multiprocessor FFTs
• Fast Fourier transforms: A tutorial review and a state of the art
• Compact recursive structures for discrete cosine transform
• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• Self-Sorting In-Place Fast Fourier Transforms
• A new systolic array for discrete Fourier transform
• A fast 4*4 DCT algorithm for the recursive 2-D DCT
• Fast algorithms for the discrete cosine transform
• Direct Recursive Structures for Computing Radix-<tex>$r$</tex>Two-Dimensional DCT/IDCT/DST/IDST
• An Adaptation of the Fast Fourier Transform for Parallel Processing

This page was built for publication: Calculation scheme based on a weighted primitive: application to image processing transforms