DOI:​10.1109/TIP.2018.2874289
Corpus ID: 52940605
Moving Object Detection in Complex Scene Using Spatiotemporal Structured-Sparse RPCA
S. Javed, A. Mahmood, +2 authors S. Jung
Published 2019
Computer Science, Medicine

IEEE Transactions on Image Processing
Moving object detection is a fundamental step in various computer vision applications. Robust principal component analysis (RPCA)-based methods have often been employed for this task. However, the… Expand
View On IEEE
Doi.Org
Share This Paper




55 Citations
Highly Influential Citations
2
Background Citations
21
Methods Citations
8
Figures, Tables, and Topics from this paper
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Table I
Table II
Table III
Table IV
Sparse matrix
Object detection
Algorithm
Optimization problem
Online optimization
Mathematical optimization
Computer vision
Robust principal component analysis
Augmented Lagrangian method
Graph - visual representation
Physical object
Experiment
Loss function
Numerous
Matrix regularization
Real-time clock
55 Citations
CS-RPCA: Clustered Sparse RPCA for Moving Object Detection
S. Javed, Arif Mahmood, J. Dias, N. Werghi
Computer Science
2020 IEEE International Conference on Image Processing (ICIP)
2020
TLDR
A novel objective function which computes the composite sparse component from multiple representations and it is solved using non-negative matrix factorization method and results demonstrate excellent performance of the proposed algorithm as compared to existing state-of-the-art methods. Expand
1 Citation
Moving Object Detection Based on Non-Convex RPCA With Segmentation Constraint
Zixuan Hu, Yongli Wang, Rui Su, Xinxin Bian, Hongchao Wei, G. He
Computer Science
IEEE Access

2020
TLDR
Experimental results show that the proposed non-convex rank approximate RPCA model can effectively improve the accuracy of moving object detection, and has better visual effect of foreground object detection than existed methods. Expand
2 Citations
PDF
Motion-Aware Structured Matrix Factorization for Foreground Detection in Complex Scenes
Lin Zhu, Xiurong Jiang, Jianing Li, Yuanhong Hao, Yonghong Tian
Computer Science
ACM Trans. Multim. Comput. Commun. Appl.
2021
TLDR
This work proposes a motion-aware structured matrix factorization approach (MSMF), which integrates the structural and spatiotemporal motion information into a unified sparse-low-rank matrix factorizations framework and develops an augmented Lagrange multiplier method with the alternating direction strategy and Douglas-Rachford monotone operator splitting algorithm. Expand
Hyper RPCA: Joint Maximum Correntropy Criterion and Laplacian Scale Mixture Modeling On-the-Fly for Moving Object Detection
Zerui Shao, Yi-fei Pu, Jiliu Zhou, B. Wen, Yi Zhang
Computer Science
ArXiv

2020
TLDR
A novel RPCA-based model, called Hyper RPCA, to detect moving objects on the fly that jointly applies the maximum correntropy criterion (MCC) for the modeling error, and Laplacian scale mixture (LSM) model for foreground objects. Expand
Spatiotemporally scalable matrix recovery for background modeling and moving object detection
Jingyu Yang, Wen Shi, Huanjing Yue, Kun Li, J. Ma, Chunping Hou
Computer Science
Signal Process.

2020
TLDR
A unified framework called spatiotemporally scalable matrix recovery (SSMR), which has a moderate computational and space complexity scalable to temporal and spatial resolution of videos, and a pyramidal scheme to achieve spatial scalability for high definition videos.Expand
2 Citations
Complete Moving Object Detection in the Context of Robust Subspace Learning
M. Sultana, Arif Mahmood, T. Bouwmans, S. Jung
Computer Science
2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)
2019
TLDR
This work proposes a conditional Generative Adversarial Network (cGAN) conditioned on non-occluded moving object pixels during training that learns the subspace spanned by the moving objects covering all the dynamic variations and semantic information.Expand
2 Citations
PDF
Detecting moving objects from dynamic background combining subspace learning with mixed norm approach
Yuqiu Lu, Jingjing Liu, +4 authors Hui Chen
Computer Science
Multimedia Tools and Applications
2020
TLDR
The proposed approach outperforms the existing state-of-the-art approaches, particularly for the cases with dynamic background, which indicates the worth to integrate the subspace learning, the ℓ 2,1 mixed norm and total variation into a low-rank representation model. Expand
2 Citations
Online Structured Sparsity-Based Moving-Object Detection From Satellite Videos
Junpeng Zhang, X. Jia, J. Hu, J. Chanussot
Computer Science
IEEE Transactions on Geoscience and Remote Sensing
2020
TLDR
O-LSD reformulates the batch-based low-rank matrix decomposition with the structured sparse penalty to its equivalent framewise separable counterpart, which then defines a stochastic optimization problem for online subspace basis estimation.Expand
Moving object detection based on unified model
Anjanadevi Bondalapati, S. Bhavanam, E. Reddy
Computer Science
J. Ambient Intell. Humaniz. Comput.
2021
TLDR
The results show that the developed model has the ability to effectively identify multiple objects in the dynamic background, while the existing method has the capacity to identify only single object. Expand
Low-Rank Tensor Tracking
S. Javed, J. Dias, N. Werghi
Computer Science
2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)
2019
TLDR
This work proposes a new low-rank tensor decomposition model for robust object tracking that considers the multi-dimensional data of target particles and employs the recently proposed tensor-tensor product-based singular value decomposition and a new tensor nuclear norm to promote the intrinsic structure correlation among the target particles. Expand
2 Citations
PDF
...
1
2
3
4
...
References
SHOWING 1-10 OF 79 REFERENCES
Superpixels based Manifold Structured Sparse RPCA for Moving Object Detection
S. Javed, A. Mahmood, T. Bouwmans, Ki Jung Soon
Mathematics
2017
Moving Object Detection (MOD) is a fundamental step in various computer vision and video surveillance systems. Methods based on Robust Principal Component Analysis (RPCA) have often been used for… Expand
16 Citations
Background–Foreground Modeling Based on Spatiotemporal Sparse Subspace Clustering
S. Javed, A. Mahmood, T. Bouwmans, S. Jung
Mathematics, Medicine
IEEE Transactions on Image Processing
2017
TLDR
This work proposes to incorporate the spatial and temporal sparse subspace clustering into the robust principal component analysis (RPCA) framework and demonstrates excellent performance of the proposed algorithm for both the background estimation and foreground segmentation. Expand
80 Citations
PDF
OR-PCA with dynamic feature selection for robust background subtraction
S. Javed, Andrews Sobral, T. Bouwmans, S. Jung
Computer Science
SAC

2015
TLDR
The proposed scheme is able to build a ro-bust low-rank background model of the scene and a very nice feature selection process is designed to dynamically select a useful set of features frame by frame, according to the weighted sum of total features.Expand
27 Citations
COROLA: A Sequential Solution to Moving Object Detection Using Low-rank Approximation
M. Shakeri, Hong Zhang
Computer ScienceComput. Vis. Image Underst.
2016
TLDR
This paper presents an online sequential framework, namely contiguous outliers representation via online low-rank approximation (COROLA), to detect moving objects and learn the background model at the same time, and demonstrates the superior performance of COROLA to the existing batch and online methods in both accuracy and efficiency. Expand
48 Citations
PDF
Foreground Segmentation with Tree-Structured Sparse RPCA
Salehe Erfanian Ebadi, E. Izquierdo
Mathematics, Medicine
IEEE Transactions on Pattern Analysis and Machine Intelligence
2018
TLDR
A new method is presented in which the image sequence is assumed to be made up of the sum of a low-rank background matrix and a dynamic tree-structured sparse matrix, which reduces the dimensionality and the curse of scale that is persistent in the RPCA-based methods. Expand
Block-Sparse RPCA for Salient Motion Detection
Zhi Gao, L. Cheong, Yu-Xiang Wang
Computer Science, Medicine
IEEE Transactions on Pattern Analysis and Machine Intelligence
2014
TLDR
This work addresses all challenges of representative background subtraction techniques in a unified framework which makes little specific assumption of the background, and is able to obtain crisply defined foreground regions, and handles large dynamic background motion much better. Expand
Spatiotemporal Low-Rank Modeling for Complex Scene Background Initialization
S. Javed, A. Mahmood, T. Bouwmans, S. Jung
Mathematics, Computer Science
IEEE Transactions on Circuits and Systems for Video Technology
2018
TLDR
A spatiotemporal low-rank modeling method on dynamic video clips for estimating the robust background model and superior performance over state-of-the-art approaches is demonstrated. Expand
72 Citations
PDF
Deep learning driven blockwise moving object detection with binary scene modeling
Yaqing Zhang, Xi Li, Zhongfei Zhang, Fei Wu, Liming Zhao
Computer Science
Neurocomputing

2015
TLDR
A deep learning based block-wise scene analysis method equipped with a binary spatio-temporal scene model based on the stacked denoising autoencoder that ensures the high efficiency of moving object detection.Expand
50 Citations
Robust PCA via Principal Component Pursuit: A review for a comparative evaluation in video surveillance
T. Bouwmans, E. Zahzah
Mathematics, Computer Science
Comput. Vis. Image Underst.
2014
TLDR
This work aims to initiate a rigorous and comprehensive review of RPCA-PCP based methods for testing and ranking existing algorithms for foreground detection and investigates how these methods are solved and if incremental algorithms and real-time implementations can be achieved.Expand
348 Citations
Background Subtraction via Superpixel-Based Online Matrix Decomposition with Structured Foreground Constraints
S. Javed, S. Oh, Andrews Sobral, T. Bouwmans, S. Jung
Mathematics, Computer Science
2015 IEEE International Conference on Computer Vision Workshop (ICCVW)
2015
TLDR
This paper proposes an online single unified optimization framework for detecting foreground and learning the background model simultaneously and presents a superpixel-based matrix decomposition method together with maximum norm (max-norm) regularizations and structured sparsity constraints. Expand
49 Citations
PDF
...
1
2
3
4
...
SORT BY
Related Papers
Moving Object Detection on RGB-D Videos Using Graph Regularized Spatiotemporal RPCA
S. Javed, T. Bouwmans, M. Sultana, S. Jung
Computer ScienceICIAP Workshops
2017
Moving object detection is the fundamental step for various computer vision tasks. Many existing methods are still limit...
20 Citations
Background–Foreground Modeling Based on Spatiotemporal Sparse Subspace Clustering
S. Javed, A. Mahmood, T. Bouwmans, S. Jung
Mathematics, Medicine
IEEE Transactions on Image Processing
2017
Background estimation and foreground segmentation are important steps in many high-level vision tasks. Many existing met...
80 Citations
Show More
2/10
Abstract
Figures, Tables, and Topics
55 Citations
79 References
Related Papers
Stay Connected With Semantic Scholar
What Is Semantic Scholar?
Semantic Scholar is a free, AI-powered research tool for scientific literature, based at the Allen Institute for AI.
Learn More
About
About Us
Publishers
Beta Program
Contact
Research
Team
Datasets
Open Corpus
Supp.ai
Resources
Librarians
Tutorials
FAQ
API
Proudly built by AI2
Terms of ServicePrivacy Policy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE