Efficient Feature Compression for Machines with Global Statistics Preservation
By: Md Eimran Hossain Eimon , Hyomin Choi , Fabien Racapé and more
The split-inference paradigm divides an artificial intelligence (AI) model into two parts. This necessitates the transfer of intermediate feature data between the two halves. Here, effective compression of the feature data becomes vital. In this paper, we employ Z-score normalization to efficiently recover the compressed feature data at the decoder side. To examine the efficacy of our method, the proposed method is integrated into the latest Feature Coding for Machines (FCM) codec standard under development by the Moving Picture Experts Group (MPEG). Our method supersedes the existing scaling method used by the current standard under development. It both reduces the overhead bits and improves the end-task accuracy. To further reduce the overhead in certain circumstances, we also propose a simplified method. Experiments show that using our proposed method shows 17.09% reduction in bitrate on average across different tasks and up to 65.69% for object tracking without sacrificing the task accuracy.
Similar Papers
New VVC profiles targeting Feature Coding for Machines
CV and Pattern Recognition
Compresses computer "thoughts" for faster AI.
RDD: Pareto Analysis of the Rate-Distortion-Distinguishability Trade-off
Signal Processing
Finds hidden problems in data, even when compressed.
Why Should the Server Do It All?: A Scalable, Versatile, and Model-Agnostic Framework for Server-Light DNN Inference over Massively Distributed Clients via Training-Free Intermediate Feature Compression
Distributed, Parallel, and Cluster Computing
Makes AI faster and use less power.