Buffer requirement analysis and reference picture marking for temporal scalable video coding
Qiu Shen,
Wang, Ye-Kui
Hannuksela, Miska M.
Houqiang Li,
Yi Wang,
University of Science and Technology of China, Hefei, 230027, P.R. China;
This paper appears in: Packet Video 2007
Publication Date: 12-13 Nov. 2007
On page(s): 91-97
Location: Lausanne, Switzerland,
ISBN: 978-1-4244-0981-5
Digital Object Identifier: 10.1109/PACKET.2007.4397030
Posted online: 2007-12-06 13:59:15.0
Abstract
Temporal scalable video coding is a useful feature supported in all existing video coding standards. Though coding efficiency is still the predominant performance metric, buffer requirement is another important factor for assessment of temporal scalable video coding methods. This paper presents analyses of minimum buffer requirement for temporal scalable coding based on the most typical temporal scalable video coding structure, i.e., the so-called hierarchical B picture coding structure. Minimum buffer sizes required for decoding of both the full bitstreams and thinned bitstreams are derived. After that, some reference picture management methods are proposed in order to enable both minimum buffer consumption and maximum coding efficiency. Comparative experiment results showing how different reference picture marking methods affect coding efficiency are also provided.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
