2009 IEEE Workshop on Signal Processing Systems 2009
DOI: 10.1109/sips.2009.5336231
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive fast multiple reference frame selection algorithm for H.264/AVC using reference region data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…3,4 The coding gain mainly comes from many of new sophisticated techniques such as the integer transform, deblocking filtering, quarter-sample accuracy for motion compensation, multiple reference frame motion estimation (MRF-ME), etc. 2,5,6 Motion estimation (ME) is a process to find a prediction of pixels in the current frame from a reference frame, and it is a key step of frame rate up-conversion [7][8][9][10] and video coding. 11,12 For frame rate up-conversion, the best prediction is the one that results in the highest accuracy of motion trajecPaper 10209R received Dec. 2, 2010; revised manuscript received Apr.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…3,4 The coding gain mainly comes from many of new sophisticated techniques such as the integer transform, deblocking filtering, quarter-sample accuracy for motion compensation, multiple reference frame motion estimation (MRF-ME), etc. 2,5,6 Motion estimation (ME) is a process to find a prediction of pixels in the current frame from a reference frame, and it is a key step of frame rate up-conversion [7][8][9][10] and video coding. 11,12 For frame rate up-conversion, the best prediction is the one that results in the highest accuracy of motion trajecPaper 10209R received Dec. 2, 2010; revised manuscript received Apr.…”
Section: Introductionmentioning
confidence: 99%
“…Various fast algorithms 4,6,[16][17][18][19][20][21][22][23][24][25][26][27] have been proposed in the literature to reduce the computational complexity caused by MRF-ME. These algorithms can be classified into two categories.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation