Aiming at the problems of glare interference, local overexposure and detail loss caused by artificial light sources such as vehicle lamps and street lamps in nighttime road scenes, as well as the challenges of existing glare suppression models with large parameters, high computational complexity and difficulty in deploying on edge devices, this paper proposes a lightweight glare suppression network (LGSNet) based on ghost depthwise separable convolution and Lightweight Parallel Attention. Based on the U-Net architecture, the network introduces ghost depthwise separable convolution blocks (GhostDSC) in the encoder and decoder, which generates ghost features through cheap linear transformations by exploiting feature map redundancy, significantly reducing model parameters and computational costs while maintaining feature representation ability. Meanwhile, a Lightweight Parallel Attention (LPA) module is designed in the decoder stage, which integrates channel attention and pixel attention in parallel, enhancing the network’s attention to glare regions and edge details with extremely low parameter increment to improve detail recovery accuracy. In addition, a joint loss function consisting of background loss, glare loss and reconstruction loss is constructed to collaboratively optimize glare suppression and detail preservation. Experimental results on the public Flare7K++ dataset and the self-built nighttime road glare dataset NRGD show that the proposed method has only 7.45 M parameters, much lower than standard U-Net and Uformer. It achieves competitive results on full-reference metrics such as PSNR, SSIM, LPIPS and no-reference metrics such as NIQE, BRISQUE, PIQE, and can effectively suppress various types of glare interference and restore obscured scene details. It achieves a superior trade-off between model complexity and enhancement performance, significantly reducing the parameter count and computational overhead compared to heavy baselines, thereby offering a highly efficient solution for resource-aware glare suppression tasks.
Yang et al. (Fri,) studied this question.