2016
DOI: 10.1137/15m1023543
|View full text |Cite
|
Sign up to set email alerts
|

Multiresolution Dynamic Mode Decomposition

Abstract: We demonstrate that the integration of the recently developed dynamic mode decomposition (DMD) with a multi-resolution analysis allows for a decomposition method capable of robustly separating complex systems into a hierarchy of multi-resolution time-scale components. A one-level separation allows for background (low-rank) and foreground (sparse) separation of dynamical data, or robust principal component analysis. The multi-resolution dynamic mode decomposition is capable of characterizing nonlinear dynamical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
186
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 333 publications
(206 citation statements)
references
References 25 publications
1
186
0
Order By: Relevance
“…A remarkable feature of the DMD algorithm is its modularity for mathematical enhancements. Specifically, the DMD algorithm can be engineered to exploit sparse sampling [61,62], it can be modified to handle inputs and actuation [71], it can be used to more accurately approximate the Koopman operator when using judiciously chosen functions of the state-space [72], it can be easily made computationally scalable [73], and it can easily decompose data into multiscale temporal features in order to produce a multi-resolution DMD (mrDMD) decomposition [74]. Few mathematical architectures are capable of seamlessly integrating such diverse modifications of the dynamical system.…”
Section: Dmd: Dynamic Mode Decompositionmentioning
confidence: 99%
“…A remarkable feature of the DMD algorithm is its modularity for mathematical enhancements. Specifically, the DMD algorithm can be engineered to exploit sparse sampling [61,62], it can be modified to handle inputs and actuation [71], it can be used to more accurately approximate the Koopman operator when using judiciously chosen functions of the state-space [72], it can be easily made computationally scalable [73], and it can easily decompose data into multiscale temporal features in order to produce a multi-resolution DMD (mrDMD) decomposition [74]. Few mathematical architectures are capable of seamlessly integrating such diverse modifications of the dynamical system.…”
Section: Dmd: Dynamic Mode Decompositionmentioning
confidence: 99%
“…Even though the low-rank and sparse representations of an image sequence have been reported for DMD [7,12], the method that we propose here is essentially different. In [7], the authors exploit the low-rank and sparse representation within each frame.…”
Section: Contributionsmentioning
confidence: 99%
“…Specifically, low rank revealing the background and sparse presenting the foreground of that particular frame. Recently, in [12] DMD with a multi-resolution approach (MR-DMD) decomposed video streams into multi-time scale features and objects. The MR-DMD approach is similar to that of applying standard DMD technique at several resolutions after discarding the slow varying modes (background modes or the most significant modes).…”
Section: Contributionsmentioning
confidence: 99%
See 2 more Smart Citations