Abstract
Flexible coding unit partitioning such as quad-tree nested binary-tree and ternary-tree adopted by the emerging enhanced compression model (ECM) brings promising coding performance improvement. Meanwhile, the computational complexity increases dramatically, which may block the exploration and validation of new coding tools. This paper investigates a partition mode early pruning scheme via a fully connected network to reduce the encoding complexity for the ECM. In particular, we carefully select features and devise the fully connected network, which could seamlessly cooperate with the encoder, revealing promising learning and inference capability. Experimental results demonstrate that the proposed method achieves 15%50% encoding time savings with moderate bit-rate increasing on the ECM, and the extra complexity regarding the fully connected network and feature extraction is negligible.
Original language | English |
---|---|
Title of host publication | Proceedings : DCC 2022 : 2022 Data Compression Conference |
Editors | Ali BILGIN, Michael W. MARCELLIN, Joan SERRA-SAGRISTA, James A. STORER |
Publisher | IEEE |
Pages | 222-231 |
Number of pages | 10 |
ISBN (Electronic) | 9781665478939 |
DOIs | |
Publication status | Published - 2022 |
Externally published | Yes |
Event | 2022 Data Compression Conference, DCC 2022 - Snowbird, United States Duration: 22 Mar 2022 → 25 Mar 2022 |
Publication series
Name | Data Compression Conference Proceedings |
---|---|
Volume | 2022-March |
ISSN (Print) | 1068-0314 |
Conference
Conference | 2022 Data Compression Conference, DCC 2022 |
---|---|
Country/Territory | United States |
City | Snowbird |
Period | 22/03/22 → 25/03/22 |
Bibliographical note
Publisher Copyright:© 2022 IEEE.
Keywords
- Block Partition
- ECM
- QTMT