iCUS: Intelligent CU Size Selection for HEVC Inter Prediction
MetadataShow full item record
The hierarchical quadtree partitioning of Coding Tree Units (CTU) is one of the striking features in HEVC that contributes towards its superior coding performance over its predecessors. However, the brute force evaluation of the quadtree hierarchy using the Rate-Distortion (RD) optimisation, to determine the best partitioning structure for a given content, makes it one of the most time-consuming operations in HEVC encoding. In this context, this paper proposes an intelligent fast Coding Unit (CU) size selection algorithm to expedite the encoding process of HEVC inter-prediction. The proposed algorithm introduces (i) two CU split likelihood modelling and classification approaches using Support Vector Machines (SVM) and Bayesian probabilistic models, and (ii) a fast CU selection algorithm that makes use of both offline trained SVMs and online trained Bayesian probabilistic models. Finally, (iii) a computational complexity to coding efficiency trade-off mechanism is introduced to flexibly control the algorithm to suit different encoding requirements. The experimental results of the proposed algorithm demonstrate an average encoding time reduction performance of 53.46%, 61.15%, and 58.15% for Low Delay B , Random Access , and Low Delay P configurations, respectively, with Bjøntegaard Delta-Bit Rate (BD-BR) losses of 2.35%, 2.9%, and 2.35%, respectively, when evaluated across a wide range of content types and quality levels
Erabadda, B., Mallikarachchi, T., Kulupana, G. and Fernando, A. (2020) 'iCUS: Intelligent CU Size Selection for HEVC Inter Prediction', IEEE Access, 8, pp.141143-141158. https://doi.org/10.1109/ACCESS.2020.3013804
Article published in IEEE Access available open access at https://doi.org/10.1109/ACCESS.2020.3013804
Cardiff Metropolitan University (Grant ID: Cardiff Metropolian (Internal))
Showing items related by title, author, subject and abstract.
“Breaking and Entering”: Evaluation of Various Decryption Techniques to Decipher a Polyalphabetic Substitution Cipher. Brown, Ryan, James (Cardiff Metropolitan University, 2017-04)The dissertation research is based upon both cryptology (the study of cryptosystems in encryption and decryption) and analysing machine learning algorithms. Combining these two studies helped in both understanding cryptosystems ...
Laksari, Hafsa (Cardiff Metropolitan University, 2018-07)This research has been conducted to gain an insight into the world of computational tools that map genomes. Mapping genomes to the correct reference genomes, allows professionals to give an accurate diagnostic of any ...
Reweighted lp Constraint LMS-Based Adaptive Sparse Channel Estimation for Cooperative Communication System Zhang, Aihua; Liu, Pengcheng; Ning, Bing; Zhou, Qiyu (Institution of Engineering and Technology, 2019-11-12)This paper studies the issue of sparsity adaptive channel reconstruction in time-varying cooperative communication networks through the amplify-and-forward transmission scheme. A new sparsity adaptive system identification ...