z-logo
open-access-imgOpen Access
Early DIRECT mode decision based on all‐zero block and rate distortion cost for multiview video coding
Author(s) -
Pan Zhaoqing,
Zhang Yun,
Lei Jianjun,
Xu Long,
Sun Xingming
Publication year - 2016
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2014.1018
Subject(s) - encoder , bottleneck , computer science , macroblock , computational complexity theory , coding (social sciences) , encoding (memory) , algorithm , block (permutation group theory) , coding tree unit , algorithmic efficiency , decoding methods , real time computing , artificial intelligence , mathematics , embedded system , statistics , geometry , operating system
The exhaustive variable‐block‐size mode decision can efficiently remove the redundancies among the multiview videos, while it also leads to significant increase of computational complexity in the multiview video coding (MVC) encoder, and the high encoding complexity becomes a bottleneck for the MVC encoder to achieve real‐time multimedia applications. To address this bottleneck, many fast mode decision methods have been proposed. However, most of them are only suitable for optimising the encoding complexity of the odd views of the MVC encoder. In this study, based on the property of the all‐zero block and rate distortion (RD) cost of the DIRECT mode as well as the correlations between the current macroblock (MB) and its spatial–temporal nearby MBs, an early DIRECT mode decision method is proposed for reducing the encoding complexity of the MVC. Experimental results show that the proposed method achieves 48.25 and 55.64% on average encoding time saving for the even and odd views, respectively, whereas the RD performance degradation is quite acceptable. In summary, the proposed method efficiently reduces the encoding complexity for the MVC encoder.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here