z-logo
open-access-imgOpen Access
Shuffled Discrete Sine Transform in Inter‐Prediction Coding
Author(s) -
Choi Junwoo,
Kim NamUk,
Lim SungChang,
Kang Jungwon,
Kim Hui Yong,
Lee YungLyul
Publication year - 2017
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.17.0116.0867
Subject(s) - discrete cosine transform , lapped transform , residual , algorithm , transform coding , discrete sine transform , mathematics , frequency domain , coding (social sciences) , data compression , vector quantization , computer science , statistics , fourier transform , artificial intelligence , fractional fourier transform , mathematical analysis , fourier analysis , image (mathematics)
Video compression exploits statistical, spatial, and temporal redundancy, as well as transform and quantization. In particular, the transform in a frequency domain plays a major role in energy compaction of spatial domain data into frequency domain data. The high efficient video coding standard uses the type‐ II discrete cosine transform ( DCT ‐ II ) and type‐ VII discrete sine transform ( DST ‐ VII ) to improve the coding efficiency of residual data. However, the DST ‐ VII is applied only to the Intra 4 × 4 residual block because it yields relatively small gains in the larger block than in the 4 × 4 block. In this study, after rearranging the data of the residual block, we apply the DST ‐ VII to the inter‐residual block to achieve coding gain. The rearrangement of the residual block data is similar to the arrangement of the basis vector with a the lowest frequency component of the DST ‐ VII . Experimental results show that the proposed method reduces the luma‐chroma (Cb+Cr) BD rates by approximately 0.23% to 0.22%, 0.44% to 0.58%, and 0.46% to 0.65% for the random access, low delay B, and low delay P configurations, respectively.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here