Multi-Task low-rank and sparse matrix recovery for human motion segmentation

Author(s):  
Xiangyang Wang ◽  
Wanggen Wan ◽  
Guangcan Liu
Author(s):  
Sampurna Biswas ◽  
Sunrita Poddar ◽  
Soura Dasgupta ◽  
Raghuraman Mudumbai ◽  
Mathews Jacob

2019 ◽  
Vol 28 (2) ◽  
pp. 1023-1034 ◽  
Author(s):  
Lichen Wang ◽  
Zhengming Ding ◽  
Yun Fu

2014 ◽  
Vol 635-637 ◽  
pp. 1056-1059 ◽  
Author(s):  
Bao Yan Wang ◽  
Xin Gang Wang

Key and difficult points of background subtraction method lie in looking for an ideal background modeling under complex scene. Stacking the individual frames as columns of a big matrix, background parts can be viewed as a low-rank background matrix because of large similarity among individual frames, yet foreground parts can be viewed as a sparse matrix as foreground parts play a small role in individual frames. Thus the process of video background modeling is in fact a process of low-rank matrix recovery. Background modeling based on low-rank matrix recovery can separate foreground images from background at the same time without pre-training samples, besides, the approach is robust to illumination changes. However, there exist some shortcomings in background modeling based on low-rank matrix recovery by analyzing numerical experiments, which is developed from three aspects.


2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Qingshan You ◽  
Qun Wan ◽  
Haiwen Xu

The principal component prsuit with reduced linear measurements (PCP_RLM) has gained great attention in applications, such as machine learning, video, and aligning multiple images. The recent research shows that strongly convex optimization for compressive principal component pursuit can guarantee the exact low-rank matrix recovery and sparse matrix recovery as well. In this paper, we prove that the operator of PCP_RLM satisfies restricted isometry property (RIP) with high probability. In addition, we derive the bound of parameters depending only on observed quantities based on RIP property, which will guide us how to choose suitable parameters in strongly convex programming.


2013 ◽  
Vol 49 (1) ◽  
pp. 35-36 ◽  
Author(s):  
Dai‐Qiang Chen ◽  
Li‐Zhi Cheng

Sign in / Sign up

Export Citation Format

Share Document