Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning
As a cutting-edge field of global research, 3D video technology faces the dual challenges of large data volumes and high processing complexity. Although the most recent video coding standard VVC, surpasses HEVC in coding efficiency, dedicated research on 3D video coding remains relatively scarce. Bu...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10824791/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841542569797877760 |
|---|---|
| author | Wenjun Song Jiaying Yang Qiuwen Zhang |
| author_facet | Wenjun Song Jiaying Yang Qiuwen Zhang |
| author_sort | Wenjun Song |
| collection | DOAJ |
| description | As a cutting-edge field of global research, 3D video technology faces the dual challenges of large data volumes and high processing complexity. Although the most recent video coding standard VVC, surpasses HEVC in coding efficiency, dedicated research on 3D video coding remains relatively scarce. Building on existing research, this study aims to develop a 3D video coding algorithm based on VVC that lowers the complexity of the encoding procedure. We focus specifically on the depth maps in 3D video content and introduce an extreme forest model from machine learning to optimize intra-frame coding. This paper proposes a novel CU partitioning strategy implemented through a two-stage extreme forest model. First, the initial model predicts the CU partitioning type, including no partition, QuadTree partitioning, Multi-type tree horizontal partitioning, and Multi-type tree vertical partitioning. For the latter two cases, a second model further refines the partitioning into binary or ternary trees. Through this two-stage prediction mechanism, we effectively bypass CU partitioning types with low probability, significantly reducing the coding complexity. The experimental results demonstrate that the proposed algorithm saves 47.46% in encoding time while maintaining coding quality, with only a 0.26% increase in Bjontegaard Delta Bitrate. This achievement provides an effective low-complexity solution for the 3D video coding field. |
| format | Article |
| id | doaj-art-9c6a6c5909fc4fcc8d65f364e534159b |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-9c6a6c5909fc4fcc8d65f364e534159b2025-01-14T00:02:22ZengIEEEIEEE Access2169-35362025-01-01135846585710.1109/ACCESS.2025.352570310824791Optimization of Depth Map Intra Coding Algorithms Based on Machine LearningWenjun Song0Jiaying Yang1https://orcid.org/0009-0000-5533-0179Qiuwen Zhang2https://orcid.org/0000-0002-8533-7088College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, ChinaCollege of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, ChinaCollege of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, ChinaAs a cutting-edge field of global research, 3D video technology faces the dual challenges of large data volumes and high processing complexity. Although the most recent video coding standard VVC, surpasses HEVC in coding efficiency, dedicated research on 3D video coding remains relatively scarce. Building on existing research, this study aims to develop a 3D video coding algorithm based on VVC that lowers the complexity of the encoding procedure. We focus specifically on the depth maps in 3D video content and introduce an extreme forest model from machine learning to optimize intra-frame coding. This paper proposes a novel CU partitioning strategy implemented through a two-stage extreme forest model. First, the initial model predicts the CU partitioning type, including no partition, QuadTree partitioning, Multi-type tree horizontal partitioning, and Multi-type tree vertical partitioning. For the latter two cases, a second model further refines the partitioning into binary or ternary trees. Through this two-stage prediction mechanism, we effectively bypass CU partitioning types with low probability, significantly reducing the coding complexity. The experimental results demonstrate that the proposed algorithm saves 47.46% in encoding time while maintaining coding quality, with only a 0.26% increase in Bjontegaard Delta Bitrate. This achievement provides an effective low-complexity solution for the 3D video coding field.https://ieeexplore.ieee.org/document/10824791/Depth mapintra-frame codingextreme forest |
| spellingShingle | Wenjun Song Jiaying Yang Qiuwen Zhang Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning IEEE Access Depth map intra-frame coding extreme forest |
| title | Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning |
| title_full | Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning |
| title_fullStr | Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning |
| title_full_unstemmed | Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning |
| title_short | Optimization of Depth Map Intra Coding Algorithms Based on Machine Learning |
| title_sort | optimization of depth map intra coding algorithms based on machine learning |
| topic | Depth map intra-frame coding extreme forest |
| url | https://ieeexplore.ieee.org/document/10824791/ |
| work_keys_str_mv | AT wenjunsong optimizationofdepthmapintracodingalgorithmsbasedonmachinelearning AT jiayingyang optimizationofdepthmapintracodingalgorithmsbasedonmachinelearning AT qiuwenzhang optimizationofdepthmapintracodingalgorithmsbasedonmachinelearning |