Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform

Abstract : The usage of linear transformations has great relevance for data decorrelation applications, like image and video compression. In that sense, the discrete Tchebichef transform (DTT) possesses useful coding and decorrelation properties. The DTT transform kernel does not depend on the input data and fast algorithms can be developed to real time applications. However, the DTT fast algorithm presented in literature possess high computational complexity. In this work, we introduce a new lowcomplexity approximation for the DTT. The fast algorithm of the proposed transform is multiplication-free and requires a reduced number of additions and bit-shifting operations. Image and video compression simulations in popular standards shows good performance of the proposed transform. Regarding hardware resource consumption for FPGA shows 43.1% reduction of configurable logic blocks and ASIC place and route realization shows 57.7% reduction in the area-time figure when compared with the 2-D version of the exact DTT.
Complete list of metadatas

https://hal.inria.fr/hal-01319513
Contributor : Olivier Sentieys <>
Submitted on : Friday, May 20, 2016 - 6:47:45 PM
Last modification on : Thursday, February 7, 2019 - 2:24:50 PM

Links full text

Identifiers

Citation

Paulo A. M. Oliveira, Renato J. Cintra, Fabio M. Bayer, Sunera Kulasekera, Arjuna Madanayake. Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform. IEEE Transactions on Circuits and Systems for Video Technology, Institute of Electrical and Electronics Engineers, 2016, ⟨10.1109/TCSVT.2016.2515378⟩. ⟨hal-01319513⟩

Share

Metrics

Record views

269