Fast and robust decomposition of a matrix representing a spatial grid through time.Rapid approximation for robust principal component analysis.Competitive performance in terms of recall and precision for motion detection.GPU accelerated implementation allows faster computation. This paper introduces a fast algorithm for randomized computation of a low-rank Dynamic Mode Decomposition (DMD) of a matrix. Here we consider this matrix to represent the development of a spatial grid through time e.g. data from a static video source. DMD was originally introduced in the fluid mechanics community, but is also suitable for motion detection in video streams and its use for background subtraction has received little previous investigation. In this study we present a comprehensive evaluation of background subtraction, using the randomized DMD and compare the results with leading robust principal component analysis algorithms. The results are convincing and show the random DMD is an efficient and powerful approach for background modeling, allowing processing of high resolution videos in real-time. Supplementary materials include implementations of the algorithms in Python.
Randomized low-rank Dynamic Mode Decomposition for motion detection
N. Benjamin Erichson,C. Donovan
Published 2015 in Computer Vision and Image Understanding
ABSTRACT
PUBLICATION RECORD
- Publication year
2015
- Venue
Computer Vision and Image Understanding
- Publication date
2015-12-11
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-44 of 44 references · Page 1 of 1
CITED BY
Showing 1-72 of 72 citing papers · Page 1 of 1