In this paper a general matrix decomposition scheme as well as an element-by-clement relaxation algorithm combined with step-by -step integration method is presented for transient dynamic problems thus the finite elem...In this paper a general matrix decomposition scheme as well as an element-by-clement relaxation algorithm combined with step-by -step integration method is presented for transient dynamic problems thus the finite element method can be fromforming global stiffness matrix global mass matrix as well as solyin large scale sparse equations Theory analysis and numerical results show that the presented matrix decomposition scheme is the optimal one The presented algoithm has else physicalmeaning and can be busily applied to finite element codes展开更多
Moving target detection is one of the most basic tasks in computer vision.In conventional wisdom,the problem is solved by iterative optimization under either Matrix Decomposition(MD)or Matrix Factorization(MF)framewor...Moving target detection is one of the most basic tasks in computer vision.In conventional wisdom,the problem is solved by iterative optimization under either Matrix Decomposition(MD)or Matrix Factorization(MF)framework.MD utilizes foreground information to facilitate background recovery.MF uses noise-based weights to fine-tune the background.So both noise and foreground information contribute to the recovery of the background.To jointly exploit their advantages,inspired by two framework complementary characteristics,we propose to simultaneously exploit the advantages of these two optimizing approaches in a unified framework called Joint Matrix Decomposition and Factorization(JMDF).To improve background extraction,a fuzzy factorization is designed.The fuzzy membership of the background/foreground association is calculated during the factorization process to distinguish their contributions of both to background estimation.To describe the spatio-temporal continuity of foreground more accurately,we propose to incorporate the first order temporal difference into the group sparsity constraint adaptively.The temporal constraint is adjusted adaptively.Both foreground and the background are jointly estimated through an effective alternate optimization process,and the noise can be modeled with the specific probability distribution.The experimental results of vast real videos illustrate the effectiveness of our method.Compared with the current state-of-the-art technology,our method can usually form the clearer background and extract the more accurate foreground.Anti-noise experiments show the noise robustness of our method.展开更多
文摘In this paper a general matrix decomposition scheme as well as an element-by-clement relaxation algorithm combined with step-by -step integration method is presented for transient dynamic problems thus the finite element method can be fromforming global stiffness matrix global mass matrix as well as solyin large scale sparse equations Theory analysis and numerical results show that the presented matrix decomposition scheme is the optimal one The presented algoithm has else physicalmeaning and can be busily applied to finite element codes
基金supported in part by the National Natural Science Foundation of China (Grant No.61902106)in part by the Natural Science Foundation of Hebei Province (No.F2020202028).
文摘Moving target detection is one of the most basic tasks in computer vision.In conventional wisdom,the problem is solved by iterative optimization under either Matrix Decomposition(MD)or Matrix Factorization(MF)framework.MD utilizes foreground information to facilitate background recovery.MF uses noise-based weights to fine-tune the background.So both noise and foreground information contribute to the recovery of the background.To jointly exploit their advantages,inspired by two framework complementary characteristics,we propose to simultaneously exploit the advantages of these two optimizing approaches in a unified framework called Joint Matrix Decomposition and Factorization(JMDF).To improve background extraction,a fuzzy factorization is designed.The fuzzy membership of the background/foreground association is calculated during the factorization process to distinguish their contributions of both to background estimation.To describe the spatio-temporal continuity of foreground more accurately,we propose to incorporate the first order temporal difference into the group sparsity constraint adaptively.The temporal constraint is adjusted adaptively.Both foreground and the background are jointly estimated through an effective alternate optimization process,and the noise can be modeled with the specific probability distribution.The experimental results of vast real videos illustrate the effectiveness of our method.Compared with the current state-of-the-art technology,our method can usually form the clearer background and extract the more accurate foreground.Anti-noise experiments show the noise robustness of our method.