arrow
返回

Fast Coding Unit Depth Identification Using Texture and Multiple Deep Learning Architectures

delete2025-03-01
delete0
PRE
AI
H
Hari Pattimi
K
Kota Naga Srinivasarao Batta
P
Polamarasetty P Kumar
R
Ramakrishna S S Nuvvula
B
B. Zorina Khan
A
Aanchal Verma
R
R. K. Saket *
DOI:10.1109/TCSI.2025.3526636delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
High-Efficiency Video Coding (HEVC), often known as H.265, is a new video coding standard that offers substantially better compression efficiency than the previous standard, H.264 while maintaining the same video quality. In HEVC, the quadtree partition method divides Coding Tree Units (CTUs) into Coding Units (CUs). This coding unit partition is recursive and increases computational complexity because it is dependent on rate-distortion optimization (RDO). In this paper, we propose a texture and deep learning-based system, that initiates the CU partition by the calculation of the CU texture attributes. Coding units are classified into three categories based on texturing properties. Class 1 represents mostly homogeneous regions, Class 2 mostly non-homogeneous regions, and Class 3 other regions. Only class 3 blocks are sent through the deep learning architecture. As a result, the total number of blocks partitioned by the deep learning architecture is lowered. We also proposed three distinct deep learning-based architectures in our system for coding unit partitioning, which eliminates the need for rate-distortion optimization and thereby decreases computational complexity. The input to our proposed texture and deep learning-based system is an image of size 64 x 64 (CTU), while the output is a 1 x 16 vector representing the depths of the coding tree unit. Simulation results demonstrate the effectiveness of our proposed system. Compared to existing models, our proposed CU-CNN, CU-MobileNet, and CU-Resnet have reduced the encoding time of CU partitions by 68.41%, 75.77%, and 88.08% respectively. In addition, the results demonstrated that the proposed system with the CU-MobileNet model is appropriate for mobile or lightweight applications, while the CU-Resnet model works well for time-critical or high-speed applications.
Keyword:
Encoding
Rate-distortion
Optimization
Standards
Training
Copper
Electronic mail
Coding tree unit (CTU)
coding unit (CU)
convolutional neural network (CNN)
deep learning (DL)
high-efficiency video coding (HEVC)
convolutional neural network (CNN)
deep learning (DL)
high-efficiency video coding (HEVC)

期刊

IEEE Transactions on Circuits and Systems I-Regular Papers 封面图
IEEE Transactions on Circuits and Systems I-Regular Papers
IF:
5.2
论文数:
9.9K
被引数:
2.2W

机构

N
NMAM Institute of Technology
学者数:
203
论文数: 180
被引数: 0
N
national institute of technology (nit system)
学者数:
4.0W
论文数: 3.7W
被引数: 31
N
nitte (deemed to be university)
学者数:
2.0K
论文数: 1.3K
被引数: 0
I
INESC TEC
学者数:
1.5K
论文数: 1.4K
被引数: 1.7K
N
National Institute of Technology Warangal
学者数:
1.3K
论文数: 1.1K
被引数: 2.3K
学者 查看更多机构
引用论文

引用论文

Rate-Distortion Optimization Based on Two-Pass Encoding for HEVC
err2021-01-01
err1
errOAAI
errGuo, Hongwei; Xiao, Tianqing; Fan, Xiangsuo; Liu, Yuyang; Liu, Shuai
err分享
err收藏
Utility of Columbia classification in focal segmental glomerulosclerosis: renal prognosis and treatment response among the pathological variants
err2019-01-11
err0
errOAAI
errAkihiro Tsuchimoto; Yuta Matsukuma; Kenji Ueki; Shigeru Tanaka; Kosuke Masutani; Kaneyasu Nakagawa; Koji Mitsuiki; Noriko Uesugi; Ritsuko Katafuchi; Kazuhiko Tsuruya; Toshiaki Nakano; Takanari Kitazono
err分享
err收藏
1013-2007
err
IF0
err2007-01-01
err0
PREAI
err
err分享
err收藏
Podocyte mRNA in the urinary sediment of minimal change nephropathy and focal segmental glomerulosclerosis
err2015-10-01
err0
PREAI
errCheuk-Chun Szeto; Gang Wang; Kai-Ming Chow; Fernand Mac-Moune Lai; Terry King-Wing Ma; Bonnie Ching-Ha Kwan; Cathy Choi-Wan Luk; Philip Kam-Tao Li
err分享
err收藏
Effects of Fasting on Gluconeogenic Enzymes in the Ovine Fetus
err1986-07-01
err0
errOAAI
errJames A Lemons; Helen C Moorehead; George P Hage
err分享
err收藏
学者 查看更多内容