Zero‐quantised discrete cosine transform coefficients prediction technique for intra‐frame video encoding. Issue 2 (1st March 2013)

• Record Type: Journal Article
• Authors: Jridi, Maher; Kumar Meher, Pramod; Alfalou, Ayman
• Is Part Of: IET image processing. Volume 7:Issue 2(2013)
• Page Start: 165
• Page End: 173
• Publication Date: 2013-03-01
• Subjects: computational complexity -- data compression -- discrete cosine transforms -- quantisation (signal) -- video coding; zero‐quantised discrete cosine transform coefficients prediction technique -- intraframe video encoding -- computational complexity -- zero‐quantised DCT coefficient -- intermediate signal -- Loeffler DCT algorithm -- residual pixel -- arithmetic complexity -- video quality -- pipelined VLSI architecture -- one‐dimensional DCT -- bit‐rate intravideo encoding; computational complexity -- data compression -- discrete cosine transforms -- quantisation (signal) -- video coding; zero‐quantised discrete cosine transform coefficients prediction technique -- intraframe video encoding -- computational complexity -- zero‐quantised DCT coefficient -- intermediate signal -- Loeffler DCT algorithm -- residual pixel -- arithmetic complexity -- video quality -- pipelined VLSI architecture -- one‐dimensional DCT -- bit‐rate intravideo encoding; Image processing -- Periodicals; 621.36705
• DOI: 10.1049/iet-ipr.2012.0145
• Languages: English
• ISSNs: 1751-9659

Abstract

Abstract : One promising solution to reduce the computational complexity of discrete cosine transform (DCT) is to identify the redundant computations and to get rid of them. In this study, the authors present a new method to predict zero‐quantised DCT coefficients for efficient implementation of intra‐frame video encoding by identifying such redundant computations. Traditional methods use the Gaussian statistical model of residual pixels to predict all‐zero or partial‐zero blocks. The proposed method is based on two key ideas. At first, the bounds of DCT coefficients are derived from the intermediate signals of the Loeffler DCT algorithm instead of calculating the sum of absolute difference (SAD) of residual pixels. The sufficiency conditions are then suitably chosen to predict the zero‐quantised coefficients to reduce the arithmetic complexity without degrading the video quality. Simulation results are found to validate the analytical model and show that the proposed prediction eliminates more redundant computations than the existing methods. Moreover, the authors have derived a pipelined VLSI architecture of the proposed prediction scheme which offers a saving of more than 63 and 91% of multiplications of the second stage of one‐dimensional DCT for high and low bit‐rate intra‐video encoding, respectively.