2014
DOI: 10.1109/tmm.2014.2356795
|View full text |Cite
|
Sign up to set email alerts
|

MRF-Based Fast HEVC Inter CU Decision With the Variance of Absolute Differences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 66 publications
(26 citation statements)
references
References 20 publications
0
26
0
Order By: Relevance
“…With the purpose of speeding up the ratedistortion optimization (RDO) in both the frame and the CU levels, Leng et al employed the depth information of the neighbouring CTUs and the co-located CTU of the previous frame [26]. Recently, a Markov random field (MRF) based fast CU decision algorithm was proposed in [27], [28]. The MRF can efficiently employ the neighbouring information in CU partitioning decision.…”
Section: Related Workmentioning
confidence: 99%
“…With the purpose of speeding up the ratedistortion optimization (RDO) in both the frame and the CU levels, Leng et al employed the depth information of the neighbouring CTUs and the co-located CTU of the previous frame [26]. Recently, a Markov random field (MRF) based fast CU decision algorithm was proposed in [27], [28]. The MRF can efficiently employ the neighbouring information in CU partitioning decision.…”
Section: Related Workmentioning
confidence: 99%
“…As mentioned by [32][33][34], it is just an MV that distinguishes the current CU and its co-located CU in previous coded frame. Accordingly, the relationship between them can be modeled as I(p + mv, t − 1) = I(p, t), where I(p, t) denotes the value of pixel in p position at t time and mv represents motion vector.…”
Section: Amp Decision Skipping Algorithmmentioning
confidence: 99%
“…The prior probability function p( f 1 |w C ) is modeled using a discrete Bernoulli (φ) distribution. The prior probability function p( f 2 |w C ) obeys the Gaussian distribution [4]. Thus, the prior probability of p( f 2 |w C ) are defined as:…”
Section: Copyright C 2016 the Institute Of Electronics Information Amentioning
confidence: 99%
“…If the early SKIP condition is satisfied, the current depth CU mode selection is skipped, and go to the next depth of the CU. Xiong et al proposed two fast CU decision methods to speed up the inter encoding [4], [5], and these methods are based on the Markov Random Fields and pyramid motion divergence, respectively. However, the two methods can reduce about [7].…”
Section: Introductionmentioning
confidence: 99%