z-logo
open-access-imgOpen Access
Low complexity H.264 video encoding
Author(s) -
Paula Carrillo,
Hari Kalva,
Pin Tao
Publication year - 2009
Publication title -
proceedings of spie, the international society for optical engineering/proceedings of spie
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 0.192
H-Index - 176
eISSN - 1996-756X
pISSN - 0277-786X
DOI - 10.1117/12.829400
Subject(s) - computer science , encoder , encoding (memory) , computational complexity theory , scalable video coding , bit rate , data compression , context adaptive binary arithmetic coding , real time computing , context adaptive variable length coding , video quality , reduction (mathematics) , block (permutation group theory) , algorithm , artificial intelligence , motion compensation , metric (unit) , operations management , geometry , mathematics , economics , operating system
H.264/AVC encoder complexity is mainly due to variable block size in Intra and Inter frames. This makes H.264/AVC very difficult to implement, especially for real time applications and mobile devices. The current technological challenge is to conserve the compression capacity and quality that H.264 offers but reduce the encoding time and, therefore, the processing complexity. This paper applies machine learning technique for video encoding mode decisions and investigates ways to improve the process of generating more general low complexity H.264/AVC video encoders. The proposed H.264 encoding method decreases the complexity in the mode decision inside the Inter frames. Results show, on average, a 67.36% reduction in encoding time, a 0.2 dB decrease in PSNR, and an average bit rate increase of 0.05%. © 2009 SPIE.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom