Fast Coding Unit Encoding Mechanism for Low Complexity Video Coding

In high efficiency video coding (HEVC), coding tree contributes to excellent compression performance. However, coding tree brings extremely high computational complexity. Innovative works for improving coding tree to further reduce encoding time are stated in this paper. A novel low complexity codin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:PloS one Jg. 11; H. 3; S. e0151689
Hauptverfasser: Gao, Yuan, Liu, Pengyu, Wu, Yueying, Jia, Kebin, Gao, Guandong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States Public Library of Science 21.03.2016
Public Library of Science (PLoS)
Schlagworte:
Algorithms
Analysis
Biology and Life Sciences
Coding
Coding standards
Coding theory
Complexity
Compression
Computer and Information Sciences
Computer applications
Computer engineering
Copper
Efficiency
Engineering and Technology
Image coding
Image Enhancement - methods
Innovations
International conferences
Internet
Laboratories
Lossless
Models, Theoretical
Multimedia
Physical Sciences
Probabilistic models
Probability
Research and Analysis Methods
Statistical analysis
Trees
Video compression
Video Recording - methods
Visual communication
Beijing China
China
ISSN:1932-6203, 1932-6203
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In high efficiency video coding (HEVC), coding tree contributes to excellent compression performance. However, coding tree brings extremely high computational complexity. Innovative works for improving coding tree to further reduce encoding time are stated in this paper. A novel low complexity coding tree mechanism is proposed for HEVC fast coding unit (CU) encoding. Firstly, this paper makes an in-depth study of the relationship among CU distribution, quantization parameter (QP) and content change (CC). Secondly, a CU coding tree probability model is proposed for modeling and predicting CU distribution. Eventually, a CU coding tree probability update is proposed, aiming to address probabilistic model distortion problems caused by CC. Experimental results show that the proposed low complexity CU coding tree mechanism significantly reduces encoding time by 27% for lossy coding and 42% for visually lossless coding and lossless coding. The proposed low complexity CU coding tree mechanism devotes to improving coding performance under various application conditions.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Conceived and designed the experiments: YG. Performed the experiments: YG YW. Analyzed the data: YG PL GG. Contributed reagents/materials/analysis tools: KJ. Wrote the paper: YG PL YW. Helped improve the language usage of the revision: KJ GG.
Competing Interests: The authors have declared that no competing interests exist.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0151689