IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v250y2026icp1254-1288.html

Non-smooth image restoration via Nesterov-smoothed Bilevel Learnable Descent Algorithm

Author

Listed:
  • Khaider, Brahim
  • Laghrib, Amine
  • Hadri, Aissam
  • Afraites, Lekbir

Abstract

Image denoising is a fundamental but challenging task due to the balance between noise removal and fine detail/textural preservation. We propose a bilevel optimization framework with a novel Bilevel Learnable Descent Algorithm (BLDA) for image restoration in this paper. The model allows non-smooth fidelity terms for robust suppression of complex noises, such as impulse noise, and uses space-variant regularization weights to avoid artifacts, like staircasing. Incorporating the CNN-based regularizer into a bilevel scheme, the proposed Nesterov smoothing treats the lower-level problem non-differentiable for efficient gradient-based updates. The proposed algorithm has both convergence guarantees of the smoothed lower-level solver and also for the overall bilevel method. Experimental results on standard benchmark datasets, such as BSD68, and real-world noisy images, including a COVID-19 CT scan, demonstrate the performance of the proposed BLDA. Particularly, higher PSNR and SSIM values than existing approaches are obtained by BLDA. With PSNR improvements of about 0.3 dB over the best competing methods on benchmark data, BLDA leads to better preservation of important image structures. These results emphasize both theoretical advances of our bilevel formulation and its empirical effectiveness in challenging image denoising tasks.

Suggested Citation

  • Khaider, Brahim & Laghrib, Amine & Hadri, Aissam & Afraites, Lekbir, 2026. "Non-smooth image restoration via Nesterov-smoothed Bilevel Learnable Descent Algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 250(C), pages 1254-1288.
  • Handle: RePEc:eee:matcom:v:250:y:2026:i:c:p:1254-1288
    DOI: 10.1016/j.matcom.2026.07.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426003253
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2026.07.036?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:250:y:2026:i:c:p:1254-1288. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.