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
IEEE Transactions on Multimedia | Vol.21, Issue.4 | | Pages 835-850
A New Rate-Complexity-Distortion Model for Fast Motion Estimation Algorithm in HEVC
In the high efficiency video coding (HEVC) standard, motion estimation (ME) adopts a quadtree coding structure and a larger search range to improve the coding performance. These advanced coding tools, however, dramatically increase the computational complexity. To accelerate ME, fast methods have been proposed that reduce ME complexity at the expense of rate-distortion (R-D) performance. However, none of these methods can claim their tradeoff to be optimal. In this paper, we propose an optimal fast motion estimation (FME) algorithm based on an analytical model of rate-complexity-distortion (R-C-D). We extend the traditional R-D model by introducing the ME complexity into it, which enables us to explicitly express the R-D performance under different complexity budgets. Based on the R-C-D model, the proposed FME finds the R-C-D optimized search ranges for some representative prediction units (PUs), which are then extended or refined dynamically according to motion characteristics for neighboring PUs. The proposed FME enables an R-D performance close to that of full search. When compared with the default FME method in the reference software of HEVC, the proposed fast algorithm can reduce the complexity by over 80% while improving the R-D performance. Furthermore, our proposed FME algorithm is hardware friendly, as regular data flow enables high data reuse efficiency.
Original Text (This is the original text for your reference.)
A New Rate-Complexity-Distortion Model for Fast Motion Estimation Algorithm in HEVC
In the high efficiency video coding (HEVC) standard, motion estimation (ME) adopts a quadtree coding structure and a larger search range to improve the coding performance. These advanced coding tools, however, dramatically increase the computational complexity. To accelerate ME, fast methods have been proposed that reduce ME complexity at the expense of rate-distortion (R-D) performance. However, none of these methods can claim their tradeoff to be optimal. In this paper, we propose an optimal fast motion estimation (FME) algorithm based on an analytical model of rate-complexity-distortion (R-C-D). We extend the traditional R-D model by introducing the ME complexity into it, which enables us to explicitly express the R-D performance under different complexity budgets. Based on the R-C-D model, the proposed FME finds the R-C-D optimized search ranges for some representative prediction units (PUs), which are then extended or refined dynamically according to motion characteristics for neighboring PUs. The proposed FME enables an R-D performance close to that of full search. When compared with the default FME method in the reference software of HEVC, the proposed fast algorithm can reduce the complexity by over 80% while improving the R-D performance. Furthermore, our proposed FME algorithm is hardware friendly, as regular data flow enables high data reuse efficiency.
+More
analytical model of ratecomplexitydistortion high efficiency video coding hevc standard motion estimation optimal fast motion estimation fme algorithm rcd model regular data flow coding tools however ratedistortion rd performance methods rcd optimized search ranges motion characteristics quadtree coding structure search range computational complexity prediction units
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