Efficient and robust background modeling with dynamic mode decomposition

DOI10.1007/S10851-022-01068-0OpenAlexW4213454721MaRDI QIDQ2155166FDOQ2155166

Tim Krake, Daniel Weiskopf, Bernhard Eberhardt, Andrés Bruhn

Publication date: 15 July 2022

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-022-01068-0

zbMATH Keywords

spectral decompositiondynamic mode decompositionforeground detectionbackground modeling

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Incremental principal component pursuit for video background modeling
• Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
• Title not available (Why is that?)
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
• Background modeling and foreground detection for video surveillance

Cited In (3)

• Adaptive Eigenbackground for Dynamic Background Modeling
• Optimization of the regularization in background and foreground modeling
• Title not available (Why is that?)

This page was built for publication: Efficient and robust background modeling with dynamic mode decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155166)