Subspace clustering methods have been used for unsupervised learning and Sparse Subspace Clustering (SSC) is one of the most popular methods. Since ℓ1 optimization in SSC requires complex calculation, Orthogonal Matching Pursuit (OMP) is adopted in OMP-SSC to reduce calculation time, but its performance is unsatisfactory. In this paper, a new algorithm, Orthogonal Matching Pursuit with Adaptive Restriction for Sparse Subspace Clustering (OMPAR-SSC) is proposed, in which two adaptive restrictions varying with the strength or density of connections are developed. Our algorithm can improve the connectivity of the affinity graph and enhance the segmentation effect. Experiments on both synthetic data and real-world data also demonstrate that OMPAR-SSC outperforms other subspace clustering algorithms in terms of accuracy and achieves a good trade-off between efficiency and effectiveness.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.