Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.20349 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914170827440128 |
|---|---|
| author | Kherchouche, M. E. A. Galpin, F. Dumas, T. Schnitzler, F. Menard, D. Zhang, L. |
| author_facet | Kherchouche, M. E. A. Galpin, F. Dumas, T. Schnitzler, F. Menard, D. Zhang, L. |
| contents | In this paper, a complexity study is conducted for Versatile Video Codec (VVC) intra partitioning to accelerate the exhaustive search involved in Rate-Distortion Optimization (RDO) process. To address this problem, two main machine learning techniques are proposed and compared. Unlike existing methods, the proposed approaches are size independent and incorporate the Rate-Distortion (RD) costs of neighboring blocks as input features. The first method is a regression based technique that predicts normalized RD costs of a given Coding Unit (CU). As partitioning possesses the Markov property, the associated decision-making problem can be modeled as a Markov Decision Process (MDP) and solved by Reinforcement Learning (RL). The second approach is a RL agent learned from trajectories of CU decision across two depths with Deep Q-Network (DQN) algorithm. Then a pre-determined thresholds are applied for both methods to select a suitable split for the current CU. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_20349 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity Reduction Study Based on RD Costs Approximation for VVC Intra Partitioning Kherchouche, M. E. A. Galpin, F. Dumas, T. Schnitzler, F. Menard, D. Zhang, L. Machine Learning In this paper, a complexity study is conducted for Versatile Video Codec (VVC) intra partitioning to accelerate the exhaustive search involved in Rate-Distortion Optimization (RDO) process. To address this problem, two main machine learning techniques are proposed and compared. Unlike existing methods, the proposed approaches are size independent and incorporate the Rate-Distortion (RD) costs of neighboring blocks as input features. The first method is a regression based technique that predicts normalized RD costs of a given Coding Unit (CU). As partitioning possesses the Markov property, the associated decision-making problem can be modeled as a Markov Decision Process (MDP) and solved by Reinforcement Learning (RL). The second approach is a RL agent learned from trajectories of CU decision across two depths with Deep Q-Network (DQN) algorithm. Then a pre-determined thresholds are applied for both methods to select a suitable split for the current CU. |
| title | Complexity Reduction Study Based on RD Costs Approximation for VVC Intra Partitioning |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2511.20349 |