178 0

Fast CU size decision algorithm using machine learning for HEVC intra coding

Title
Fast CU size decision algorithm using machine learning for HEVC intra coding
Author
정제창
Keywords
HEVC; Fast coding unit size decision; Fisher's linear discriminant analysis; k-nearest neighbors classifier
Issue Date
2018-03
Publisher
ELSEVIER SCIENCE BV
Citation
SIGNAL PROCESSING-IMAGE COMMUNICATION, v. 62, page. 33-41
Abstract
High Efficiency Video Coding (HEVC) is a state-of-the-art video compression standard which improves coding efficiency significantly compared with the previous coding standard, H.264/AVC. In the HEVC standard, novel technologies consuming massive computational power are adopted, such as quad-tree-based coding unit (CU) partitioning. Although an HEVC encoder can efficiently compress various video sequences, the computational complexity of an exhaustive search has become a critical problem in HEVC encoder implementation. In this paper, we propose a fast algorithm for the CU partitioning process of the HEVC encoder using machine learning methods. A complexity measure based on the Sobel operator and rate-distortion costs are defined as features for our algorithm. A CU size can be determined early by employing Fisher's linear discriminant analysis and the k-nearest neighbors classifier. The statistical data used for the proposed algorithm is updated by adaptive online learning phase. The experimental results show that the proposed algorithm can reduce encoding time by approximately 54.0% with a 0.68% Bjontegaard-Delta bit-rate increase. (C) 2017 Elsevier B.V. All rights reserved.
URI
https://www.sciencedirect.com/science/article/abs/pii/S0923596517302588?via%3Dihubhttps://repository.hanyang.ac.kr/handle/20.500.11754/117997
ISSN
0923-5965; 1879-2677
DOI
10.1016/j.image.2017.12.005
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE