We consider the bit allocation problem in multiview video coding (MVC). A dependent coding technique using trellis expansion and the Viterbi algorithm (VA) is proposed, which takes into account dependencies across time and views. We note that, typically, optimal quantizer choices have the following properties: i) quantization choices tend to be similar for frames that are consecutive (in time or in view), ii) better quantization tends to be used for frames closer to the root of the dependency tree. We propose a search algorithm to speed up the optimization of quantization choices. Our results indicate significant gains can be achieved by an appropriate selection of bit allocation across frames.
Dependent bit allocation in multiview video coding
2005-01-01
345142 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Motion vector prediction in multiview video coding
IEEE | 2005
|British Library Online Contents | 2014
|Multiview video coding with an improved prediction structure for faster random access
British Library Online Contents | 2013
|Global-local correlation-based early large-size mode decision for multiview video coding
British Library Online Contents | 2014
|Macroblock-level adaptive search range algorithm for motion estimation in multiview video coding
British Library Online Contents | 2009
|