RANSAC Algorithms for Subspace Recovery and Subspace Clustering
classification
🧮 math.ST
stat.COstat.TH
keywords
subspacesomeclusteringransacrecoveryalgorithmalgorithmschen
read the original abstract
We consider the RANSAC algorithm in the context of subspace recovery and subspace clustering. We derive some theory and perform some numerical experiments. We also draw some correspondences with the methods of Hardt and Moitra (2013) and Chen and Lerman (2009b).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.