# Saliency-Driven Hierarchical Learned Image Coding for Machines

**Authors:** Kristian Fischer, Fabian Brand, Christian Blum, and Andr\'e Kaup

arXiv: 2302.13581 · 2023-02-28

## TL;DR

This paper introduces a saliency-driven hierarchical neural image compression method optimized for machine-to-machine communication, significantly reducing bitrate while maintaining analysis accuracy.

## Contribution

It presents a novel hierarchical neural compression network that uses saliency information to adapt coding quality, improving efficiency over existing standards.

## Key findings

- Achieves 77.1% bitrate savings over VVC on Cityscapes dataset.
- Outperforms traditional non-hierarchical compression networks.
- Effectively integrates saliency detection into training for better compression.

## Abstract

We propose to employ a saliency-driven hierarchical neural image compression network for a machine-to-machine communication scenario following the compress-then-analyze paradigm. By that, different areas of the image are coded at different qualities depending on whether salient objects are located in the corresponding area. Areas without saliency are transmitted in latent spaces of lower spatial resolution in order to reduce the bitrate. The saliency information is explicitly derived from the detections of an object detection network. Furthermore, we propose to add saliency information to the training process in order to further specialize the different latent spaces. All in all, our hierarchical model with all proposed optimizations achieves 77.1 % bitrate savings over the latest video coding standard VVC on the Cityscapes dataset and with Mask R-CNN as analysis network at the decoder side. Thereby, it also outperforms traditional, non-hierarchical compression networks.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/2302.13581/full.md

## Figures

6 figures with captions in the complete paper: https://tomesphere.com/paper/2302.13581/full.md

## References

22 references — full list in the complete paper: https://tomesphere.com/paper/2302.13581/full.md

---
Source: https://tomesphere.com/paper/2302.13581