2006
DOI: 10.1109/tcsvt.2005.859026
|View full text |Cite
|
Sign up to set email alerts
|

Low-complexity skip prediction for H.264 through Lagrangian cost estimation

Abstract: A complexity reduction algorithm for an H.264 encoder is proposed. Computational savings are achieved by identifying, prior to motion estimation, macroblocks (MBs) that are likely to be skipped and hence saving further computational processing of these MBs. This early prediction is made by estimating a Lagrangian rate-distortion cost function which incorporates an adaptive model for the Lagrange multiplier parameter based on local sequence statistics. Simulation results demonstrate that the algorithm can achie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
38
0
1

Year Published

2007
2007
2013
2013

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 71 publications
(42 citation statements)
references
References 14 publications
0
38
0
1
Order By: Relevance
“…Combinations of these techniques with various prediction methods are proposed in [Yin et al 2003;Han and Lee 2004;Ahmad et al 2004;Li et al 2005;Kim et al 2006;Kannangara et al 2006]. Of these, we found the most effective, when used with recent versions of the JM reference software, to be [Kim et al 2006] and [Kannangara et al 2006], which achieve a 53% and a 19%-67% complexity reduction respectively, with insignificant bit rate gain.…”
Section: Low Complexity H264mentioning
confidence: 94%
See 1 more Smart Citation
“…Combinations of these techniques with various prediction methods are proposed in [Yin et al 2003;Han and Lee 2004;Ahmad et al 2004;Li et al 2005;Kim et al 2006;Kannangara et al 2006]. Of these, we found the most effective, when used with recent versions of the JM reference software, to be [Kim et al 2006] and [Kannangara et al 2006], which achieve a 53% and a 19%-67% complexity reduction respectively, with insignificant bit rate gain.…”
Section: Low Complexity H264mentioning
confidence: 94%
“…Of these, we found the most effective, when used with recent versions of the JM reference software, to be [Kim et al 2006] and [Kannangara et al 2006], which achieve a 53% and a 19%-67% complexity reduction respectively, with insignificant bit rate gain.…”
Section: Low Complexity H264mentioning
confidence: 99%
“…Algorithms in the first category, such as [3][6] [11][12][13][14][16] allow for complexity reduction of the total execution time of H.264. Some of these methods allow for several fixed complexity settings.…”
Section: Related Workmentioning
confidence: 99%
“…In the literature, various fast mode decision (FMD) algorithms have been proposed to reduce H.264 computational complexity for single layer coding [4][5][6][7][8]. For H.264 SVC, there also exists considerable research study on FMD.…”
Section: Introductionmentioning
confidence: 99%