• Corpus ID: 117800422

# Compressive sampling and dynamic mode decomposition

@article{Brunton2013CompressiveSA,
title={Compressive sampling and dynamic mode decomposition},
author={Steven L. Brunton and Joshua L. Proctor and J. Nathan Kutz},
journal={arXiv: Dynamical Systems},
year={2013}
}
• Published 18 December 2013
• Computer Science
• arXiv: Dynamical Systems
This work develops compressive sampling strategies for computing the dynamic mode decomposition (DMD) from heavily subsampled or output-projected data. The resulting DMD eigenvalues are equal to DMD eigenvalues from the full-state data. It is then possible to reconstruct full-state DMD eigenvectors using $\ell_1$-minimization or greedy algorithms. If full-state snapshots are available, it may be computationally beneficial to compress the data, compute a compressed DMD, and then reconstruct full…

## Figures from this paper

Nuclear norm regularised dynamic mode decomposition
• Computer Science
IET Signal Process.
• 2016
The authors propose a nuclear norm regularised DMD (NNR-DMD) algorithm that produces low-dimensional spatio-temporal modes and demonstrates the potential of this algorithm, which can obtain low- dimensional coherent structures when it is applied to coherency identification of generators in an interconnected power system.
Dynamic Mode Decomposition for Background Modeling
• Computer Science
2017 IEEE International Conference on Computer Vision Workshops (ICCVW)
• 2017
The Dynamic Mode Decomposition is a spatiotemporal matrix decomposition method capable of background modeling in video streams that integrates Fourier transforms and singular value decomposition and the quality of the resulting background model is competitive, quantified by the F-measure, recall and precision.
Optimized Dynamic Mode Decomposition via Non-Convex Regularization and Multiscale Permutation Entropy
• Computer Science
Entropy
• 2018
A novel denoising and feature extraction algorithm for multi-component coupled noisy mechanical signals is proposed based on the standard DMD algorithm, which provides a new method solving the two intractable problems above.
Compressed dynamic mode decomposition for background modeling
• Computer Science
Journal of Real-Time Image Processing
• 2016
The dynamic mode decomposition is a regression technique that integrates two of the leading data analysis methods in use today: Fourier transforms and singular value decomposition and the quality of the resulting background model is competitive, quantified by the F-measure, recall and precision.
Projection assisted Dynamic Mode Decomposition of large scale data
• Computer Science
• 2020
An optimized version of DMD is designed that utilizes time delay coordinates and a projection matrix that is inspired by the Krylov subspace and the other promotes and leverages sparsity to bring computational benefits in producing a model.
Dynamic Mode Decomposition with Control
• Engineering
SIAM J. Appl. Dyn. Syst.
• 2016
This work develops a new method which extends dynamic mode decomposition (DMD) to incorporate the effect of control to extract low-order models from high-dimensional, complex systems and provides the additional innovation of being able to disambiguate between the underlying dynamics and the effects of actuation, resulting in accurate input-output models.
Randomized model order reduction
• Computer Science
• 2019
The aim of this work is to provide an efficient computation of low-rank POD and/or DMD modes via randomized matrix decompositions via randomized singular value decomposition (rSVD) which is a fast and accurate alternative of the SVD.
Compressed Dynamic Mode Decomposition for Real-Time Object Detection
• Computer Science
ArXiv
• 2015
We introduce the method of compressive dynamic mode decomposition (cDMD) for robustly performing real-time foreground/background separation in high-definition video. The DMD method provides a
Multi-Resolution Dynamic Mode Decomposition
• Computer Science
• 2015
The multi-resolution dynamic mode decomposition (mrDMD) method is demonstrated on several examples involving multi-scale dynamical data, showing excellent decomposition results, including sifting the El Ni\~no mode from ocean temperature data.
Multiresolution Dynamic Mode Decomposition
• Computer Science
SIAM J. Appl. Dyn. Syst.
• 2016
We demonstrate that the integration of the recently developed dynamic mode decomposition (DMD) with a multiresolution analysis allows for a decomposition method capable of robustly separating complex

## References

SHOWING 1-10 OF 56 REFERENCES
Compressive-Projection Principal Component Analysis
• J. Fowler
• Computer Science
IEEE Transactions on Image Processing
• 2009
CPPCA constitutes a fundamental departure from traditional PCA in that it permits its excellent dimensionality-reduction and compression performance to be realized in an light-encoder/heavy-decoder system architecture.
Compressive Acquisition of Dynamic Scenes
• Computer Science
ECCV
• 2010
A new framework for video CS for dynamic textured scenes that models the evolution of the scene as a linear dynamical system (LDS) is developed that reduces the video recovery problem to first estimating the model parameters of the LDS from compressive measurements, from which the image frames are then reconstructed.
Variants of Dynamic Mode Decomposition: Boundary Condition, Koopman, and Fourier Analyses
• Physics
J. Nonlinear Sci.
• 2012
It is shown that expansion in DMD modes is unique under certain conditions, and an “optimized” DMD is introduced that computes an arbitrary number of dynamical modes from a data set and is superior at calculating physically relevant frequencies, and is less numerically sensitive.
Sketched SVD: Recovering Spectral Features from Compressive Measurements
• Computer Science
ArXiv
• 2012
A streaming data model in which n sensors observe individual streams of data, presented in a turnstile model, is considered to analyze the singular value decomposition (SVD) of the matrix of data defined implicitly by the stream of updates and to obtain a streaming graph algorithm to approximate the eigenvalues and eigenvectors of the graph Laplacian in the case where the graph has low rank.
Dynamic Mode Decomposition for Real-Time Background/Foreground Separation in Video
• Computer Science
ArXiv
• 2014
The DMD method is demonstrated to work robustly in real-time with personal laptop-class computing power and without any parameter tuning, which is a transformative improvement in performance that is ideal for video surveillance and recognition applications.
On dynamic mode decomposition: Theory and applications
• Computer Science
• 2014
A theoretical framework in which dynamic mode decomposition is defined as the eigendecomposition of an approximating linear operator, which generalizes DMD to a larger class of datasets, including nonsequential time series, and shows that under certain conditions, DMD is equivalent to LIM.
Low-rank and sparse dynamic mode decomposition
• Computer Science
• 2012
In order to strike a balance between the quality of approximation (in the least-squares sense) and the number of modes that are used to approximate the given fields, this brief develops low-rank and sparsity-promoting versions of the standard DMD algorithm.
Model-Based Compressive Sensing
• Computer Science
IEEE Transactions on Information Theory
• 2010
A model-based CS theory is introduced that parallels the conventional theory and provides concrete guidelines on how to create model- based recovery algorithms with provable performance guarantees and a new class of structured compressible signals along with a new sufficient condition for robust structured compressable signal recovery that is the natural counterpart to the restricted isometry property of conventional CS.
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Computer Science
Commun. ACM
• 2010
This extended abstract describes a recent algorithm, called, CoSaMP, that accomplishes the data recovery task and was the first known method to offer near-optimal guarantees on resource usage.
Invariance of principal components under low-dimensional random projection of the data
• Computer Science
2012 19th IEEE International Conference on Image Processing
• 2012
Under certain conditions, normal principal component analysis on such low-dimensional random projections of data actually returns the same result as PCA on the original data set would, even if the dimension of each random subspace used is very low.