2017
DOI: 10.1016/j.engappai.2017.05.013
|View full text |Cite
|
Sign up to set email alerts
|

Efficient local monitoring approach for the task of background subtraction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 61 publications
0
4
0
Order By: Relevance
“…The video frames were also manually annotated at every 5 seconds throughout the sequence. One published work that uses this dataset to improve the performance of the background subtraction algorithm in complicated video scenes is [131].…”
Section: B Rgb-d Rigid Multi-body Datasetmentioning
confidence: 99%
“…The video frames were also manually annotated at every 5 seconds throughout the sequence. One published work that uses this dataset to improve the performance of the background subtraction algorithm in complicated video scenes is [131].…”
Section: B Rgb-d Rigid Multi-body Datasetmentioning
confidence: 99%
“…Moreover, it is also interesting to consider improvements of the current used models (MOG [341], codebook [187], ViBe [28], PBAS [142]). Instead of the original MOG, codebook and ViBe algorithms employed as in most of the reviewed works in this paper, several improvements of MOG [242][189] [110][404] [307][232] as well as codebook [421][321] [199][415], ViBe [152][134] [403][427] and PBAS [167] algorithms are potential usable methods for these real applications. For example, Goyal and Singhai [120] evaluated six improvements of MOG on the CDnet 2012 dataset showing that Shah et al's MOG [318] and Chen et Ellis'MOG [72] both published in 2014 achieve significantly better detection while being usable in real applications than previously published MOG algorithms, that are MOG in 1999, Adaptive GMM P1C2-MOG-92 in 2003, Zivkovic-Heijden GMM [430] in 2004, and Effective GMM [204] in 2005.…”
Section: Solved and Unsolved Challengesmentioning
confidence: 99%
“…In [28], a speed computation algorithm of object detection is proposed which first removes noisy pixels and then applies some adaptive thresholds to catch moving objects as a foreground extraction. However, based on [29]- [33], even they propose new techniques but the problem of separating noisy background pixels in an outdoor environment remains present. The proposed threshold adaptation and XOR accumulation (TAXA) algorithm works based on how much information is available that surrounds each pixel; this information can decide whether the pixel belongs to the foreground or background; the decision is made according to the novelty use of XOR-theory for crucial adaptive thresholds of statistic techniques as shown in section 3 with detail.…”
Section: Introductionmentioning
confidence: 99%