TY - JOUR
T1 - Fast Rate-Distortion Optimization for Depth Maps in 3-D Video Coding
AU - Huo, Junyan
AU - Zhou, Xile
AU - Yuan, Hui
AU - Wan, Shuai
AU - Yang, Fuzheng
N1 - Publisher Copyright:
© 1963-12012 IEEE.
PY - 2023/3/1
Y1 - 2023/3/1
N2 - To ensure the fidelity of virtual views, rate-distortion optimization (RDO) criterion for the 3D extension of the High Efficiency Video Coding (3D-HEVC) is well designed, in which the synthesized view distortion (SVD) is introduced to derive the rate-distortion (RD) cost. To obtain accurate SVDs, the rendering operation is employed which demands a fairly high computational complexity. To address this problem, a fast RDO method for depth maps is proposed, which checks the RD cost during its calculation process. Specifically, given a coding mode, the RD cost is composed of several cumulative items. If the accumulated RD cost is equal to or exceeds the minimum RD cost of previously coded modes, it will not be necessary to continue the RD cost calculation for the mode. To reduce the encoding complexity, existing methods usually aim at reducing the number of tested modes or block partitions. To the best of our knowledge, it is the first time that the latent redundant complexity in the RD cost calculation is investigated and removed. Experimental results demonstrate that, compared with the 3D-HEVC reference software, the proposed method can save 28.1% of depth coding time with a small coding gain (0.04% BD-rate saving). An additional test is designed to evaluate four typical fast coding methods with/without the proposed method. Extensive results verify that the proposed method can be seamlessly combined with the state-of-the-art methods.
AB - To ensure the fidelity of virtual views, rate-distortion optimization (RDO) criterion for the 3D extension of the High Efficiency Video Coding (3D-HEVC) is well designed, in which the synthesized view distortion (SVD) is introduced to derive the rate-distortion (RD) cost. To obtain accurate SVDs, the rendering operation is employed which demands a fairly high computational complexity. To address this problem, a fast RDO method for depth maps is proposed, which checks the RD cost during its calculation process. Specifically, given a coding mode, the RD cost is composed of several cumulative items. If the accumulated RD cost is equal to or exceeds the minimum RD cost of previously coded modes, it will not be necessary to continue the RD cost calculation for the mode. To reduce the encoding complexity, existing methods usually aim at reducing the number of tested modes or block partitions. To the best of our knowledge, it is the first time that the latent redundant complexity in the RD cost calculation is investigated and removed. Experimental results demonstrate that, compared with the 3D-HEVC reference software, the proposed method can save 28.1% of depth coding time with a small coding gain (0.04% BD-rate saving). An additional test is designed to evaluate four typical fast coding methods with/without the proposed method. Extensive results verify that the proposed method can be seamlessly combined with the state-of-the-art methods.
KW - 3D video coding
KW - 3D-HEVC
KW - depth maps
KW - rate-distortion cost
KW - rate-distortion optimization
UR - http://www.scopus.com/inward/record.url?scp=85135755646&partnerID=8YFLogxK
U2 - 10.1109/TBC.2022.3192992
DO - 10.1109/TBC.2022.3192992
M3 - 文章
AN - SCOPUS:85135755646
SN - 0018-9316
VL - 69
SP - 21
EP - 32
JO - IEEE Transactions on Broadcasting
JF - IEEE Transactions on Broadcasting
IS - 1
ER -