RANSAC Algorithms for Subspace Recovery and Subspace Clustering

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).

Cited by in corpus (1)

• Robust Subspace Recovery with Adversarial Outliers