Fast CU size decision based on texture-depth relationship for depth map encoding in 3D-HEVC
by Liming Chen; Zhaoqing Pan; Xiaokai Yi; Yajuan Zhang
International Journal of Computational Science and Engineering (IJCSE), Vol. 20, No. 3, 2019

Abstract: Since many advanced encoding techniques are introduced into the 3D-HEVC, it achieves higher encoding efficiency compared to HEVC. However, the encoding complexity of 3D-HEVC increases significantly when these high complexity coding techniques are used. In this paper, a new fast CU size decision algorithm based on texture-depth is proposed to reduce the depth map encoding complexity. Since there is strong correlation between texture and depth map, including motion characteristic and background region, both kinds of maps tend to choose the same CU depth as their best depth level. By building one-to-one match for collocated largest coding unit (LCU), the information of texture encoding can be used to predict the depth level of depth map. Experimental results have shown that the proposed method can achieve 41.89% time saving on average, with the negligible drop of 0.04 dB on BDPSNR and a small increase of 2.29% on BDBR.

Online publication date: Tue, 03-Dec-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com