Next Article in Journal
Multi-Granulation Entropy and Its Applications
Previous Article in Journal
Bootstrap Methods for the Empirical Study of Decision-Making and Information Flows in Social Systems
Open AccessArticle

Entropy-Based Fast Largest Coding Unit Partition Algorithm in High-Efficiency Video Coding

College of Information Engineering, North China University of Technology, Beijing 100144, China
Institute of Information Science, Beijing Jiaotong University, Beijing 100144, China
Authors to whom correspondence should be addressed.
Entropy 2013, 15(6), 2277-2287;
Received: 3 April 2013 / Revised: 22 April 2013 / Accepted: 30 May 2013 / Published: 6 June 2013
High-efficiency video coding (HEVC) is a new video coding standard being developed by the Joint Collaborative Team on Video Coding. HEVC adopted numerous new tools, such as more flexible data structure representations, which include the coding unit (CU), prediction unit, and transform unit. In the partitioning of the largest coding unit (LCU) into CUs, rate distortion optimization (RDO) is applied. However, the computation complexity of RDO is too high for real-time application scenarios. Based on studies on the relationship between CUs and their entropy, this paper proposes a fast algorithm based on entropy to partition LCU as a substitute for RDO in HEVC. Experimental results show that the proposed entropy-based LCU partition algorithm can reduce coding time by 62.3% on average, with an acceptable loss of 3.82% using Bjøntegaard delta rate. View Full-Text
Keywords: HEVC; entropy; coding unit; information content HEVC; entropy; coding unit; information content
Show Figures

Figure 1

MDPI and ACS Style

Zhang, M.; Qu, J.; Bai, H. Entropy-Based Fast Largest Coding Unit Partition Algorithm in High-Efficiency Video Coding. Entropy 2013, 15, 2277-2287.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Back to TopTop