Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format

DOI10.1016/S0020-0190(01)00188-0MaRDI QIDQ1847372zbMATH OpenFDO

Authors Yanyan Li

Publication date 24 June 2003

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

DCT algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format.
• Fast algorithms for the discrete cosine transform
• A new two-dimensional fast cosine transform algorithm
• On the computation of two-dimensional DCT
• Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding

Cites work

• A new algorithm to compute the discrete cosine Transform
• An efficient algorithm for the 2-D discrete cosine transform
• Discrete Cosine Transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Fast algorithms for the discrete cosine transform

Cited in

(4)

• A fast directional discrete cosine transform based image compression
• An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format.
• Low complexity energy efficient very low bit-rate image compression scheme for wireless sensor network
• Shifted Fourier transform-based tensor algorithms for the 2-D DCT

This page was built for publication: Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format

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