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

Cartoon and texture decomposition for color image in opponent color space

Author

Listed:
  • Wen, You-Wei
  • Zhao, Mingchao
  • Ng, Michael

Abstract

The Meyer model has been successfully applied to decompose cartoon component and texture component for the gray scale image, where the total variation (TV) norm and the G-norm are respectively modeled to capture the cartoon component and the texture component in an energy minimization method. In this paper, we extend this model to the color image in the opponent color space, which is closer to human perception than the RGB space. It is important to extend the TV norm and the G-norm correspondingly because the color image is viewed as a vector-valued vector. We introduce the definition of the L1 norm and L∞ norm for the vector-valued vector and accordingly define the TV norm and the G-norm for the color image. In order to handle the numerical difficulty caused by the non-differentiability of the TV norm and G-norm, the dual formulations are used to represent these norm. Then the decomposition problem is reformulated into a minimax problem. A first-order primal-dual algorithm is readily applied to compute the saddle point of the minimax problem. Numerical results are shown the performance of the proposed model.

Suggested Citation

  • Wen, You-Wei & Zhao, Mingchao & Ng, Michael, 2022. "Cartoon and texture decomposition for color image in opponent color space," Applied Mathematics and Computation, Elsevier, vol. 414(C).
    • Handle: RePEc:eee:apmaco:v:414:y:2022:i:c:s0096300321007384
    DOI: 10.1016/j.amc.2021.126654
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321007384
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126654?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 search for a different version of it.

    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:414:y:2022:i:c:s0096300321007384. 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.