Fetching the paper…
Reading the bibliography…
In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more.
T. Zhang, A. Szlam, Y. Wang, and G. Lerman, “Hybrid linear modeling via local best-fit flats,” in
1934
Earlier work this paper cites.
R. E. Bellman,
1957
Earlier work this paper cites.
D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite-element approximations,”
1976
Earlier work this paper cites.
M. A. Fischler and R. C. Bolles, “RANSAC random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography,”
1981
Earlier work this paper cites.
T. Boult and L. Brown, “Factorization-based segmentation of motions,” in
1991
Earlier work this paper cites.
C. Tomasi and T. Kanade, “Shape and motion from image streams under orthography,”
1992
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the LASSO,”
1996
Earlier work this paper cites.
T. Hastie and P. Simard, “Metrics and models for handwritten character recognition,”
1998
Earlier work this paper cites.
J. Costeira and T. Kanade, “A multibody factorization method for independently moving objects.”
1998
Earlier work this paper cites.
C. W. Gear, “Multibody grouping from motion images,”
1998
Earlier work this paper cites.
E. Amaldi and V. Kann, “On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems,”
1998
Earlier work this paper cites.
M. Tipping and C. Bishop, “Mixtures of probabilistic principal component analyzers,”
1999
Earlier work this paper cites.
P. Tseng, “Nearest
2000
Earlier work this paper cites.
K. Kanatani, “Motion segmentation by subspace separation and model selection,” in
2001
Earlier work this paper cites.
A. Ng, Y. Weiss, and M. Jordan, “On spectral clustering: analysis and an algorithm,” in
2001
Earlier work this paper cites.
R. Basri and D. Jacobs, “Lambertian reflection and linear subspaces,”
2003
Earlier work this paper cites.
J. Ho, M. H. Yang, J. Lim, K. Lee, and D. Kriegman, “Clustering appearances of objects under varying illumination conditions.” in
2003
Earlier work this paper cites.
L. Zelnik-Manor and M. Irani, “Degeneracies, dependencies and their implications in multi-body and multi-sequence factorization,” in
2003
Earlier work this paper cites.
D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via
2003
Earlier work this paper cites.
R. Gribonval and M. Nielsen, “Sparse representations in unions of bases,”
2003
Earlier work this paper cites.
R. Duda, P. Hart, and D. Stork,
2004
Earlier work this paper cites.
Y. Sugaya and K. Kanatani, “Geometric structure of degeneracy for multi-body motion segmentation,” in
2004
Earlier work this paper cites.
A. Gruber and Y. Weiss, “Multibody factorization with uncertainty and missing data using the EM algorithm,” in
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe,
2004
Cited alongside, same era.
R. Vidal and R. Hartley, “Motion segmentation with missing data by PowerFactorization and Generalized PCA,” in
2004
Cited alongside, same era.
R. Vidal, Y. Ma, and S. Sastry, “Generalized Principal Component Analysis (GPCA),”
2005
Cited alongside, same era.
E. Candès and T. Tao, “Decoding by linear programming,”
2005
Cited alongside, same era.
D. L. Donoho, “Neighborly polytopes and sparse solution of underdetermined linear equations,”
2005
Cited alongside, same era.
2005
Y. C. Eldar and M. Mishali, “Robust recovery of signals from a structured union of subspaces,”
2009
Later among the works it cites.
J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, “Robust face recognition via sparse representation,”
2009
Later among the works it cites.
F. Lauer and C. Schnörr, “Spectral clustering of linear subspaces for motion segmentation,” in
2009
Later among the works it cites.
S. Rao, R. Tron, R. Vidal, and Y. Ma, “Motion segmentation in the presence of outlying, incomplete, or corrupted trajectories,”
2010
Later among the works it cites.
B. Recht, M. Fazel, and P. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,”
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
W. Hong, J. Wright, K. Huang, and Y. Ma, “Multi-scale hybrid linear models for lossy image representation,”
2006
Cited alongside, same era.
J. Yan and M. Pollefeys, “A general framework for motion segmentation: Independent, articulated, rigid, non-rigid, degenerate and non-degenerate,” in
2006
Cited alongside, same era.
D. L. Donoho, “For most large underdetermined systems of linear equations the minimal
2006
Cited alongside, same era.
R. Zass and A. Shashua, “Doubly stochastic normalization for spectral clustering,”
2006
Cited alongside, same era.
J. A. Tropp., “Algorithms for simultaneous sparse approximation. part ii: Convex relaxation,”
2006
Cited alongside, same era.
A. Goh and R. Vidal, “Segmenting motions of different types by unsupervised manifold clustering,” in
2007
Cited alongside, same era.
2010
Later among the works it cites.
G. Liu, Z. Lin, and Y. Yu, “Robust subspace segmentation by low-rank representation,” in
2010
Later among the works it cites.
Y. C. Eldar, P. Kuppinger, and H. Bolcskei, “Compressed sensing of block-sparse signals: Uncertainty relations and efficient recovery,”
2010
Later among the works it cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,”
2010
Later among the works it cites.
T. Brox and J. Malik, “Object segmentation by long term analysis of point trajectories,”
2010
Later among the works it cites.
E. van den Berg and M. Friedlander, “Theoretical and empirical results for recovery from multiple measurements,”
2010
Later among the works it cites.
R. Vidal, “Subspace clustering,”
2011
Later among the works it cites.
E. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis,”
2011
Later among the works it cites.
G. Liu and S. Yan, “Latent low-rank representation for subspace segmentation and feature extraction,”
2011
Later among the works it cites.
P. Favaro, R. Vidal, and A. Ravichandran, “A closed form solution to robust subspace estimation and clustering,” in
2011
Later among the works it cites.
E. Elhamifar and R. Vidal, “Robust classification using structured sparse representation,” in
2011
Later among the works it cites.
B. Nasihatkon and R. Hartley, “Graph connectivity in sparse subspace clustering,” in
2011
Later among the works it cites.
R. Jenatton, J. Y. Audibert, and F. Bach, “Structured variable selection with sparsity-inducing norms,”
2011
Later among the works it cites.
M. Soltanolkotabi and E. J. Candes, “A geometric analysis of subspace clustering with outliers,”
2012
Closest in time.
G. Liu, Z. Lin, S. Yan, J. Sun, Y. Yu, and Y. Ma, “Robust recovery of subspace structures by low-rank representation,”
2012
Closest in time.
——, “Block-sparse recovery via convex optimization,”
2012
Closest in time.
E. Elhamifar, G. Sapiro, and R. Vidal, “See all by looking at a few: Sparse modeling for finding representative objects,” in
2012
Closest in time.