2020
DOI: 10.1109/access.2020.2992132
|View full text |Cite
|
Sign up to set email alerts
|

Foreground-Background Separation via Generalized Nuclear Norm and Structured Sparse Norm Based Low-Rank and Sparse Decomposition

Abstract: Low-rank and sparse decomposition (LRSD) has attracted wide attention in video foregroundbackground separation and many other fields. However, the traditional LRSD methods have many tough problems, such as the problems of the low accuracy of the surrogate functions of rank and sparsity, ignoring the spatial information of the videos and sensitivity to noise, etc. To deal with these problems, this paper proposes the generalized nuclear norm and structured sparse norm (GNNSSN) method based LRSD for video foregro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…For example, �X� * = i σ i is the nuclear norm which is the sum of its SV that σ i represents the i-th SV of the matrix X. NNM attempts to recover matrix X, actual low rank, by minimizing �X� * from degraded observation matrix Y. In recent years, NNM-based methods have been used in many applications such as video denoising [60], background extraction [61], data recovery [62] and subspace clustering [63,64]. The matrix rank can be recovered under the conditions of the limited and theoretic warranty.…”
Section: Methodsmentioning
confidence: 99%
“…For example, �X� * = i σ i is the nuclear norm which is the sum of its SV that σ i represents the i-th SV of the matrix X. NNM attempts to recover matrix X, actual low rank, by minimizing �X� * from degraded observation matrix Y. In recent years, NNM-based methods have been used in many applications such as video denoising [60], background extraction [61], data recovery [62] and subspace clustering [63,64]. The matrix rank can be recovered under the conditions of the limited and theoretic warranty.…”
Section: Methodsmentioning
confidence: 99%
“…Equation ( 3) can be solved by applying a norm threshold action on singular values of the observation matrix in the form of Equation ( 4) [11,12]:…”
Section: Proposed Methodsmentioning
confidence: 99%
“…The kernel norm is a good convex proxy for the minimization of rank functions [10]. Yang et al [11] proved that the kernel norm is the most compact convex lower bound of the rank function. And the relationship between kernel norm and matrix rank is similar to that between the L1 norm and l0 norm of the vector.…”
Section: Introductionmentioning
confidence: 99%