2008
DOI: 10.1016/j.jvcir.2007.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic computational complexity and bit allocation for optimizing H.264/AVC video compression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 24 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…From the video coding point of view, many bit allocation algorithms [17][18][19][20][21][22][23][24] are proposed for improving compression efficiency. Kaminsky et al proposed a complexity-ratedistortion model to dynamically allocate bits with both complexity and distortion constraints [17].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…From the video coding point of view, many bit allocation algorithms [17][18][19][20][21][22][23][24] are proposed for improving compression efficiency. Kaminsky et al proposed a complexity-ratedistortion model to dynamically allocate bits with both complexity and distortion constraints [17].…”
Section: Introductionmentioning
confidence: 99%
“…From the video coding point of view, many bit allocation algorithms [17][18][19][20][21][22][23][24] are proposed for improving compression efficiency. Kaminsky et al proposed a complexity-ratedistortion model to dynamically allocate bits with both complexity and distortion constraints [17]. Lu et al proposed a Group-Of-Picture (GOP-)level bit allocation [18] scheme and Shen et al proposed another frame-level bit allocation method which decreases the average standard deviation of video quality [19].…”
Section: Introductionmentioning
confidence: 99%