Efficient constrained video coding for low complexity decoding

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the latest video compression standard H.264/AVC motion compensation is the most complex operation mainly because of the operations involved on computing sub-pixel predictions. Generally this increases a video stream decoding complexity. This paper describes an efficient method to generate compressed video streams with low complexity decoding requirements. This is particularly targeted at portable decoders, where the use of such video streams leads to reduced power consumption extending the battery life. By using metrics of the computational complexity needed to decode a video stream and make the coding process aware of those, it is shown that the decoding complexity can be significantly reduced with minimal punishment in rate-distortion performance. The experimental results indicate that such optimized constrained coding method is able of achieving substantial decoding complexity decrease at the expense of minimal PSNR loss within the scope of operational bit rates. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cordeiro, P. J., Gomez-Pulido, J., & Assunção, P. A. (2008). Efficient constrained video coding for low complexity decoding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5112 LNCS, pp. 243–252). Springer Verlag. https://doi.org/10.1007/978-3-540-69812-8_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free