TINC: Tree-structured Implicit Neural Compression
원문 초록
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 .
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AstroCompress: A benchmark dataset for multi-purpose compression of astronomical data
Stationary MMD Points for Cubature
MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models
Efficient compression of neural networks and datasets
DD-Ranking: Rethinking the Evaluation of Dataset Distillation
ReplayCAD: Generative Diffusion Replay for Continual Anomaly Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.