A locally optimal design algorithm for block-based multi-hypothesis motion-compensated prediction

被引:36
作者
Flierl, M [1 ]
Wiegand, T [1 ]
Girod, B [1 ]
机构
[1] Univ Erlangen Nurnberg, Telecommun Lab, D-91058 Erlangen, Germany
来源
DCC '98 - DATA COMPRESSION CONFERENCE | 1998年
关键词
D O I
10.1109/DCC.1998.672152
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-hypothesis motion-compensated prediction er;tends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis motion-compensated prediction are, for example, overlapped block motion compensation (OBMC) and bidirectionally predicted frames (B-frames). This paper presents a generalization of these algorithms in a rate-distortion framework. All blocks which are available for prediction are called hypotheses. Further, we explicitly distinguish between the search space and the superposition of hypotheses. Hypotheses are selected from a search space and their spatio-temporal positions are transmitted by means of spatiotemporal displacement codewords. Constant predictor coefficients are used to combine linearly hypotheses of a multi-hypothesis. The presented design algorithm provides an estimation criterion for optimal multi-hypotheses, a rule for optimal displacement codes, and a condition for optimal predictor coefficients. Statistically dependent hypotheses of a multi-hypothesis are determined by an iterative algorithm. Experimental results show that increasing the number of hypotheses from 1 to 8 provides prediction gains up to 3 dB in prediction error.
引用
收藏
页码:239 / 248
页数:10
相关论文
empty
未找到相关数据