20 June 2016 Hole-filling map-based coding unit size decision for dependent views in three-dimensional high-efficiency video coding
Author Affiliations +
Abstract
The three-dimensional high-efficiency video coding (3-D-HEVC) is an emerging compression standard for multiview video plus depth data. In addition to the quad-tree coding structure inherited from HEVC, some tools are integrated, which significantly improve the coding efficiency but also result in remarkably high computational complexity. We propose a fast coding unit (CU) size decision algorithm for both depth and texture components in dependent views, where hole-filling maps created through view synthesis are utilized. First, after coding the base view, warp it onto each dependent view via depth image based rendering, during which hole-filling maps are generated. Then for depth in dependent views, CU splitting can be early terminated considering the disoccluded information from hole-filling maps; for texture in dependent views, combining the disoccluded information and the interview correlations, the CU partitioning process can also be accelerated. Experimental results show that the proposed algorithm can achieve on average 54.3% time reduction, with a negligible Bjøntegaard delta bitrate increase of 0.15% on synthesized views, and a 0.05% increase on all the coded plus synthesized views compared with the original encoding scheme in a 3-D-HEVC test model.
© 2016 SPIE and IS&T
Lilin Guo, Lilin Guo, Lunan Zhou, Lunan Zhou, Xiang Tian, Xiang Tian, Yaowu Chen, Yaowu Chen, } "Hole-filling map-based coding unit size decision for dependent views in three-dimensional high-efficiency video coding," Journal of Electronic Imaging 25(3), 033020 (20 June 2016). https://doi.org/10.1117/1.JEI.25.3.033020 . Submission:
JOURNAL ARTICLE
13 PAGES


SHARE
RELATED CONTENT


Back to Top