无需深度学习,高效压缩医学3D影像,保持原质且速度快。
Practical Lossless Volumetric Medical Image Compression via Tri-plane Context Tree Learning

- 用三平面上下文树建模,将3D冗余转为2D高效处理。
- 自适应选择预测器,实现数据驱动的上下文建模。
- 无需训练,基于最小描述长度优化,适合临床部署。
体积医学图像的无损压缩对临床和研究应用至关重要,要求数据保真。传统方法因固定手工模型效率受限;而深度神经网络(DNN)方法虽有效,但计算开销大,难以在资源受限场景部署。为此,本文提出一种新型三平面上下文树(TCT)方法,无需DNN或外部训练数据即可实现高性能无损压缩。通过三组正交平面对复杂3D上下文建模进行分解,结合上下文树框架构建输入特定的TCT模型,采用自适应二叉树结构,在每个节点动态选择三平面预测器与上下文特征提取器,实现针对局部结构特性的数据自适应建模。模型通过采样输入体数据子集,基于最小描述长度(MDL)迭代构建与剪枝进行优化,无需离线训练。编码时,每个像素根据对应上下文调用预测器计算残差,并基于关联直方图进行熵编码。实验表明,该方法在多个数据集上压缩性能媲美最新DNN方法,同时保持低计算成本与快速编码速度,具有高度实用性。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。