Fetching the paper…
Reading the bibliography…
We assume data sampled from a mixture of d-dimensional linear subspaces with spherically symmetric distributions within each subspace and an additional outlier component with spherically symmetric distribution within the ambient space (for simplicity we may assume that all distributions are uniform on their corresponding unit spheres).
The minimum in the gamma function
W. E. Deming and C. G. Colcord · 1935
Earlier work this paper cites.
Differential geometry of Grassmann manifolds
Y.-C. Wong · 1967
Earlier work this paper cites.
The method of least squares and some alternatives. I
H. L. Harter · 1974
Earlier work this paper cites.
The method of least squares and some alternatives: Part ii
H. L. Harter · 1974
Earlier work this paper cites.
Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography
M. Fischler and R. Bolles · 1981
Earlier work this paper cites.
The finite-dimensional basis problem with an appendix on nets of Grassmann manifolds
S. J. Szarek · 1983
Earlier work this paper cites.
An analysis of the total approximation problem in separable norms, and an algorithm for the total l 1 l_{1} problem
M. R. Osborne and G. A. Watson · 1985
Earlier work this paper cites.
An introduction to L 1 L_{1} -norm based statistical data analysis
Y. Dodge · 1987
Earlier work this paper cites.
Robust regression and outlier detection
P. J. Rousseeuw and A. M. Leroy · 1987
Earlier work this paper cites.
On orthogonal linear approximation
H. Späth and G. A. Watson · 1987
Earlier work this paper cites.
Least orthogonal absolute deviations
H. Nyquist · 1988
Earlier work this paper cites.
Singular integrals and rectifiable sets in ℝ n \mathbb{R}^{n} : au-delà des graphes Lipschitziens
G. David and S. Semmes · 1991
Earlier work this paper cites.
Orthogonal linear regression algorithm based on augmented matrix formulation
A. Bargiela and J. K. Hartley · 1993
Earlier work this paper cites.
Geometry of Sets and Measures in Euclidean Spaces
P. Mattila · 1995
Earlier work this paper cites.
Matrix Computations
G. Golub and C. V. Loan · 1996
Earlier work this paper cites.
Metric entropy of homogeneous spaces
S. J. Szarek · 1998
Earlier work this paper cites.
Robust computation and parametrization of multiple view relations
P. H. S. Torr and A. Zisserman · 1998
Cited alongside, same era.
The geometry of algorithms with orthogonality constraints
A. Edelman, T. A. Arias, and S. T. Smith · 1999
Cited alongside, same era.
Robust principal component analysis for functional data
N. Locantore, J. Marron, D. Simpson, N. Tripoli, J. Zhang, K. Cohen, G. Boente, R. Fraiman, B. Brumback, C. Croux, J. Fan, A. Kneip, J. Marden, and D. P · 1999
Cited alongside, same era.
MLESAC: A new robust estimator with application to estimating image geometry
P. H. S. Torr and A. Zisserman · 2000
Cited alongside, same era.
Some Problems in Orthogonal Distance and Non-Orthogonal Distance Regression
G. A. Watson · 2001
Cited alongside, same era.
On the gauss-newton method for l 1 l_{1} orthogonal distance regression
G. A. Watson · 2002
Robust statistics
P. J. Huber and E. Ronchetti · 2009
Later among the works it cites.
Median K K -flats for hybrid linear modeling with many outliers
T. Zhang, A. Szlam, and G. Lerman · 2009
Later among the works it cites.
Robust pca via outlier pursuit
H. Xu, C. Caramanis, and S. Sanghavi · 2010
Closest in time.
Randomized hybrid linear modeling by local best-fit flats
T. Zhang, A. Szlam, Y. Wang, and G. Lerman · 2010
Closest in time.
Spectral clustering based on local linear approximations
E. Arias-Castro, G. Chen, and G. Lerman · 2011
Closest in time.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Closest in time.
Robust recovery of multiple subspaces by geometric l p {{l_{p}}} minimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Connect the dots: how many random points can a regular curve pass through?
E. Arias-Castro, D. L. Donoho, X. Huo, and C. A. Tovey · 2005
Cited alongside, same era.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
E. J. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Stable signal recovery from incomplete and inaccurate measurements
E. J. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
R1-PCA: rotational invariant L 1 {L}_{1} -norm principal component analysis for robust subspace factorization
C. Ding, D. Zhou, X. He, and H. Zha · 2006
Cited alongside, same era.
For most large underdetermined systems of equations, the minimal l 1 l_{1} -norm near-solution approximates the sparsest near-solution
D. L. Donoho · 2006
Cited alongside, same era.
For most large underdetermined systems of linear equations the minimal l 1 l_{1} -norm solution is also the sparsest solution
D. L. Donoho · 2006
Cited alongside, same era.
G. Lerman and T. Zhang · 2011
Closest in time.
Two proposals for robust PCA using semidefinite programming
M. McCoy and J. Tropp · 2011
Closest in time.
Robust computation of linear models, or How to find a needle in a haystack
G. Lerman, M. McCoy, J. A. Tropp, and T. Zhang · 2012
Closest in time.
A geometric analysis of subspace clustering with outliers
M. Soltanolkotabi and E. J. Candés · 2012
Closest in time.
Robust pca via outlier pursuit
H. Xu, C. Caramanis, and S. Sanghavi · 2012
Closest in time.
Hybrid linear modeling via local best-fit flats
T. Zhang, A. Szlam, Y. Wang, and G. Lerman · 2012
Closest in time.
Sparse subspace clustering: Algorithm, theory, and applications
E. Elhamifar and R. Vidal · 2013
Closest in time.
Can we reconcile robustness and efficiency in unsupervised learning?
M. Hardt and A. Moitra · 2013
Closest in time.
M. Soltanolkotabi, E. Elhamifar, and E. J. Candès · 2013
Closest in time.