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

Moving Object Detection Based on Non-Convex RPCA With Segmentation Constraint

Abstract: Recently, robust principal component analysis (RPCA) has been widely used in the detection of moving objects. However, this method fails to effectively utilize the low-rank prior information of the background and the spatiotemporal continuity prior of the moving object, and the target extraction effect is often poor when dealing with large-scale complex scenes. To solve the above problems, a new non-convex rank approximate RPCA model based on segmentation constraint is proposed. Firstly, the model adopts the l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 48 publications
(67 reference statements)
0
7
0
Order By: Relevance
“…Table 2 displays the comparison analysis of object detection with different existing methods by means of different categories in the CDNet 2014 dataset. The performance of proposed methodology is compared with existing methods like robust principal component‐principal component analysis (RPCA‐PCA), nonconvex‐RPCA (Noncvx‐RPCA), weighted nuclear norm minimization‐RPCA (WNNM‐RPCA), low rank and sparse‐matrix decomposition via the truncated nuclear norm and sparse regularizer (LRSD‐TNNSR), and non‐convex rank approximation function‐RPCA (NCSC‐RPCA) 27 . When compared with the above‐mentioned existing methodologies, our proposed design outperforms all existing methods in terms of different performance parameters like recall, precision, and F‐measure.…”
Section: Resultsmentioning
confidence: 99%
“…Table 2 displays the comparison analysis of object detection with different existing methods by means of different categories in the CDNet 2014 dataset. The performance of proposed methodology is compared with existing methods like robust principal component‐principal component analysis (RPCA‐PCA), nonconvex‐RPCA (Noncvx‐RPCA), weighted nuclear norm minimization‐RPCA (WNNM‐RPCA), low rank and sparse‐matrix decomposition via the truncated nuclear norm and sparse regularizer (LRSD‐TNNSR), and non‐convex rank approximation function‐RPCA (NCSC‐RPCA) 27 . When compared with the above‐mentioned existing methodologies, our proposed design outperforms all existing methods in terms of different performance parameters like recall, precision, and F‐measure.…”
Section: Resultsmentioning
confidence: 99%
“…In this section, we will verify the performance of the model proposed in this paper through experiments, using a combination of quantitative and qualitative methods. The algorithm in this paper was compared with GoDec [13], NC-RPCA [14], AccAltProj [44], KNN [45], LRSD-TNNSR [46] and NCSC-RPCA [47]. We mainly selected eight video…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…Then, in [50], a super-pixel based tree structure is arranged for the foreground objects detection. In 2020, super-pixel segmentation technology is allocated for the foreground objects while the background is modelled by a non-convex approximation [51].…”
Section: Spatiotemporal Solutionsmentioning
confidence: 99%