Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform

DOI10.1049/EL:19910053MaRDI QIDQ3348377zbMATH OpenOpenAlexFDO

Authors Na Ta, Yianni Attikiouzel, G. Crebbin

Publication date 1991

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://researchrepository.murdoch.edu.au/id/eprint/18839/

zbMATH Keywords

discrete cosine transformsdiscrete Fourier transformdiscrete Radon transform

Mathematics Subject Classification ID

Numerical methods for integral transforms (65R10) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast discrete Radon transform and 2-D discrete Fourier transform
• A two-dimensional fast cosine transform
• A refined fast 2-D discrete cosine transform algorithm
• scientific article; zbMATH DE number 4197369
• Fast radix-\(p\) discrete cosine transform
• A new two-dimensional fast cosine transform algorithm
• A Fast Discrete Approximation Algorithm for the Radon Transform
• scientific article; zbMATH DE number 613348
• Very fast computation of the radix-2 discrete Fourier transform
• Fast recursive algorithms for 2-D discrete cosine transform.

Cited in

(3)

• Fast discrete Radon transform and 2-D discrete Fourier transform
• A new two-dimensional fast cosine transform algorithm
• Fast and Scalable Computation of the Forward and Inverse Discrete Periodic Radon Transform

This page was built for publication: Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348377)