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

Multi-stage convex relaxation method for low-rank and sparse matrix separation problem

Author

Listed:
  • Han, Le
  • Zhang, Qin

Abstract

The low-rank and sparse matrix separation problem, recovering a low-rank matrix and a sparse matrix from a small number of linear observations, has arisen in a broad set of applications. The desire for efficiency motivated the research on it, however, most of them focus on the nuclear norm plus ℓ1-norm minimization problem, which is a single convex relaxation of the low-rank and sparse matrix separation problem. This paper is devoted to investigate a multi-stage convex relaxation method to recover the low-rank and sparse components via solving a sequence of convex relaxations, while the first stage of the method includes the nuclear norm plus ℓ1-norm minimization problem. Numerical studies indicate that the multi-stage convex relaxation outperforms the one-stage convex relaxation, especially when observations are incomplete and noisy. We have also verified the efficiency of the proposed method by applying it to the static background extraction from surveillance video.

Suggested Citation

  • Han, Le & Zhang, Qin, 2016. "Multi-stage convex relaxation method for low-rank and sparse matrix separation problem," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 175-184.
    • Handle: RePEc:eee:apmaco:v:284:y:2016:i:c:p:175-184
    DOI: 10.1016/j.amc.2016.03.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316301849
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.03.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 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:284:y:2016:i:c:p:175-184. 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.