Multi-stage convex relaxation method for low-rank and sparse matrix separation problem
Le Han and
Qin Zhang
Applied Mathematics and Computation, 2016, vol. 284, issue C, 175-184
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.
Keywords: Low-rank and sparse matrix separation; Convex relaxation; Multi-stage; Nonconvex (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316301849
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:284:y:2016:i:c:p:175-184
DOI: 10.1016/j.amc.2016.03.001
Access Statistics for this article
Applied Mathematics and Computation is currently edited by Theodore Simos
More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().