4 August 2010 Inter-mode decision with varied computational complexity
Author Affiliations +
Proceedings Volume 7744, Visual Communications and Image Processing 2010; 77442I (2010) https://doi.org/10.1117/12.863438
Event: Visual Communications and Image Processing 2010, 2010, Huangshan, China
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.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jiyuan Lu, Jiyuan Lu, Peizhao Zhang, Peizhao Zhang, Hongyang Chao, Hongyang Chao, Paul Fisher, Paul Fisher, } "Inter-mode decision with varied computational complexity", Proc. SPIE 7744, Visual Communications and Image Processing 2010, 77442I (4 August 2010); doi: 10.1117/12.863438; https://doi.org/10.1117/12.863438


Back to Top