2014 IEEE International Conference on Multimedia and Expo (ICME) 2014
DOI: 10.1109/icme.2014.6890319
|View full text |Cite
|
Sign up to set email alerts
|

Efficient coding unit size selection based on texture analysis for HEVC intra prediction

Abstract: Determining the best partitioning structure for a given Coding Tree Unit (CTU) is one of the most time consuming operations within the HEVC encoder. The brute force search through quadtree hierarchy has a significant impact on the encoding time of high definition (HD) videos. This paper presents a fast coding unit size decision-taking algorithm for intra prediction in HEVC. The proposed algorithm utilizes a low complex texture analysis technique based on the local range property of a pixel in a given neighborh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…However, in general, kernel-based gradient computation used in these algorithms is seen as a time-consuming operation resulting in a limited encoding time reduction. Therefore, Mallikarachchi et al in [33] propose to use local range as a texture complexity measurement when determining the CU size for given video content. However, the predetermined threshold and rigid decision trees make this algorithm less content-adaptive leading to inefficient CU size decisions for arbitrary sequences.…”
Section: Texture Properties-based Methodsmentioning
confidence: 99%
“…However, in general, kernel-based gradient computation used in these algorithms is seen as a time-consuming operation resulting in a limited encoding time reduction. Therefore, Mallikarachchi et al in [33] propose to use local range as a texture complexity measurement when determining the CU size for given video content. However, the predetermined threshold and rigid decision trees make this algorithm less content-adaptive leading to inefficient CU size decisions for arbitrary sequences.…”
Section: Texture Properties-based Methodsmentioning
confidence: 99%
“…Another approach to tackle this problem is to detect static regions in the image, which possess a similar movement, and homogenous blocks, which have a similar texture. Then it is unlikely to split them into smaller blocks [5][6][7][21][22][23][24], diminishing the number of required algorithm iterations. Hence, in order to keep the HEVC encoding flow as fast as possible, our work will exploit the homogeneous texture regions.…”
Section: Related Workmentioning
confidence: 99%
“…It is widely accepted that image blocks in which there is a spatial predominant direction should not be divided into smaller blocks in order to reduce the associated Rate Distortion (RD) cost [5][6][7]. A similar idea can be applied to areas with homogenous texture [5,[8][9][10][11] to reduce the complexity of the encoder.…”
Section: Introductionmentioning
confidence: 99%
“…The state-of-the-art methods for encoding complexity reduction can be generally grouped into two categories; statistical knowledge-based and learning-based approaches. For example, the algorithms proposed by Cho et al [2], and Thanuja et al [3] adopt statistical knowledge based approaches to early determine the Coding Unit (CU) size using Bayes decision rules, and texture statistics, respectively. On the other hand, learning based methods use supervised machine learning techniques to generate offline inference models utilizing a large amount of training data.…”
Section: Introductionmentioning
confidence: 99%