hyuan c955ba8f1c | 2 years ago | |
---|---|---|
README.md | 2 years ago | |
app_encoder.c | 2 years ago | |
com_def.h | 2 years ago | |
com_util.c | 2 years ago | |
enc.c | 2 years ago |
In response to the serious increase in complexity brought by the growing trend of video coding tools, this paper proposes a dynamic computational resource allocation algorithm for conference videos to improve the inter frame coding speed, which is mainly aimed at the new coding unit (CU) partitioning modes in AVS3. In the proposed algorithm, the numbers of extended quad tree (EQT) or binary tree (BT) partitions at largest coding unit (LCU) level are firstly predicted based on the evaluation of texture variation. Then the allowed partition for the current area will be dynamically allocated according to the prediction. Finally, the relatively large size CUs, which are determined by the proposed threshold, will be restricted from using EQT to further reduce complexity. Experimental results show that the proposed algorithm can effectively reduce the computational complexity while ensuring rate-distortion (R-D) performance, and can even obtain bit rate savings for certain thresholds.
Due to the risks of patents and copyrights, the project only publishes the parts involved in the algorithm.
For actual operation, please add the following code to the corresponding files.
Dear OpenI User
Thank you for your continuous support to the Openl Qizhi Community AI Collaboration Platform. In order to protect your usage rights and ensure network security, we updated the Openl Qizhi Community AI Collaboration Platform Usage Agreement in January 2024. The updated agreement specifies that users are prohibited from using intranet penetration tools. After you click "Agree and continue", you can continue to use our services. Thank you for your cooperation and understanding.
For more agreement content, please refer to the《Openl Qizhi Community AI Collaboration Platform Usage Agreement》