Incremental Tensor-Based Completion Method for Detection of Stationary Foreground Objects

In tasks such as abandoned luggage detection and stopped car detection, stationary foreground objects (SFOs) need to be detected and properly classified in real time. Different methods have been proposed to detect SFOs, but they are mainly focused on certain types of objects. In this paper, an incre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems for video technology 2019-05, Vol.29 (5), p.1325-1338
Hauptverfasser: Kajo, Ibrahim, Kamel, Nidal, Ruichek, Yassine
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In tasks such as abandoned luggage detection and stopped car detection, stationary foreground objects (SFOs) need to be detected and properly classified in real time. Different methods have been proposed to detect SFOs, but they are mainly focused on certain types of objects. In this paper, an incremental singular value decomposition-based method is presented to detect all types of SFOs such as abandoned objects and removed objects. The proposed method decomposes the video tensor spatiotemporally and divides it into background and foreground components. An appropriate analysis is applied to the foreground tensor to define a pixel time series of each stationary foreground category. Such analysis leads to the fact that SFOs can be detected easily owing to their continuous persistence in the decomposed foreground tensor. Furthermore, the unique structure of the pixel time series of each category allows identifying the category of the detected objects, whether they are abandoned or removed, and detecting the exact time of the start and end of each event. The results demonstrate that the proposed method achieves a superior performance in detecting SFOs at both object and pixel levels. In addition, the proposed method is computationally simple, and its complexity is lower compared to other approaches; hence, it can adequately satisfy real-time requirements.
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2018.2841825