Decomposition into low-rank plus additive matrices for background/foreground separation: A review for a comparative evaluation with a large-scale dataset
Background/foreground separation is the first step in video surveillance system to detect
moving objects. Recent research on problem formulations based on decomposition into low …
moving objects. Recent research on problem formulations based on decomposition into low …
Robust PCA via principal component pursuit: A review for a comparative evaluation in video surveillance
Foreground detection is the first step in video surveillance system to detect moving objects.
Recent research on subspace estimation by sparse representation and rank minimization …
Recent research on subspace estimation by sparse representation and rank minimization …
Global convergence of ADMM in nonconvex nonsmooth optimization
In this paper, we analyze the convergence of the alternating direction method of multipliers
(ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, ϕ (x_0 …
(ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, ϕ (x_0 …
Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
The alternating direction method of multipliers (ADMM) is widely used to solve large-scale
linearly constrained optimization problems, convex or nonconvex, in many engineering …
linearly constrained optimization problems, convex or nonconvex, in many engineering …
Tensor factorization for low-rank tensor completion
Recently, a tensor nuclear norm (TNN) based method was proposed to solve the tensor
completion problem, which has achieved state-of-the-art performance on image and video …
completion problem, which has achieved state-of-the-art performance on image and video …
Unified embedding alignment with missing views inferring for incomplete multi-view clustering
Multi-view clustering aims to partition data collected from diverse sources based on the
assumption that all views are complete. However, such prior assumption is hardly satisfied …
assumption that all views are complete. However, such prior assumption is hardly satisfied …
Detecting false data injection attacks on power grid by sparse optimization
State estimation in electric power grid is vulnerable to false data injection attacks, and
diagnosing such kind of malicious attacks has significant impacts on ensuring reliable …
diagnosing such kind of malicious attacks has significant impacts on ensuring reliable …
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
The matrix completion problem is to recover a low-rank matrix from a subset of its entries.
The main solution strategy for this problem has been based on nuclear-norm minimization …
The main solution strategy for this problem has been based on nuclear-norm minimization …
Design of optimal sparse feedback gains via the alternating direction method of multipliers
We design sparse and block sparse feedback gains that minimize the variance amplification
(ie, the H 2 norm) of distributed systems. Our approach consists of two steps. First, we …
(ie, the H 2 norm) of distributed systems. Our approach consists of two steps. First, we …
Robust low-rank tensor recovery: Models and algorithms
Robust tensor recovery plays an instrumental role in robustifying tensor decompositions for
multilinear data analysis against outliers, gross corruptions, and missing values and has a …
multilinear data analysis against outliers, gross corruptions, and missing values and has a …