Share Email Print

Proceedings Paper

Inter-mode decision with varied computational complexity
Author(s): Jiyuan Lu; Peizhao Zhang; Hongyang Chao; Paul Fisher
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Variable block size motion compensation significantly improves the rate-distortion performance of video coding at the cost of high computational complexity. Currently, fast inter-mode decision algorithms only improve the speed of intermode decision (MD) but do not provide a flexible computational complexity control to adapt to different hardware platforms with optimized rate-distortion (R-D) performance. Instead of speeding up inter-mode decision merely, we attempt to propose a complexity adjustable inter-mode decision algorithm to attain optimized coding performance under different computational complexity constraints herein. Our algorithm predicts the Lagrangian cost and complexity slope (J-C slope) of MD for each macroblock (MB) by exploiting their temporal and spatial correlations. MD is applied on the MBs with larger J-C slope to provide the better prediction performance with less computational cost. Adjustable complexity is obtained by preset the number of MBs on which MD is applied for each frame. According to our experiments, the algorithm can both freely adjust the computational complexity and provides an improved R-D performance under different computational constraints.

Paper Details

Date Published: 5 August 2010
PDF: 8 pages
Proc. SPIE 7744, Visual Communications and Image Processing 2010, 77442I (5 August 2010); doi: 10.1117/12.863438
Show Author Affiliations
Jiyuan Lu, Sun Yat-Sen Univ. (China)
Guangdong Univ. of Finance (China)
Peizhao Zhang, Sun Yat-Sen Univ. (China)
Hongyang Chao, Sun Yat-Sen Univ. (China)
Paul Fisher, Winston-Salem State Univ. (United States)

Published in SPIE Proceedings Vol. 7744:
Visual Communications and Image Processing 2010
Pascal Frossard; Houqiang Li; Feng Wu; Bernd Girod; Shipeng Li; Guo Wei, Editor(s)

© SPIE. Terms of Use
Back to Top