Abstract
3D-HEVC video coding standard adopts many sophisticated algorithms to improve the coding performance, which results in heavy calculation complexity. To reduce the computation burden, a complexity reduction scheme for depth map based on spatial correlation and the rate–distortion (RD) cost is proposed. Firstly, A maximum depth layer decision (MDLD) algorithm is proposed to predict the maximum depth layer (MDL) of each coding tree unit (CTU) accurately. Using the frequency distribution histogram theory in the statistics, the frequency distribution characteristics (FDC) of the RDcost J0 of the CTU level in depth layer 0 is investigated under different MDL. The initial threshold for different MDL is designed based on the FDC of the J0 under allowable false rate (FR). An exponential relationship between the threshold and QP is discovered. Secondly, A fast depth intra mode decision (FDIMD) algorithm is proposed to skip unnecessary prediction modes. Considering the spatial correlation, the FDC of the RDcost JORM of the optimal rough mode (ORM) in rough mode decision (RMD) is analyzed under different optimal prediction mode. Based on the FDC of the JORM, the mode-skipping threshold THst is designed to skip angular modes and depth modeling modes (DMMs). An exponential model is built to represent the relationship between the THst and QP. Finally, a fast wedgelet pattern decision method based on K-Means is developed to reduce the complexity of DMM1. Experimental results show that the proposed algorithm achieves an average reduction of 58.9% on intra coding time, with negligible degradation of coding performance. The proposed algorithm performs better in terms of complexity and performance than other approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.