Abstract
High Efficiency Video Coding (HEVC) adopts complex quadtree-structured CU (coding unit) and PU (prediction unit) modes. Thus, the search process for optimal modes causes high computational complexity in HEVC. To solve this problem, a fast coding algorithm is proposed. Thirteen neighboring CTUs (Coding Tree Unit) are divided into three classes with the k-means method, and are selectively used as the reference CTUs to calculate the predicted CU depth levels for the current CTU. Additionally, for every CU depth, we skip some rarely used PU modes to reduce the complexity of the PU selection algorithm. Experimental results show that compared with the HEVC reference software, our algorithm can achieve 56.71% time saving with Low Delay Configuration profile and 59.76% with Random Access Configuration profile, whereas values of BDBR (Bjontegaard Delta Bit Rate) are only 1.0517% and 0.9918%, respectively. Compared with five state-of-the-art algorithms, the proposed algorithm has significant encoding time reduction with good bitrate performances.
| Original language | English |
|---|---|
| Pages (from-to) | 474-486 |
| Number of pages | 13 |
| Journal | Journal of Visual Communication and Image Representation |
| Volume | 38 |
| DOIs | |
| State | Published - Jul 2016 |
Bibliographical note
Publisher Copyright:© 2016 Elsevier Inc. All rights reserved.
Keywords
- CU (Coding Unit) size decision
- HEVC (High Efficiency Video Coding)
- PU (Prediction Unit) mode decision
- Statistical analysis
- k-means clustering algorithm
Fingerprint
Dive into the research topics of 'Efficient prediction of CU depth and PU mode for fast HEVC encoding using statistical analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver