Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/233372
Title: Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition
Authors: Wenrui Hu;Yehui Yang;Wensheng Zhang;Yuan Xie
Year: 2017
Publisher: IEEE
Abstract: In this paper, we propose a new low-rank and sparse representation model for moving object detection. The model preserves the natural space-time structure of video sequences by representing them as three-way tensors. Then, it operates the low-rank background and sparse foreground decomposition in the tensor framework. On the one hand, we use the tensor nuclear norm to exploit the spatio-temporal redundancy of background based on the circulant algebra. On the other, we use the new designed saliently fused-sparse regularizer (SFS) to adaptively constrain the foreground with spatio-temporal smoothness. To refine the existing foreground smooth regularizers, the SFS incorporates the local spatio-temporal geometric structure information into the tensor total variation by using the 3D locally adaptive regression kernel (3D-LARK). What is more, the SFS further uses the 3D-LARK to compute the space-time motion saliency of foreground, which is combined with the l<sub>1</sub> norm and improves the robustness of foreground extraction. Finally, we solve the proposed model with globally optimal guarantee. Extensive experiments on challenging well-known data sets demonstrate that our method significantly outperforms the state-of-the-art approaches and works effectively on a wide range of complex scenarios.
URI: http://localhost/handle/Hannan/233372
volume: 26
issue: 2
More Information: 724,
737
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7740902.pdf7.3 MBAdobe PDF
Title: Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition
Authors: Wenrui Hu;Yehui Yang;Wensheng Zhang;Yuan Xie
Year: 2017
Publisher: IEEE
Abstract: In this paper, we propose a new low-rank and sparse representation model for moving object detection. The model preserves the natural space-time structure of video sequences by representing them as three-way tensors. Then, it operates the low-rank background and sparse foreground decomposition in the tensor framework. On the one hand, we use the tensor nuclear norm to exploit the spatio-temporal redundancy of background based on the circulant algebra. On the other, we use the new designed saliently fused-sparse regularizer (SFS) to adaptively constrain the foreground with spatio-temporal smoothness. To refine the existing foreground smooth regularizers, the SFS incorporates the local spatio-temporal geometric structure information into the tensor total variation by using the 3D locally adaptive regression kernel (3D-LARK). What is more, the SFS further uses the 3D-LARK to compute the space-time motion saliency of foreground, which is combined with the l<sub>1</sub> norm and improves the robustness of foreground extraction. Finally, we solve the proposed model with globally optimal guarantee. Extensive experiments on challenging well-known data sets demonstrate that our method significantly outperforms the state-of-the-art approaches and works effectively on a wide range of complex scenarios.
URI: http://localhost/handle/Hannan/233372
volume: 26
issue: 2
More Information: 724,
737
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7740902.pdf7.3 MBAdobe PDF
Title: Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition
Authors: Wenrui Hu;Yehui Yang;Wensheng Zhang;Yuan Xie
Year: 2017
Publisher: IEEE
Abstract: In this paper, we propose a new low-rank and sparse representation model for moving object detection. The model preserves the natural space-time structure of video sequences by representing them as three-way tensors. Then, it operates the low-rank background and sparse foreground decomposition in the tensor framework. On the one hand, we use the tensor nuclear norm to exploit the spatio-temporal redundancy of background based on the circulant algebra. On the other, we use the new designed saliently fused-sparse regularizer (SFS) to adaptively constrain the foreground with spatio-temporal smoothness. To refine the existing foreground smooth regularizers, the SFS incorporates the local spatio-temporal geometric structure information into the tensor total variation by using the 3D locally adaptive regression kernel (3D-LARK). What is more, the SFS further uses the 3D-LARK to compute the space-time motion saliency of foreground, which is combined with the l<sub>1</sub> norm and improves the robustness of foreground extraction. Finally, we solve the proposed model with globally optimal guarantee. Extensive experiments on challenging well-known data sets demonstrate that our method significantly outperforms the state-of-the-art approaches and works effectively on a wide range of complex scenarios.
URI: http://localhost/handle/Hannan/233372
volume: 26
issue: 2
More Information: 724,
737
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7740902.pdf7.3 MBAdobe PDF