Optimal Rate Allocation for Scalable Video Coding
Date Issued
2012
Date
2012
Author(s)
Peng, Guan-Ju
Abstract
The scalable video coding problem is investigated, and based on the preferred resolution, the bit allocation problems of wavelet-based scalable video coding and H.264/SVC are formulated and solved. For the wavelet-based video encoder, three methods are proposed. The first is an efficient Lagrangian-based method that solves the upper bound of the problem optimally, and the second is a less efficient dynamic programming method that solves the problem
optimally. Both methods require knowledge of the user preference on resolution. For the case where the user preference is unknown, we solve the problem by a min-max
approach. Our objective is to find the bit allocation solution that maximizes the worst possible performance. We show that the worst performance occurs when all users subscribe to the same spatial, temporal, and quality resolutions. Thus, the min-max solution is exactly the same as the traditional bit allocation method for a non-scalable wavelet codec. We conduct several experiments on the 2D+t MCTF-EZBC wavelet codec with respect to various subscriber preferences. The results demonstrate that knowing the user
preferences improves the coding performance of the scalable video codec significantly.
For the rate allocation problem of H.264/SVC, we present a theoretical analysis of the distortion in multiple layer coding structures. Specifically, we analyze the prediction
structure used to achieve temporal, spatial, and quality scalabilities in a scalable video coding (SVC), and show that the average peak-signal-to-noise (PSNR) of SVC is a
weighted combination of the bit rates assigned to all the streams. We propose two rate-distortion (R-D) optimization algorithms: one employs the known user preference, and
the other is based on the min-max approach which assumes the least favorable prior of the user preference. We compare the performance of our algorithms with that of a state-of-the-art scalable bit allocation algorithm and demonstrate that they outperform the compared approach when the user preference is known to both coders. In this Dissertation, we propose the concept of the user preference in the scalable
video coding, and solve the corresponding rate allocation problems for the two most prevalent scalable video coding methods, which are the MCTF-EZBC wavelet based encoder and H.264/SVC. After comparing the coding gains of the methods with complete preference information over those with incomplete preference information, we verify the importance of the user preference in the scalable video coding.
Subjects
Video Coding
Scalable Video Coding
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-101-D95943035-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):ac7a18c085a683683fefe96416ebd7a2