Robust low rank dynamic mode decomposition for compressed domain crowd and traffic flow analysis

Author(s):  
Caglayan Dicle ◽  
Hassan Mansour ◽  
Dong Tian ◽  
Mouhacine Benosman ◽  
Anthony Vetro
Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3461 ◽  
Author(s):  
Jingwei Yin ◽  
Bing Liu ◽  
Guangping Zhu ◽  
Zhinan Xie

It is challenging to detect a moving target in the reverberant environment for a long time. In recent years, a kind of method based on low-rank and sparse theory was developed to study this problem. The multiframe data containing the target echo and reverberation are arranged in a matrix, and then, the detection is achieved by low-rank and sparse decomposition of the data matrix. In this paper, we introduce a new method for the matrix decomposition using dynamic mode decomposition (DMD). DMD is usually used to calculate eigenmodes of an approximate linear model. We divided the eigenmodes into two categories to realize low-rank and sparse decomposition such that we detected the target from the sparse component. Compared with the previous methods based on low-rank and sparse theory, our method improves the computation speed by approximately 4–90-times at the expense of a slight loss of detection gain. The efficient method has a big advantage for real-time processing. This method can spare time for other stages of processing to improve the detection performance. We have validated the method with three sets of underwater acoustic data.


2018 ◽  
Vol 19 (8) ◽  
pp. 2675-2685 ◽  
Author(s):  
Zhi Gao ◽  
Ruifang Zhai ◽  
Pengfei Wang ◽  
Xu Yan ◽  
Hailong Qin ◽  
...  

Author(s):  
Patrick Héas ◽  
Cédric Herzet

The state-of-the-art algorithm known as kernel-based dynamic mode decomposition (K-DMD) provides a sub-optimal solution to the problem of reduced modeling of a dynamical system based on a finite approximation of the Koopman operator. It relies on crude approximations and on restrictive assumptions. The purpose of this work is to propose a kernel-based algorithm solving exactly this low-rank approximation problem in a general setting.


Sign in / Sign up

Export Citation Format

Share Document