Language
We detect your regional language is French. Do you want to change site's language to French? You may choose other languages.International
English
中文
русск
français
español
العربية
User Center
My Training Class
Feedback
Journal of Real-Time Image Processing | Vol.12, Issue.1 | | Pages 107-122
Complexity scalability for real-time HEVC encoders
The high efficiency video coding (HEVC) standard achieves improved compression efficiency in comparison to previous standards at the cost of much higher computational complexity and consequently longer processing times, which may compromise real-time software-based video encoding, especially at high resolutions. This article addresses the problem of enabling complexity scalability in HEVC encoders by trading-off processing time for rate–distortion (R–D) performance in a controlled manner. The proposed method is based on dynamic constraining of HEVC coding treeblocks (CTBs) by limiting the prediction block (PB) shapes and the maximum tree depth used in each CTB, to decrease the number of R–D evaluations performed in the optimization process. The complexity-scalable encoder is capable of adjusting the processing time used in each group of pictures, according to a predefined target. The results show that processing times can be scaled down to 50 % with negligible R–D performance losses and down to 20 % at a maximum BD-PSNR decrease of 1.41 dB, which is acceptable in many applications and in power constrained devices. The simplicity of the scaling algorithm and the possibility of continuous adjustment of the scaling factor make it amenable to control real-time software-based HEVC video encoders.
Original Text (This is the original text for your reference.)
Complexity scalability for real-time HEVC encoders
The high efficiency video coding (HEVC) standard achieves improved compression efficiency in comparison to previous standards at the cost of much higher computational complexity and consequently longer processing times, which may compromise real-time software-based video encoding, especially at high resolutions. This article addresses the problem of enabling complexity scalability in HEVC encoders by trading-off processing time for rate–distortion (R–D) performance in a controlled manner. The proposed method is based on dynamic constraining of HEVC coding treeblocks (CTBs) by limiting the prediction block (PB) shapes and the maximum tree depth used in each CTB, to decrease the number of R–D evaluations performed in the optimization process. The complexity-scalable encoder is capable of adjusting the processing time used in each group of pictures, according to a predefined target. The results show that processing times can be scaled down to 50 % with negligible R–D performance losses and down to 20 % at a maximum BD-PSNR decrease of 1.41 dB, which is acceptable in many applications and in power constrained devices. The simplicity of the scaling algorithm and the possibility of continuous adjustment of the scaling factor make it amenable to control real-time software-based HEVC video encoders.
+More
complexityscalable encoder prediction block pb shapes compression efficiency complexity scalability in hevc encoders maximum tree depth target bdpsnr decrease control realtime softwarebased hevc video encoders ratedistortion rd performance optimization processing times manner resolutions method computational complexity scaling algorithm dynamic constraining of hevc coding treeblocks ctbs
Translate engine
Article's language
Action
Report
Share
Recommended articles
Report
Select your report category*
Reason*
Your level privilege is in sufficient. You can go to the “User Center” to view your level information and perform points tasks to upgrade your level.
New sign-in location：
Last sign-in location：
Last sign-in date：
About to jump to an external site.
Security unknown, whether to continue