|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Fast Coding Unit Encoding Scheme for HEVC Using Genetic Algorithm
| Title: | Fast Coding Unit Encoding Scheme for HEVC Using Genetic Algorithm |
| Authors: | El El Tun Browse this author | | Aramvith, Supavadee Browse this author | | Miyanaga, Yoshikazu Browse this author →KAKEN DB |
| Keywords: | Fast encoding | | genetic algorithm | | high efficiency video coding | | quadtree-based coding unit partitioning |
| Issue Date: | 23-May-2019 |
| Publisher: | IEEE (Institute of Electrical and Electronics Engineers) |
| Journal Title: | IEEE Access |
| Volume: | 7 |
| Start Page: | 68010 |
| End Page: | 68021 |
| Publisher DOI: | 10.1109/ACCESS.2019.2918508 |
| Abstract: | High efficiency video coding (HEVC) is the newest video codec to increase significantly the coding efficiency of its ancestor H.264/Advance Video Coding with the aids of its new features, such as the quadtree-based coding unit partitioning, a simple deblocking filter, and other advanced coding techniques. However, the HEVC delivers a highly increased computation complexity, which is mainly due to the exhaustive rate distortion optimization search of quadtree-based coding unit partitioning. In this paper, a coding unit partitioning pattern optimization method based on a genetic algorithm is proposed to save the computational complexity of hierarchical quadtree-based coding unit partitioning. The required coding unit partitioning pattern for exhaustive partitioning and the rate distortion cost are efficiently considered as the chromosome and the fitness function of the genetic algorithm, respectively. To reduce the computational time, coding unit partitioning patterns of the key frame are searched and shared to other consecutive frames by taking into account the highly temporal correlation. Our evaluation results show that the proposed method can achieve 62.5% and 16.7% computational complexity reduction on average with a negligible average quality degradation compared with HM16.5 and state-of-the-art support vector machine-based fast algorithm, respectively, under low-delay P configuration with rate control while 64.1% and 15.1% under low-delay configuration with rate control. |
| Rights: | © 2019 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information. |
| Type: | article |
| URI: | http://hdl.handle.net/2115/75000 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
国際連携研究教育局 : GI-CoRE (Global Institution for Collaborative Research and Education : GI-CoRE) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
|
