Robust Dual-Graph Regularized Moving Object Detection
Not on the map. Why?
Abstract (arXiv)
Moving object detection and its associated background-foreground separation have been widely used in a lot of applications, including computer vision, transportation and surveillance. Due to the presence of the static background, a video can be naturally decomposed into a low-rank background and a sparse foreground. Many regularization techniques, such as matrix nuclear norm, have been imposed on the background. In the meanwhile, sparsity or smoothness based regularizations, such as total variation and ℓ1, can be imposed on the foreground. Moreover, graph Laplacians are further imposed to capture the complicated geometry of background images. Recently, weighted regularization techniques including the weighted nuclear norm regularization have been proposed in the image processing community to promote adaptive sparsity while achieving efficient performance. In this paper, we propose a robust dual-graph regularized moving object detection model based on the weighted nuclear norm regularization, which is solved by the alternating direction method of multipliers (ADMM). Numerical experiments on body movement data sets have demonstrated the effectiveness of this method in separating moving objects from background, and the great potential in robotic applications.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 4 of its 17 references that are in the map. First posted on arXiv 25 Apr 2022.
Builds on
4 of 17 references.
References · 4
- 2015Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Datasetcited by 13
- 2014A variational approach to stable principal component pursuitcited by 8
- 2020A Novel Regularization Based on the Error Function for Sparse Recoverycited by 8
- 2017Adapting Regularized Low Rank Models for Parallel Architecturescited by 3
Built on by
Not cited yet.