skip to main content
10.1145/3594315.3594334acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccaiConference Proceedingsconference-collections
research-article

Video Bitstream Recompression Based on Sparse Representation of DCT Coefficients

Published:02 August 2023Publication History

ABSTRACT

Further compression of encoded video bitstream is necessary to save storage space and bandwidth. However, video bitstream is a compressed version of raw data with video encoders according to different standards, and hence the signal redundancy is already reduced compared with original video data. Recompression of video stream requires further exploring the correlation remained. Transform coding as a part of hybrid video coding framework adopted in the latest video coding standards such as discrete cosine transform (DCT) decorrelates predictive residual signal for efficient quantization and entropy coding. Nevertheless, considerable amount of statistical correlation still remains in the transform coefficients that further reducing the redundancy can lead to improved coding efficiency. In this work, we propose a video stream recompression scheme based on further sparse representation of DCT coefficients. Dictionary-based sparse representation method is used after DCT coefficients are obtained as a secondary transform module. Moreover, the proposed scheme leverages the property of DPCM and avoids sending bits of dictionary by forming redundant dictionaries from DCT coefficients of previously decoded frames. Experimental results demonstrate that the proposed recompression framework further reduces the bitrate of original H.264 bitstream by more than while maintains similar subjective quality.

References

  1. Michal Aharon, Michael Elad, and Alfred Bruckstein. 2006. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on signal processing 54, 11 (2006), 4311–4322.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Gisle Bjontegaard. 2001. Calculation of average PSNR differences between RD-curves. VCEG-M33 (2001).Google ScholarGoogle Scholar
  3. Jianle Chen, Ying Chen, Marta Karczewicz, Xiang Li, Hongbin Liu, Li Zhang, and Xin Zhao. 2015. Coding tools investigation for next generation video coding based on HEVC. In Applications of Digital Image Processing XXXVIII, Vol. 9599. SPIE, 437–445.Google ScholarGoogle Scholar
  4. Je-Won Kang, Moncef Gabbouj, and C-C Jay Kuo. 2013. Sparse/DCT (S/DCT) two-layered representation of prediction residuals for video coding. IEEE transactions on image processing 22, 7 (2013), 2711–2722.Google ScholarGoogle Scholar
  5. Julien Mairal, Francis Bach, Jean Ponce, and Guillermo Sapiro. 2010. Online learning for matrix factorization and sparse coding.Journal of Machine Learning Research 11, 1 (2010).Google ScholarGoogle Scholar
  6. Tung Nguyen, Benjamin Bross, Paul Keydel, Heiko Schwarz, Detlev Marpe, and Thomas Wiegand. 2019. Extended transform skip mode and fast multiple transform set selection in VVC. In 2019 Picture Coding Symposium (PCS). IEEE, 1–5.Google ScholarGoogle ScholarCross RefCross Ref
  7. Ron Rubinstein, Michael Zibulevsky, and Michael Elad. 2008. Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit. Technical Report. Computer Science Department, Technion.Google ScholarGoogle Scholar
  8. ITU Telecom 2003. Advanced video coding for generic audiovisual services. ITU-T Recommendation H. 264 (2003).Google ScholarGoogle Scholar
  9. ITU-T VCEG 2010. Joint call for proposals on video compression technology. VCEG-AM91 (2010).Google ScholarGoogle Scholar

Index Terms

  1. Video Bitstream Recompression Based on Sparse Representation of DCT Coefficients

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICCAI '23: Proceedings of the 2023 9th International Conference on Computing and Artificial Intelligence
      March 2023
      824 pages
      ISBN:9781450399029
      DOI:10.1145/3594315

      Copyright © 2023 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 August 2023

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)17
      • Downloads (Last 6 weeks)2

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format