Edge-guided Low-light Image Enhancement with Inertial Bregman Alternating Linearized Minimization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 72 references that are in the map. First posted on arXiv 2 Mar 2024.
Builds on
18 of 72 references.
References · 18
- 2018Deep Retinex Decomposition for Low-Light Enhancementcited by 720
- 2021R2RNet: Low-light Image Enhancement via Real-low to Real-normal Networkcited by 106
- 2023Low-Light Image Enhancement via Structure Modeling and Guidancecited by 78
- 2019Attention Guided Low-light Image Enhancement with a Large Scale Low-light Simulation Datasetcited by 65
- 2021Low-light Image Enhancement via Breaking Down the Darknesscited by 65
- 2017Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problemscited by 40
- 2017First Order Methods beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problemscited by 37
- 2021Learning Deep Context-Sensitive Decomposition for Low-Light Image Enhancementcited by 23
- 2020Dictionary Learning with Low-rank Coding Coefficients for Tensor Completioncited by 19
- 2019A Generalized Framework for Edge-preserving and Structure-preserving Image Smoothingcited by 13
- 2019Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimizationcited by 12
- 2022Low-light Image Enhancement by Retinex Based Algorithm Unrolling and Adjustmentcited by 10
6 more
- 2019Underexposed Image Correction via Hybrid Priors Navigated Deep Propagationcited by 8
- 2019A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minimacited by 6
- 2022Retinex Image Enhancement Based on Sequential Decomposition With a Plug-and-Play Frameworkcited by 5
- 2023Fast MRI Reconstruction via Edge Attentioncited by 3
- 2023Two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problemscited by 2
- 2023VDIP-TGV: Blind Image Deconvolution via Variational Deep Image Prior Empowered by Total Generalized Variationcited by 1
Built on by
Not cited yet.