The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Total Variation Regularized RPCA for Irregularly Moving Object Detection Under Dynamic Background
Abstract
Moving object detection is one of the most fundamental tasks in computer vision. Many classic and contemporary algorithms work well under the assumption that backgrounds are stationary and movements are continuous, but degrade sharply when they are used in a real detection system, mainly due to: 1) the dynamic background (e.g., swaying trees, water ripples and fountains in real scenarios, as well as raindrops and snowflakes in bad weather) and 2) the irregular object movement (like lingering objects). This paper presents a unified framework for addressing the difficulties mentioned above, especially the one caused by irregular object movement. This framework separates dynamic background from moving objects using the spatial continuity of foreground, and detects lingering objects using the temporal continuity of foreground. The proposed framework assumes that the dynamic background is sparser than the moving foreground that has smooth boundary and trajectory. We regard the observed video as being made up of the sum of a low-rank static background, a sparse and smooth foreground, and a sparser dynamic background. To deal with this decomposition, i.e., a constrained minimization problem, the augmented Lagrangian multiplier method is employed with the help of the alternating direction minimizing strategy. Extensive experiments on both simulated and real data demonstrate that our method significantly outperforms the state-of-the-art approaches, especially for the cases with dynamic backgrounds and discontinuous movements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Azuma, R. T. (1997) · Presence: Teleoperators and Virtual Environments · doi:10.1162/pres.1997.6.4.355 · Cited by 10,121
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929 · cited 1×
“Updating B needs to first compute the SVD of a m × n matrix, which requires 4m2n + 8mn2 + 9n3 floating point multiplications [45], and then multiplies the shrank singular value matrix with two singular vectors matrices as shown in (9), which costs (m + n)r2 floating point operations, where r ≤ min(m, n) is the rank of…”
MethodA survey on vision-based human action recognition
Poppe, R. (2010) · Image and Vision Computing · doi:10.1016/j.imavis.2009.11.014 · Cited by 2,242
Robust object tracking with online multiple instance learning
Babenko, B., Yang, M.-H., & Belongie, S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.226 · Cited by 2,007
Cited by
Prasad, D. K., Rajan, D., Rachmawati, L., Rajabally, E., & Quek, C. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2634580 · Cited by 487
Bouwmans, T., Javed, S., Sultana, M., & Jung, S. K. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.04.024 · Cited by 396
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
Vaswani, N., Bouwmans, T., Javed, S., & Narayanamurthy, P. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2826566 · Cited by 356
Bouwmans, T., Sobral, A., Javed, S., Jung, S. K., & Zahzah, E.-H. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2016.11.001 · Cited by 267
On the Applications of Robust PCA in Image and Video Processing
Bouwmans, T., Javed, S., Zhang, H., Lin, Z., & Otazo, R. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2853589 · Cited by 255
Metadata
- Authors
- Cao, X., Yang, L., & Guo, X.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-04
- Volume
- 46
- Issue
- 4
- Pages
- 1014-1027
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2021836772
- Cited by
- 185
- References
- 4
- FWCI
- 12.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Total Variation Regularized RPCA for Irregularly Moving Object Detection Under Dynamic Background. https://app.cochat.ai/papers/10.1109/tcyb.2015.2419737
- The paper
- Cao, X., Yang, L., & Guo, X. (2016). Total Variation Regularized RPCA for Irregularly Moving Object Detection Under Dynamic Background. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2419737
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.