Skip to content
AI News HubLIVE
Original source2 min read

You've Seen Enough: Quality-Constrained Image Coding for Machines

Summary

A new arXiv paper introduces a quality-constrained image coding method for machines. It caps human-observed quality at a chosen level and redirects the remaining bitrate toward machine vision performance. The authors recast joint compression-segmentation training as constrained optimization and propose absolute and bilinear penalty functions. Under the quality constraint, the method reports BD-rate reductions of 22.82% over unconstrained joint rate-distortion-task optimization and 29.81% over a rate-distortion baseline, with no added complexity.

SourcearXiv Computer VisionAuthor: Khoa Pham-Dinh, Sanaz Nami, Hamed Rezazadegan Tavakoli, Moncef Gabbouj, Farhad Pakdaman
You've Seen Enough: Quality-Constrained Image Coding for Machines
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 20 Sep 2026]

Title:You've Seen Enough: Quality-Constrained Image Coding for Machines

View a PDF of the paper titled You've Seen Enough: Quality-Constrained Image Coding for Machines, by Khoa Pham-Dinh and 4 other authors

View PDF HTML (experimental)

Abstract:Visual data is increasingly consumed by machine-vision systems rather than by human observers. Image Coding for Machines (ICM) compresses images assuming the main observer is a computer vision application and that the human observer needs to inspect or validate the decisions. Inspired by just-noticeable distortion, which sets the quality to the just-acceptable level for human observers, we aim to cap the human-observed quality at a desired level, with the goal of using the remaining coding capacity to improve the machine performance. We recast joint compression-segmentation training as a constrained optimization problem in which the codec must meet a predefined acceptable target visual quality while a task term consumes the remaining coding capacity. We solve this by designing a penalty function to guide the quality to the desired target. We propose two penalty functions, an absolute function and a bilinear function, the latter applying a steeper slope once the target visual quality is exceeded. Experimental results show that, under the quality constraint, the proposed method achieves a BD-rate of $-22.82\%$ over an unconstrained joint rate--distortion--task optimization and $-29.81\%$ over a simple rate--distortion baseline, showcasing bitrate reduction with the same task performance. This is achieved while the codec also meets the target visual quality with a reasonable error and without adding any complexity overhead.

Subjects:

Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)

Cite as: arXiv:2609.25108 [cs.CV]

(or arXiv:2609.25108v1 [cs.CV] for this version)

https://doi.org/10.48550/arXiv.2609.25108

arXiv-issued DOI via DataCite

Submission history

From: Khoa Pham-Dinh [view email] [v1] Sun, 20 Sep 2026 04:02:36 UTC (7,810 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled You've Seen Enough: Quality-Constrained Image Coding for Machines, by Khoa Pham-Dinh and 4 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.CV

new | recent | 2026-09

Change to browse by:

cs cs.AI

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • Image Coding for Machines (ICM) assumes a computer vision application is the primary observer, while humans inspect or validate decisions.
  • The method limits human-observed quality to a desired target and uses remaining coding capacity to improve machine task performance.
  • Joint compression-segmentation training is formulated as constrained optimization, guided by absolute and bilinear penalty functions.
  • Results show BD-rate reductions of 22.82% and 29.81% with the same task performance, reasonable target-quality error, and no complexity overhead.

Highlights and analysis are generated automatically and may contain errors. Check the original source.