IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v238y2025icp25-44.html
   My bibliography  Save this article

Minimax concave penalty-based TGV model for Poissonian image restoration

Author

Listed:
  • Liu, Xinwu
  • Yu, Xiang
  • Liang, Jiangli

Abstract

As is known to all, although the denoising models based on total generalized variation regularization prevent the occurrence of staircase artifacts, they also tend to result in blurred edges in the restored images. In order to obtain high-quality images that conform human visual characteristics, we add a minimax concave penalty into the total generalized variation function, and develop a novel Kullback–Leibler divergence fidelity-based model for Poissonian image restoration. By integrating the variable splitting technique, a modified alternating direction method of multipliers is designed for numerical computation. Moreover, under proper parameter selection, the convergence of our proposed algorithm is established in detail. As the experimental validations, we have conducted a variety of numerical experiments comparing our new solver with some existing state-of-the-art methods. From the numerical experiments, it follows that our approach can not only preserve structural features well, but also achieve comparable recovery effects over other denoising schemes.

Suggested Citation

  • Liu, Xinwu & Yu, Xiang & Liang, Jiangli, 2025. "Minimax concave penalty-based TGV model for Poissonian image restoration," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 238(C), pages 25-44.
  • Handle: RePEc:eee:matcom:v:238:y:2025:i:c:p:25-44
    DOI: 10.1016/j.matcom.2025.05.001
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2025.05.001?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:238:y:2025:i:c:p:25-44. 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.