Orthogonal matching pursuit (OMP) has gained remarkable achievements in the domain of Sparse Subspace Clustering (SSC) for image clustering. However, current methods based on OMP improves the clustering accuracy by adding additional operations, which increase computational complexity. In this paper, a novel SSC algorithm with one-way selective orthogonal matching pursuit (SSC-OWSOMP) is proposed to improve the clustering accuracy without increasing the computational complexity in the SSC-OMP-based methods. In our SSC-OWSOMP, a one-way selective module is designed to avoid mutual selection among data points, which can enrich the information used for clustering without adding additional operations. Experimental results demonstrate that, with the SSC-OWSOMP, not only the clustering accuracy can be improved but also the time complexity be kept, also the SSC-OWSOMP is suitable for the data sets with high sample density.
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.