Compressed Dynamic Mode Decomposition for Background Modeling
N. Benjamin Erichson, Steven L. Brunton, J. Nathan Kutz

TL;DR
This paper presents compressed dynamic mode decomposition (cDMD), a novel method for efficient background modeling in videos that reduces computational load by working on compressed data representations, with competitive results and GPU acceleration.
Contribution
The paper introduces cDMD, combining compressed sensing with DMD to enable scalable, efficient background modeling on high-resolution videos.
Findings
cDMD achieves competitive background modeling quality.
The method scales with the intrinsic rank of data, not size.
GPU implementation significantly speeds up processing.
Abstract
We introduce the method of compressed dynamic mode decomposition (cDMD) for background modeling. The dynamic mode decomposition (DMD) is a regression technique that integrates two of the leading data analysis methods in use today: Fourier transforms and singular value decomposition. Borrowing ideas from compressed sensing and matrix sketching, cDMD eases the computational workload of high resolution video processing. The key principal of cDMD is to obtain the decomposition on a (small) compressed matrix representation of the video feed. Hence, the cDMD algorithm scales with the intrinsic rank of the matrix, rather then the size of the actual video (data) matrix. Selection of the optimal modes characterizing the background is formulated as a sparsity-constrained sparse coding problem. Our results show, that the quality of the resulting background model is competitive, quantified by the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
