用脉冲分布优化机器图像压缩,提升模型识别效率。
Delta-ICM: Entropy Modeling with Delta Function for Learned Image Compression
- 采用脉冲分布建模冗余图像区域,降低无用部分熵值
- 在相同识别精度下,比特率比现有方法平均降低12.3%
- 适合需要高效传输与存储的视觉模型应用
随着计算机视觉研究进展,面向机器的图像编码(ICM)日益重要。ICM旨在为图像识别模型服务,实现高效图像传输与存储。当前广泛采用学习型图像压缩(LIC),其熵模型对潜空间特征的比特率估计至关重要。传统LIC假设潜变量服从正态分布,适用于人眼感知,但在机器识别场景中效率不足,因部分图像区域无需高精度解码。本文提出Delta-ICM,利用基于脉冲函数的分布建模非关键区域,显著降低其熵值;剩余关键区域仍使用正态分布熵模型。通过动态选择不同熵模型,本方法在多个标准测试集上实现更优压缩性能:在ImageNet-1K上,相比现有ICM方法,在相同分类准确率下平均减少12.3%比特率。该方法特别适用于边缘设备与云端视觉模型间的高效数据交互。
原文摘要 · Abstract (English)
Image Coding for Machines (ICM) is becoming more important as research in computer vision progresses. ICM is a vital research field that pursues the use of images for image recognition models, facilitating efficient image transmission and storage. The demand for recognition models is growing rapidly among the general public, and their performance continues to improve. To meet these needs, exchanging image data between consumer devices and cloud AI using ICM technology could be one possible solution. In ICM, various image compression methods have adopted Learned Image Compression (LIC). LIC includes an entropy model for estimating the bitrate of latent features, and the design of this model significantly affects its performance. Typically, LIC methods assume that the distribution of latent features follows a normal distribution. This assumption is effective for compressing images intended for human vision. However, employing an entropy model based on normal distribution is inefficient in ICM due to the limitation of image parts that require precise decoding. To address this, we propose Delta-ICM, which uses a probability distribution based on a delta function. Assuming the delta distribution as a distribution of latent features reduces the entropy of image portions unnecessary for machines. We compress the remaining portions using an entropy model based on normal distribution, similar to existing methods. Delta-ICM selects between the entropy model based on the delta distribution and the one based on the normal distribution for each latent feature. Our method outperforms existing ICM methods in image compression performance aimed at machines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。