An orthogonal 16-point approximate DCT for image and video compression

DOI10.1007/S11045-014-0291-6zbMATHDBLPOpenAlexWikidataMaRDI QIDQ2014160FDO

Authors Thiago L. T. da Silveira, Fábio M. Bayer, Renato J. Cintra, Sunera Kulasekera, Arjuna Madanayake, Alice J. Kozakevicius

Publication date 10 August 2017

Published in Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.05562

zbMATH Keywords

image compressionvideo codinglow-complexity transforms16-point DCT approximation

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: A low-complexity orthogonal multiplierless approximation for the 16-point discrete cosine transform (DCT) was introduced. The proposed method was designed to possess a very low computational cost. A fast algorithm based on matrix factorization was proposed requiring only 60~additions. The proposed architecture outperforms classical and state-of-the-art algorithms when assessed as a tool for image and video compression. Digital VLSI hardware implementations were also proposed being physically realized in FPGA technology and implemented in 45 nm up to synthesis and place-route levels. Additionally, the proposed method was embedded into a high efficiency video coding (HEVC) reference software for actual proof-of-concept. Obtained results show negligible video degradation when compared to Chen DCT algorithm in HEVC.

Recommendations

• Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
• Efficient, low complexity 8-point discrete Tchebichef transform approximation for signal processing applications
• An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm
• scientific article; zbMATH DE number 1941102
• Fast algorithms for the discrete cosine transform

Cites work

• scientific article; zbMATH DE number 5995471 (Why is no real title available?)
• scientific article; zbMATH DE number 47594 (Why is no real title available?)
• scientific article; zbMATH DE number 193953 (Why is no real title available?)
• scientific article; zbMATH DE number 1033191 (Why is no real title available?)
• A Fast Computational Algorithm for the Discrete Cosine Transform
• A new algorithm to compute the discrete cosine Transform
• A new square wave transform based on the DCT
• An integer approximation method for discrete sinusoidal transforms
• Binary Discrete Cosine and Hartley Transforms
• Efficient hybrid DCT-domain algorithm for video spatial downscaling
• Fast algorithms for signal processing.
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Fast algorithms for the discrete cosine transform
• Simple FFT and DCT algorithms with reduced number of operations.
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms

Cited in

(4)

• Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
• Embedded image and video coding algorithm based on adaptive filtering equation
• A generalized approach to linear transform approximations with applications to the discrete cosine transform
• Efficient, low complexity 8-point discrete Tchebichef transform approximation for signal processing applications

Describes a project that uses

Uses Software

• SIPI Image Database
• HEVC
• binDCT

This page was built for publication: An orthogonal 16-point approximate DCT for image and video compression

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