2013 Visual Communications and Image Processing (VCIP) 2013
DOI: 10.1109/vcip.2013.6706389
|View full text |Cite
|
Sign up to set email alerts
|

Fast bottom-up pruning for HEVC intraframe coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…The first sub-category contains those in which the partitioning decision is taken exclusively on the basis of the RD cost value of the different CU sizes [16][17][18]. The approaches in the second subcategory [19,20] mainly use the same schema, but the optimal CTU partitioning prediction is based on some content features extracted from the CUs.…”
Section: Related Workmentioning
confidence: 99%
“…The first sub-category contains those in which the partitioning decision is taken exclusively on the basis of the RD cost value of the different CU sizes [16][17][18]. The approaches in the second subcategory [19,20] mainly use the same schema, but the optimal CTU partitioning prediction is based on some content features extracted from the CUs.…”
Section: Related Workmentioning
confidence: 99%
“…Lin et al in [17] propose the use of the edge strength in a CTU that is defined with simple Sobel edge detection, to constrain the possible maximum depth of quad-tree partition of the CTU. A last group can be identified in this category, in [18,19] a pruning scheme that exploit the strong correlation between the RDO cost and the probability that a CU being split or not is proposed. Those approaches in first category achieve a significant computational complexity reduction, over 50% some of them, with moderate rate penalties.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, we have computed the bit rate differences between both implementations, using the ∆Bitrate measure, depicted in Eq. (18). Table 6 collects the results for one sequence from each class that we have found representative of the general performance behavior.…”
Section: Performance For Hevc Intra-predictionmentioning
confidence: 99%
See 1 more Smart Citation
“…Accordingly, algorithms [16, 17] for CU partitioning were proposed. The authors in [18–20] analysed the probabilities of CU splitting in different situations and proposed statistical methods to achieve the goal. The algorithms in [21–23] include methods that utilise the information of adjacent CUs.…”
Section: Introductionmentioning
confidence: 99%