Fast Texture Coding Based on Spatial, Temporal and Inter-View Correlations for 3D Video Coding

3D-HEVC (The 3D Extension of High Efficiency Video Coding), the latest international standard for 3D video coding, supports multiview plus depth 3D video format to enrich multimedia applications. For the texture coding, 3D-HEVC utilizes not only the information of temporal and spatial domains but al...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2021, Vol.9, p.100081-100095
Main Authors: Lin, Jie-Ru, Chen, Mei-Juan, Ciou, Yi-Sheng, Yeh, Chia-Hung, Lin, Min-Hui, Kau, Lih-Jen, Chang, Chuan-Yu
Format: Article
Language:English
Subjects:
3D-HEVC
Algorithms
Coding
Complexity
Correlation
Correlation coefficient
Correlation coefficients
CU early termination
Domains
Encoding
fast PU decision
Motion simulation
Multimedia
Partitioning algorithms
Prediction algorithms
search range adjustment
Texture
texture coding
Three-dimensional displays
Video coding
Video compression
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:3D-HEVC (The 3D Extension of High Efficiency Video Coding), the latest international standard for 3D video coding, supports multiview plus depth 3D video format to enrich multimedia applications. For the texture coding, 3D-HEVC utilizes not only the information of temporal and spatial domains but also that of inter-view domain. However, the time consumption and complexity of 3D-HEVC also increase significantly. In this paper, fast texture coding algorithm for 3D-HEVC is proposed. We individually calculate the Pearson correlation coefficients by the rate-distortion costs (RD-costs) of coding tree units (CTUs) in the temporal, spatial and inter-view domains to analyze the correlations for independent view and dependent view. The proposed coding algorithm is based on the coding information of CTUs with higher correlations. The fast algorithm predicts and dynamically adjusts the depth range of the coding unit (CU). The prediction unit (PU) mode decision is proposed according to the complexity and partition direction of the best PU modes obtained from the highly correlated CTUs. The search range is adaptively adjusted for motion estimation. In addition, the RD-cost threshold is estimated to early terminate the CU split. Experimental results show that the proposed fast texture coding algorithm reduces the texture coding time significantly and outperforms numerous previous works.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2021.3093950