Efficient Prediction Structures for H.264 Multi View Coding Using Temporal Scalability

Abstract

Prediction structures with disposable view components based hierarchical coding have been proven to be efficient for H.264 multi view coding. Though these prediction structures along with the QP cascading schemes provide superior compression efficiency when compared to the traditional IBBP coding scheme, the scalability requirements of the bit stream could not be met to the fullest. On the other hand, a fully scalable bit stream, obtained by temporal identifier based hierarchical coding, provides a number of advantages including bit rate adaptations and improved error resilience, but lacks in compression efficiency when compared to the former scheme. In this paper it is proposed to combine the two approaches such that a fully scalable bit stream could be realized with minimal reduction in compression efficiency when compared to state-of-the-art disposable view components based hierarchical coding. Simulation results shows that the proposed method enables full scalability with maximum BDPSNR reduction of only 0.34 dB. A novel method also has been proposed for the identification of identifier for the legacy H.264/AVC base layer packets. Simulation results also show that this enables the scenario where the enhancement views could be extracted at a lower frame rate (1/2nd or 1/4th of base view) with average extraction time for a view component of only 0.38 ms.