The reviewed record of science sign in
Pith

arxiv: 2012.05609 · v1 · pith:6MDVPCPT · submitted 2020-12-10 · cs.CV

Retinex-inspired Unrolling with Cooperative Prior Architecture Search for Low-light Image Enhancement

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:6MDVPCPTrecord.jsonopen to challenge →

classification cs.CV
keywords low-lightenhancementruasarchitectureimagesearchcomputationalconstruct
0
0 comments X
read the original abstract

Low-light image enhancement plays very important roles in low-level vision field. Recent works have built a large variety of deep learning models to address this task. However, these approaches mostly rely on significant architecture engineering and suffer from high computational burden. In this paper, we propose a new method, named Retinex-inspired Unrolling with Architecture Search (RUAS), to construct lightweight yet effective enhancement network for low-light images in real-world scenario. Specifically, building upon Retinex rule, RUAS first establishes models to characterize the intrinsic underexposed structure of low-light images and unroll their optimization processes to construct our holistic propagation structure. Then by designing a cooperative reference-free learning strategy to discover low-light prior architectures from a compact search space, RUAS is able to obtain a top-performing image enhancement network, which is with fast speed and requires few computational resources. Extensive experiments verify the superiority of our RUAS framework against recently proposed state-of-the-art methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. WING: A Simple Windowed Nonorthogonalized Initial Guess Procedure for Repeated Matrix Solves

    math.NA 2026-06 unverdicted novelty 5.0

    WING modifies Fischer's algorithm by skipping orthogonalization and using pseudoinverse to form low-cost initial guesses for repeated linear solves with the same matrix.