Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees
The new generation of 3D video is an international frontier research hotspot. However, the large amount of data and high complexity are core problems to be solved urgently in 3D video coding. The latest generation of video coding standard versatile video coding (VVC) adopts the quad-tree with nested...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-09-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/12/18/3914 |
| _version_ | 1797580478363992064 |
|---|---|
| author | Fengqin Wang Zhiying Wang Qiuwen Zhang |
| author_facet | Fengqin Wang Zhiying Wang Qiuwen Zhang |
| author_sort | Fengqin Wang |
| collection | DOAJ |
| description | The new generation of 3D video is an international frontier research hotspot. However, the large amount of data and high complexity are core problems to be solved urgently in 3D video coding. The latest generation of video coding standard versatile video coding (VVC) adopts the quad-tree with nested multi-type tree (QTMT) partition structure, and the coding efficiency is much higher than other coding standards. However, the current research work undertaken for VVC is less for 3D video. In light of this context, we propose a fast coding unit (CU) decision algorithm based on the gray level co-occurrence matrix (GLCM) and Extra trees for the characteristics of the depth map in 3D video. In the first stage, we introduce an edge detection algorithm using GLCM to classify the CU in the depth map into smooth and complex edge blocks based on the extracted features. Subsequently, the extracted features from the CUs, classified as complex edge blocks in the first stage, are fed into the constructed Extra trees model to make a fast decision on the partition type of that CU and avoid calculating unnecessary rate-distortion cost. Experimental results show that the overall algorithm can effectively reduce the coding time by 36.27–51.98%, while the Bjøntegaard delta bit rate (BDBR) is only increased by 0.24% on average which is negligible, all reflecting the superior performance of our method. Moreover, our algorithm can effectively ensure video quality while saving much encoding time compared with other algorithms. |
| first_indexed | 2024-03-10T22:50:35Z |
| format | Article |
| id | doaj.art-bd30bdb6d46e483aac1d8b266e3e2142 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-10T22:50:35Z |
| publishDate | 2023-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-bd30bdb6d46e483aac1d8b266e3e21422023-11-19T10:23:08ZengMDPI AGElectronics2079-92922023-09-011218391410.3390/electronics12183914Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra TreesFengqin Wang0Zhiying Wang1Qiuwen Zhang2College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, ChinaCollege of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, ChinaCollege of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, ChinaThe new generation of 3D video is an international frontier research hotspot. However, the large amount of data and high complexity are core problems to be solved urgently in 3D video coding. The latest generation of video coding standard versatile video coding (VVC) adopts the quad-tree with nested multi-type tree (QTMT) partition structure, and the coding efficiency is much higher than other coding standards. However, the current research work undertaken for VVC is less for 3D video. In light of this context, we propose a fast coding unit (CU) decision algorithm based on the gray level co-occurrence matrix (GLCM) and Extra trees for the characteristics of the depth map in 3D video. In the first stage, we introduce an edge detection algorithm using GLCM to classify the CU in the depth map into smooth and complex edge blocks based on the extracted features. Subsequently, the extracted features from the CUs, classified as complex edge blocks in the first stage, are fed into the constructed Extra trees model to make a fast decision on the partition type of that CU and avoid calculating unnecessary rate-distortion cost. Experimental results show that the overall algorithm can effectively reduce the coding time by 36.27–51.98%, while the Bjøntegaard delta bit rate (BDBR) is only increased by 0.24% on average which is negligible, all reflecting the superior performance of our method. Moreover, our algorithm can effectively ensure video quality while saving much encoding time compared with other algorithms.https://www.mdpi.com/2079-9292/12/18/3914VVC 3D videodepth mapGLCMExtra trees |
| spellingShingle | Fengqin Wang Zhiying Wang Qiuwen Zhang Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees Electronics VVC 3D video depth map GLCM Extra trees |
| title | Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees |
| title_full | Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees |
| title_fullStr | Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees |
| title_full_unstemmed | Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees |
| title_short | Efficient CU Decision Algorithm for VVC 3D Video Depth Map Using GLCM and Extra Trees |
| title_sort | efficient cu decision algorithm for vvc 3d video depth map using glcm and extra trees |
| topic | VVC 3D video depth map GLCM Extra trees |
| url | https://www.mdpi.com/2079-9292/12/18/3914 |
| work_keys_str_mv | AT fengqinwang efficientcudecisionalgorithmforvvc3dvideodepthmapusingglcmandextratrees AT zhiyingwang efficientcudecisionalgorithmforvvc3dvideodepthmapusingglcmandextratrees AT qiuwenzhang efficientcudecisionalgorithmforvvc3dvideodepthmapusingglcmandextratrees |