98%
921
2 minutes
20
The latest versatile video coding (VVC) standard proposed by the Joint Video Exploration Team (JVET) has significantly improved coding efficiency compared to that of its predecessor, while introducing an extremely higher computational complexity by $6\sim 26$ times. The quad-tree plus multi-type tree (QTMT)-based coding unit (CU) partition accounts for most of the encoding time in VVC encoding. This paper proposes a data-driven fast CU partition approach based on an efficient Transformer model to accelerate VVC inter-coding. First, we establish a large-scale database for inter-mode VVC, comprising diverse CU partition patterns from more than 800 raw video sequences across various resolutions and contents. Next, we propose a deep neural network model with a Transformer-based temporal topology for predicting the CU partition, named as TCP-Net, which is adaptive to the group of pictures (GOP) hierarchy in VVC. Then, we design a two-stage structured output for TCP-Net, reflecting both the locations of CU edges and the split modes of all possible CUs. Accordingly, we develop a dual-supervised optimization mechanism to train the TCP-Net model with improved accuracy. The experimental results have verified that our approach can reduce the encoding time by $46.89\sim 55.91$ % with negligible rate-distortion (RD) degradation, outperforming other state-of-the-art approaches.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1109/TIP.2025.3533204 | DOI Listing |
Sci Adv
September 2025
Shenzhen Key Laboratory of Smart Healthcare Engineering, Guangdong Provincial Key Laboratory of Advanced Biomaterials, Department of Biomedical Engineering. Southern University of Science and Technology, No. 1088 Xueyuan Rd., Nanshan District, Shenzhen, Guangdong 518055, P. R. China.
DNA with high storage density can serve as an alternative storage medium to respond to the global explosion of data growth and become a powerful personal storage memory if an integrated compact device can store and handle large-scale data. Here, we incorporate a DNA cassette tape with 5.5 × 10 addressable data partitions (addressing rate up to 1570 partitions per second), a DNA loading capacity of 28.
View Article and Find Full Text PDFSci Rep
September 2025
Remote Credit Business Department, Sichuan Rural Commercial United Bank Co., Ltd, Chengdu, 610041, Sichuan, China.
As big data systems expand in scale and complexity, managing and securing sensitive data-especially personnel records-has become a critical challenge in cloud environments. This paper proposes a novel Multi-Layer Secure Cloud Storage Model (MLSCSM) tailored for large-scale personnel data. The model integrates fast and secure ChaCha20 encryption, Dual Stage Data Partitioning (DSDP) to maintain statistical reliability across blocks, k-anonymization to ensure privacy, SHA-512 hashing for data integrity, and Cauchy matrix-based dispersion for fault-tolerant distributed storage.
View Article and Find Full Text PDFJ Chem Inf Model
September 2025
Institute of Physical Chemistry, RWTH Aachen University, Melatener Str. 20, 52074 Aachen, Germany.
Large-scale computational exploration of reactions offers a new perspective for understanding chemical reaction processes. However, it often relies on chemical intuition and extensive manual effort. We introduce here a novel algorithm for the fast exploration of possible products in bimolecular reactions.
View Article and Find Full Text PDFDiabetes
August 2025
Department of Epidemiology, Gillings School of Global Public Health, University of North Carolina, Chapel Hill, NC.
Unlabelled: Diabetes has a large medical and public health impact in American Indians. Studies have used genetic data to distinguish type 1 diabetes (T1D) and type 2 diabetes (T2D) and uncover biologic mechanisms underlying T2D clinical heterogeneity. We applied a T1D polygenic score (PS) to 3,084 American Indians (mean age 56 years, 58% women, 39% diabetes).
View Article and Find Full Text PDFSci Rep
August 2025
School of Information, Shanxi University of Finance and Economics, Taiyuan, 030006, Shanxi, China.
Large-scale clustering remains an active yet challenging task in data mining and machine learning, where existing algorithms often struggle to balance efficiency, accuracy, and adaptability. This paper proposes a novel large-scale clustering framework with three key innovations: (1) Parameter-free cluster discovery: unlike conventional methods requiring predefined cluster numbers, our algorithm autonomously identifies natural cluster structures through dynamic density-based splitting decisions. (2) Hybrid sampling-partitioning strategy: by integrating randomized sampling with K-means-based partitioning, we extract high-quality representative points that preserve data integrity with linear computational complexity.
View Article and Find Full Text PDF