Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction
Background subtraction refers to extracting the foreground from an observed video, and is the fundamental problem of various applications. There are two kinds of popular methods to deal with background separation, namely, robust principal component analysis (RPCA) and low-rank matrix factorization (LRMF). Nevertheless, the drawback of RPCA requires tuning penalty parameter to attain an ideal result. Compared with RPCA, the ℓ1 -norm based LRMF does not involve extra parameters tuning, but it is challenging to optimize the ℓ1 -norm based minimization because of the nonsmooth ℓ1 -norm. In addition, it becomes time-consuming to find the optimal solution. In this work, we propose to employ smooth ℓ1,ϵ -norm, an approximation of ℓ1 -norm, to tackle background subtraction. Thus, the proposed model inherits the superiority of LRMF and even becomes tractable. Then the resultant optimization problem is solved by alternating minimization and gradient descent where the step-size of the gradient descent is adaptively updated via backtracking line searching approach. The proposed method is proved to be locally convergent. Experimental results on synthetic and real-world data demonstrate that our method outperforms the state-of-the-art algorithms in terms of reconstruction loss, computational speed and hardware performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Low-Rank Matrix CompletionMatrix CompletionMatrix Factorization / DecompositionVideo Background SubtractionSimilar Papers 제목 키워드 기반
Supervised Quantile Normalization for Low Rank Matrix Factorization
Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale ac…
On the Complexity of Robust PCA and $\ell_1$-norm Low-Rank Matrix Approximation
The low-rank matrix approximation problem with respect to the component-wise $\ell_1$-norm ($\ell_1$-LRA), which is closely related to robust principal component analysis (PCA), has become a very popular tool in data min…
Supervised Quantile Normalization for Low-rank Matrix Approximation
Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale ac…
Algorithms for Approximate Subtropical Matrix Factorization
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix fac…
Dimensionality ReductionColumn $\ell_{2,0}$-norm regularized factorization model of low-rank matrix recovery and its computation
This paper is concerned with the column $\ell_{2,0}$-regularized factorization model of low-rank matrix recovery problems and its computation. The column $\ell_{2,0}$-norm of factor matrices is introduced to promote colu…
Matrix Completion