6 citations · 21 across the 11 of their papers we have counts for
5 papers · 1 filter
Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces
Chong You, Chi Li, Daniel P. Robinson +1
Finding a small set of representatives from an unlabeled dataset is a core problem in a broad range of applications such as dataset summarization and information extraction. Classi…
Is an Affine Constraint Needed for Affine Subspace Clustering?
Chong You, Chun-Guang Li, Daniel P. Robinson +1
Subspace clustering methods based on expressing each data point as a linear combination of other data points have achieved great success in computer vision applications such as mot…
Basis Pursuit and Orthogonal Matching Pursuit for Subspace-preserving Recovery: Theoretical Analysis
Daniel P. Robinson, Rene Vidal, Chong You
Given an overcomplete dictionary and a signal for some sparse vector whose nonzero entries correspond to linearly independent columns of , classical sparse…
Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms
Zhihui Zhu, Yifan Wang, Daniel P. Robinson +3
Recent methods for learning a linear subspace from data corrupted by outliers are based on convex and nuclear norm optimization and require the dimension of the subspace a…
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
Chong You, Chun-Guang Li, Daniel P. Robinson +1
State-of-the-art subspace clustering methods are based on expressing each data point as a linear combination of other data points while regularizing the matrix of coefficients with…