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

A two-step iterative algorithm for sparse hyperspectral unmixing via total variation

Author

Listed:
  • Wang, Jin-Ju
  • Huang, Ting-Zhu
  • Huang, Jie
  • Deng, Liang-Jian

Abstract

Sparse hyperspectral unmixing is a hot topic in the field of remote sensing. Its goal is to find an optimal spectral subset, from a large spectral library, to properly model the mixed pixels in hyperspectral images. Sparse unmixing via variable splitting augmented Lagrangian and total variation (SUnSAL-TV) incorporates a TV regularizer into sparse unmixing, achieving a promising unmixing performance. Note that, SUnSAL-TV is solved by the framework of the alternating direction method of multipliers (ADMM). In this paper, we first propose a weighted collaborative sparse unmixing via TV model, named as WCSU-TV, for hyperspectral unmixing. Then a two-step iterative strategy, based on ADMM, is designed to solve the proposed model. Its key idea is to compute the current solution by a linear combination of the results of two previous iterates, instead of only using current solution in classic ADMM. Experiments on simulated and real hyperspectral data illustrate the effectiveness of the proposed approach.

Suggested Citation

  • Wang, Jin-Ju & Huang, Ting-Zhu & Huang, Jie & Deng, Liang-Jian, 2021. "A two-step iterative algorithm for sparse hyperspectral unmixing via total variation," Applied Mathematics and Computation, Elsevier, vol. 401(C).
    • Handle: RePEc:eee:apmaco:v:401:y:2021:i:c:s0096300321001077
    DOI: 10.1016/j.amc.2021.126059
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321001077
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126059?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:401:y:2021:i:c:s0096300321001077. 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.