POS-ISP: Pipeline Optimization at the Sequence Level for Task-aware ISP

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Won, Jiyun, Yang, Heemin, Kim, Woohyeok, Ok, Jungseul, Cho, Sunghyun
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915923842039808
author Won, Jiyun
Yang, Heemin
Kim, Woohyeok
Ok, Jungseul
Cho, Sunghyun
author_facet Won, Jiyun
Yang, Heemin
Kim, Woohyeok
Ok, Jungseul
Cho, Sunghyun
contents Recent work has explored optimizing image signal processing (ISP) pipelines for various tasks by composing predefined modules and adapting them to task-specific objectives. However, jointly optimizing module sequences and parameters remains challenging. Existing approaches rely on neural architecture search (NAS) or step-wise reinforcement learning (RL), but NAS suffers from a training-inference mismatch, while step-wise RL leads to unstable training and high computational overhead due to stage-wise decision-making. We propose POS-ISP, a sequence-level RL framework that formulates modular ISP optimization as a global sequence prediction problem. Our method predicts the entire module sequence and its parameters in a single forward pass and optimizes the pipeline using a terminal task reward, eliminating the need for intermediate supervision and redundant executions. Experiments across multiple downstream tasks show that POS-ISP improves task performance while reducing computational cost, highlighting sequence-level optimization as a stable and efficient paradigm for task-aware ISP. The project page is available at https://w1jyun.github.io/POS-ISP
format Preprint
id arxiv_https___arxiv_org_abs_2604_06938
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle POS-ISP: Pipeline Optimization at the Sequence Level for Task-aware ISP
Won, Jiyun
Yang, Heemin
Kim, Woohyeok
Ok, Jungseul
Cho, Sunghyun
Computer Vision and Pattern Recognition
Recent work has explored optimizing image signal processing (ISP) pipelines for various tasks by composing predefined modules and adapting them to task-specific objectives. However, jointly optimizing module sequences and parameters remains challenging. Existing approaches rely on neural architecture search (NAS) or step-wise reinforcement learning (RL), but NAS suffers from a training-inference mismatch, while step-wise RL leads to unstable training and high computational overhead due to stage-wise decision-making. We propose POS-ISP, a sequence-level RL framework that formulates modular ISP optimization as a global sequence prediction problem. Our method predicts the entire module sequence and its parameters in a single forward pass and optimizes the pipeline using a terminal task reward, eliminating the need for intermediate supervision and redundant executions. Experiments across multiple downstream tasks show that POS-ISP improves task performance while reducing computational cost, highlighting sequence-level optimization as a stable and efficient paradigm for task-aware ISP. The project page is available at https://w1jyun.github.io/POS-ISP
title POS-ISP: Pipeline Optimization at the Sequence Level for Task-aware ISP
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2604.06938