Search Results for author:
Found 6 papers, 1 papers with code
Accelerated Randomized Mirror Descent Algorithms For Composite Non-strongly Convex Optimization
Avoiding this devise, we propose an accelerated randomized mirror descent method for solving this problem without the strongly convex assumption.
Adaptive Nonparametric Image Parsing
Instead of fixing $k$ as in traditional non-parametric approaches, here we propose a novel adaptive nonparametric approach which determines the sample-specific k for each test image.
Connections Between Nuclear Norm and Frobenius Norm Based Representations
A lot of works have shown that frobenius-norm based representation (FNR) is competitive to sparse representation and nuclear-norm based representation (NNR) in numerous tasks such as subspace clustering.
Optimized Projection for Sparse Representation Based Classification
Dimensionality reduction (DR) methods have been commonly used as a principled way to understand the high-dimensional data such as facial images.
Robust and Efficient Subspace Segmentation via Least Squares Regression
If the subspaces from which the data drawn are independent or orthogonal, they are able to obtain a block diagonal affinity matrix, which usually leads to a correct segmentation.
Robust Face Recognition via Adaptive Sparse Representation
Sparse Representation (or coding) based Classification (SRC) has gained great success in face recognition in recent years.
