Papers
Topics
Authors
Recent
Search
2000 character limit reached

Encoder Complexity Control in SVT-AV1 by Speed-Adaptive Preset Switching

Published 11 Jul 2023 in eess.IV | (2307.05208v1)

Abstract: Current developments in video encoding technology lead to continuously improving compression performance but at the expense of increasingly higher computational demands. Regarding the online video traffic increases during the last years and the concomitant need for video encoding, encoder complexity control mechanisms are required to restrict the processing time to a sufficient extent in order to find a reasonable trade-off between performance and complexity. We present a complexity control mechanism in SVT-AV1 by using speed-adaptive preset switching to comply with the remaining time budget. This method enables encoding with a user-defined time constraint within the complete preset range with an average precision of 8.9 \% without introducing any additional latencies.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (20)
  1. Gisle Bjontegaard. Calculation of average PSNR differences between RD-curves. ITU SG16 Doc. VCEG-M33, 2001.
  2. Mathias Brandt. Video-Streaming ist für 60% des Traffics verantwortlich. https://de.statista.com/infografik/21188/zusammensetzung-des-weltweiten-downstream-internet-traffics/. Accessed: 2023-02-09.
  3. An overview of core coding tools in the AV1 video codec. In Proc. Picture Coding Symposium (PCS), pages 41–45, 2018.
  4. Coding tree depth estimation for complexity reduction of hevc. In Proc. Data Compression Conference, pages 43–52, 2013.
  5. Complexity control of high efficiency video encoders for power-constrained devices. IEEE Transactions on Consumer Electronics, 57(4):1866–1874, 2011.
  6. Adaptive coding tree for complexity control of high efficiency video encoders. In Proc. Picture Coding Symposium (PCS), pages 425–428, 2012.
  7. Performance comparison of AV1, JEM, VP9, and HEVC encoders. In Applications of Digital Image Processing XL, volume 10396, pages 68–79. SPIE, 2018.
  8. Intra encoding complexity control with a time-cost model for versatile video coding. In Proc. IEEE International Symposium on Circuits and Systems (ISCAS), pages 2027–2031, 2022.
  9. Precise encoding complexity control for versatile video coding. IEEE Transactions on Broadcasting, 2022. to be published.
  10. The SVT-AV1 encoder: overview, features and speed-quality tradeoffs. Applications of Digital Image Processing XLIII, 11510:469–490, 2020.
  11. Accelerate ctu partition to real time for hevc encoding with complexity control. IEEE Transactions on Image Processing, 29:7482–7496, 2020.
  12. The latest open-source video codec vp9-an overview and preliminary results. In Proc. Picture Coding Symposium (PCS), pages 390–393, 2013.
  13. A survey paper on cloud computing. In Proc. second international conference on advanced computing & communication technologies, pages 394–398, 2012.
  14. Multi-objective optimized complexity control for the AV1 video encoder. In Proc. Picture Coding Symposium (PCS), pages 259–263, 2022.
  15. Intra complexity control algorithm for VVC. Electronics, 11(16):2572, 2022.
  16. The SJTU 4K video sequence dataset. In Proc. Fifth International Workshop on Quality of Multimedia Experience (QoMEX), pages 34–35, 2013.
  17. Convolutional neural network based low complexity hevc intra encoder. Multimedia Tools and Applications, 80:2441–2460, 2021.
  18. Svm based fast cu partitioning algorithm for vvc intra coding. In Proc. IEEE International Symposium on Circuits and Systems (ISCAS), pages 1–5, 2021.
  19. Reducing complexity of hevc: A deep learning approach. IEEE Transactions on Image Processing, 27(10):5044–5059, 2018.
  20. AOM common test conditions v2. 0. Alliance for Open Media, Codec Working Group Output Document, 2021.
Citations (2)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.