TINC: Tree-structured Implicit Neural Compression

被引:4
|
作者
Yang, Runzhao [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
D O I
10.1109/CVPR52729.2023.01776
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Implicit neural representation (INR) can describe the target scenes with high fidelity using a small number of parameters, and is emerging as a promising data compression technique. However, limited spectrum coverage is intrinsic to INR, and it is non-trivial to remove redundancy in diverse complex data effectively. Preliminary studies can only exploit either global or local correlation in the target data and thus of limited performance. In this paper, we propose a Tree-structured Implicit Neural Compression (TINC) to conduct compact representation for local regions and extract the shared features of these local representations in a hierarchical manner. Specifically, we use Multi-Layer Perceptrons (MLPs) to fit the partitioned local regions, and these MLPs are organized in tree structure to share parameters according to the spatial distance. The parameter sharing scheme not only ensures the continuity between adjacent regions, but also jointly removes the local and non-local redundancy. Extensive experiments show that TINC improves the compression fidelity of INR, and has shown impressive compression capabilities over commercial tools and other deep learning based methods. Besides, the approach is of high flexibility and can be tailored for different data and parameter settings. The source code can be found at https://github.com/RichealYoung/TINC.
引用
收藏
页码:18517 / 18526
页数:10
相关论文
共 50 条
  • [21] SAR image data compression using a tree-structured wavelet transform
    Zeng, ZH
    Cumming, IG
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2001, 39 (03): : 546 - 552
  • [22] An improved tree-structured codebook search algorithm for grayscale image compression
    Hu, YC
    Chang, CC
    FUNDAMENTA INFORMATICAE, 2006, 70 (03) : 251 - 260
  • [23] Compression via optimal basis selection in large tree-structured dictionaries
    Huang, Yan
    Pollak, Ilya
    COMPUTATIONAL IMAGING IV, 2006, 6065 : IX - XI
  • [24] A fast tree-structured vector quantization method for medical image compression
    Meyer-Bäse, A
    Meyer-Bäse, U
    APPLICATIONS AND SCIENCE OF COMPUTATIONAL INTELLIGENCE V, 2002, 4739 : 150 - 157
  • [25] TREE-STRUCTURED SURVIVAL ANALYSIS
    GORDON, L
    OLSHEN, RA
    CANCER TREATMENT REPORTS, 1985, 69 (10): : 1065 - 1069
  • [26] Tree-structured Haar transforms
    Egiazarian, K
    Astola, J
    JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2002, 16 (03) : 269 - 279
  • [27] Clustering of Tree-structured Data
    Lu, Na
    Wu, Yidan
    2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2015, : 1210 - 1215
  • [28] CRYPTANALYSIS OF TREE-STRUCTURED CIPHERS
    MILLAN, W
    DAWSON, EP
    OCONNOR, LJ
    ELECTRONICS LETTERS, 1994, 30 (12) : 941 - 942
  • [29] Tree-Structured Nonlinear Regression
    Chang, Youngjae
    Kim, Hyeonsoo
    KOREAN JOURNAL OF APPLIED STATISTICS, 2011, 24 (05) : 759 - 768
  • [30] Competitive tree-structured dictionaries
    Goodrich, MT
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 494 - 495