IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v329y2018icp251-265.html
   My bibliography  Save this article

An adaptive algorithm for TV-based model of three norms Lq(q=12,1,2) in image restoration

Author

Listed:
  • Chang, Qianshun
  • Che, Zengyan

Abstract

In this paper, we present an adaptive method for the TV-based model of three norms Lq(q=12,1,2) for the image restoration problem. The algorithm with the L2 norm is used in the smooth regions, where the value of |∇u| is small. The algorithm with the L12 norm is applied for the jumps, where the value of |∇u| is large. When the value of |∇u| is moderate, the algorithm with the L1 norm is employed. Thus, the three algorithms are applied for different regions of a given image such that the advantages of each algorithm are adopted. The numerical experiments demonstrate that our adaptive algorithm can not only keep the original edge and original detailed information but also weaken the staircase phenomenon in the restored images. Specifically, in contrast to the L1 norm as in the Rudin–Osher–Fatemi model, the L2 norm yields better results in the smooth and flat regions, and the L12 norm is more suitable in regions with strong discontinuities. Therefore, our adaptive algorithm is efficient and robust even for images with large noises.

Suggested Citation

  • Chang, Qianshun & Che, Zengyan, 2018. "An adaptive algorithm for TV-based model of three norms Lq(q=12,1,2) in image restoration," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 251-265.
    • Handle: RePEc:eee:apmaco:v:329:y:2018:i:c:p:251-265
    DOI: 10.1016/j.amc.2018.01.040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318300614
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.01.040?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

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • L12 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Monopoly; Monopolization Strategies
    • L2 - Industrial Organization - - Firm Objectives, Organization, and Behavior

    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:apmaco:v:329:y:2018:i:c:p:251-265. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.