Practical Lossless Volumetric Medical Image Compression via Tri-plane Context Tree Learning

• URL: http://arxiv.org/abs/2608.13897v1
• Date: Fri, 14 Aug 2026 03:01:44 GMT
• Title: Practical Lossless Volumetric Medical Image Compression via Tri-plane Context Tree Learning
• Abstract summary: Traditional compression methods are often limited in efficiency due to rigid, handcrafted models.<n>Deep neural network (DNN)-based compression methods, while effective, demand substantial computational resources.<n>We propose a novel tri-plane context tree (TCT)-based method for lossless volumetric medical image compression.
• Score: 44.4636106590074
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Lossless compression of volumetric medical images is of paramount importance for clinical and research applications where data fidelity is essential. Traditional compression methods are often limited in efficiency due to rigid, handcrafted models. Conversely, deep neural network (DNN)-based compression methods, while effective, demand substantial computational resources, hindering deployment in resource-constrained settings. To address these challenges, we propose a novel tri-plane context tree (TCT)-based method for lossless volumetric medical image compression that delivers high performance without relying on DNNs or external training data. To exploit intra-slice and inter-slice redundancies, we introduce a compact tri-plane context representation that decomposes complex 3D context modeling into efficient 2D modeling on three orthogonal planes. By integrating this representation with a context tree framework, we develop an input-specific TCT model employing an adaptive binary tree structure. At each tree node, the model dynamically selects from a suite of tri-plane based predictors and contextual feature extractors, enabling data-adaptive context modeling tailored to local structural characteristics. Instead of offline training, we sample a subset of the input volume to learn the TCT model by optimizing the minimum description length (MDL) through iterative construction and pruning. With the learned TCT model, each pixel retrieves its corresponding context, computes the prediction residual using the predictor dictated by the context, and performs entropy encoding based on the associated histograms. Experimental results demonstrate that the proposed method achieves compression performance on par with recent DNN-based methods on multiple datasets, while maintaining low computational cost and fast coding speeds, making it highly applicable in practice.

Related papers

• Learning from Compressed CT: Feature Attention Style Transfer and Structured Factorized Projections for Resource-Efficient Medical Image Analysis [0.18352113484137622]
  Feature Attention Style Transfer Transfer (FAST) is a novel framework that transfers from high-fidelity CT representations to a visual encoder operating on compressed inputs.<n>Structured Factorized Projection (SFP) is a parameter-efficient alternative to dense projection layers, reducing parameters by almost half.<n>Our contrastive learning pipeline, CT-Lite, integrates these components with a SigLIP-based objective alignment objective.
  arXiv  Detail & Related papers  (2026-05-01T06:35:53Z)
• MedPruner: Training-Free Hierarchical Token Pruning for Efficient 3D Medical Image Understanding in Vision-Language Models [59.180043227905294]
  We propose MedPruner, a training-free and model-agnostic hierarchical token pruning framework for efficient 3D medical image understanding.<n>We show that MedPruner enables models such as MedGemma to maintain or even exceed their original performance while retaining fewer than 5% of visual tokens.
  arXiv  Detail & Related papers  (2026-03-12T07:37:00Z)
• Tail-Aware Post-Training Quantization for 3D Geometry Models [58.79500829118265]
  Post-Training Quantization (PTQ) enables efficient inference without retraining.<n>PTQ fails to transfer effectively to 3D models due to intricate feature distributions and prohibitive calibration overhead.<n>We propose TAPTQ, a Tail-Aware Post-Training Quantization pipeline for 3D geometric learning.
  arXiv  Detail & Related papers  (2026-02-02T07:21:15Z)
• Knowledge-Informed Neural Network for Complex-Valued SAR Image Recognition [51.03674130115878]
  We introduce the Knowledge-Informed Neural Network (KINN), a lightweight framework built upon a novel "compression-aggregation-compression" architecture.<n>KINN establishes a state-of-the-art in parameter-efficient recognition, offering exceptional generalization in data-scarce and out-of-distribution scenarios.
  arXiv  Detail & Related papers  (2025-10-23T07:12:26Z)
• Vector Representations of Vessel Trees [12.391128284848135]
  We introduce a novel framework for learning vector representations of tree-structured geometric data focusing on 3D vascular networks.<n>Our framework, named VeTTA, offers precise, flexible, and topologically consistent modeling of anatomical tree structures in medical imaging.
  arXiv  Detail & Related papers  (2025-06-11T20:34:08Z)
• tCURLoRA: Tensor CUR Decomposition Based Low-Rank Parameter Adaptation and Its Application in Medical Image Segmentation [1.3037269687250654]
  Transfer learning, by leveraging knowledge from pre-trained models, has significantly enhanced the performance of target tasks.<n>As deep neural networks scale up, full fine-tuning introduces substantial computational and storage challenges.<n>We propose tCURLoRA, a novel fine-tuning method based on tensor CUR decomposition.
  arXiv  Detail & Related papers  (2025-01-04T08:25:32Z)
• Distance Weighted Trans Network for Image Completion [52.318730994423106]
  We propose a new architecture that relies on Distance-based Weighted Transformer (DWT) to better understand the relationships between an image's components. CNNs are used to augment the local texture information of coarse priors. DWT blocks are used to recover certain coarse textures and coherent visual structures.
  arXiv  Detail & Related papers  (2023-10-11T12:46:11Z)
• Deep Learning for Material Decomposition in Photon-Counting CT [0.5801044612920815]
  We present a novel deep-learning solution for material decomposition in PCCT, based on an unrolled/unfolded iterative network. Our approach outperforms a maximum likelihood estimation, a variational method, as well as a fully-learned network.
  arXiv  Detail & Related papers  (2022-08-05T19:05:16Z)
• Enforcing connectivity of 3D linear structures using their 2D projections [54.0598511446694]
  We propose to improve the 3D connectivity of our results by minimizing a sum of topology-aware losses on their 2D projections. This suffices to increase the accuracy and to reduce the annotation effort required to provide the required annotated training data.
  arXiv  Detail & Related papers  (2022-07-14T11:42:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.