Pith. sign in

REVIEW 2 cited by

Edge-guided Low-light Image Enhancement with Inertial Bregman Alternating Linearized Minimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.01142 v2 pith:PJ6TD3GR submitted 2024-03-02 cs.CV cs.NAmath.NA

Edge-guided Low-light Image Enhancement with Inertial Bregman Alternating Linearized Minimization

classification cs.CV cs.NAmath.NA
keywords low-lightimagealgorithmmodelproposedretinexedgeedge-guided
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Prior-based methods for low-light image enhancement often face challenges in extracting available prior information from dim images. To overcome this limitation, we introduce a simple yet effective Retinex model with the proposed edge extraction prior. More specifically, we design an edge extraction network to capture the fine edge features from the low-light image directly. Building upon the Retinex theory, we decompose the low-light image into its illumination and reflectance components and introduce an edge-guided Retinex model for enhancing low-light images. To solve the proposed model, we propose a novel inertial Bregman alternating linearized minimization algorithm. This algorithm addresses the optimization problem associated with the edge-guided Retinex model, enabling effective enhancement of low-light images. Through rigorous theoretical analysis, we establish the convergence properties of the algorithm. Besides, we prove that the proposed algorithm converges to a stationary point of the problem through nonconvex optimization theory. Furthermore, extensive experiments are conducted on multiple real-world low-light image datasets to demonstrate the efficiency and superiority of the proposed scheme.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. Dynamic MRI Reconstruction Via Dual Deep Priors and Low-Rank Plus Sparse Modeling

    eess.IV 2026-05 unverdicted novelty 6.0

    Dual deep image priors for low-rank plus sparse decomposition enable training-data-free dynamic MRI reconstruction that outperforms classical and learning-based methods across acceleration factors.

  2. Fractional-gradient Sparsity with Autoencoding Sequential Deep Image Prior for 3D CT Reconstruction

    cs.CE 2026-05 unverdicted novelty 5.0

    FAST-DIP integrates input-adaptive sequential DIP with fractional-gradient sparsity regularization on z-direction gradients and provides an alternating minimization algorithm with convergence guarantees for improved 3...