CONFERENCE PROCEEDINGS
Advanced Search
Home > Proceedings > Volume 12083 > Article
Paper
16 February 2022 Robust adaptive graph learning with manifold constraints for subspace clustering
Wei Zhou, Yugen Yi, Yuhan Peng
Author Affiliations +
Proceedings Volume 12083, Thirteenth International Conference on Graphics and Image Processing (ICGIP 2021); 1208304 (2022) https://doi.org/10.1117/12.2623254
Event: Thirteenth International Conference on Graphics and Image Processing (ICGIP 2021), 2021, Kunming, China
Abstract
Subspace clustering aims at grouping data into a number of partitions, which has become one of the most powerful tools to analyze and interpret big data, particularly for clustering high-dimensional data. Although a series of related approaches have been proposed, real data are often corrupted leading to the learned graph is inexact or unreliable. Meanwhile, constructing an informative graph is one of the most important steps, which can greatly affect the final performance of clustering approaches. To learn a robust graph, this paper presents a novel data representation approach called Robust Adaptive Graph Learning with Manifold Constraints (RAGLMC) for subspace clustering. RAGLMC introduces the l2,1-norm constraint on sparse coding coefficients for ensuring the learned coding coefficients would be optimal as adaptive graph weights. Moreover, in order to reduce the influence of noise points on the local structure in graph construction, we combine l2,1-norm with manifold constraints on the coding coefficients to learn a locality and smoothness representation. Therefore, the proposed approach can estimate the graph from data alone by using manifold constraint on coding coefficients, which is independent of a prior affinity matrix. Extensive experiments verify the effectiveness of the proposed approach over other state-of-the-art approaches.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Citation Download Citation
Wei Zhou, Yugen Yi, and Yuhan Peng "Robust adaptive graph learning with manifold constraints for subspace clustering", Proc. SPIE 12083, Thirteenth International Conference on Graphics and Image Processing (ICGIP 2021), 1208304 (16 February 2022); https://doi.org/10.1117/12.2623254
ACCESS THE FULL ARTICLE
ORGANIZATIONAL
Sign in with credentials provided by your organization.
INSTITUTIONAL
Select your institution to access the SPIE Digital Library.
SELECT YOUR INSTITUTION
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.
PERSONAL SIGN IN
No SPIE Account? Create one
PURCHASE THIS CONTENT
SUBSCRIBE TO DIGITAL LIBRARY
50 downloads per 1-year subscription
Members: $195
Non-members: $335 ADD TO CART
25 downloads per 1 - year subscription
Members: $145
Non-members: $250 ADD TO CART
PURCHASE SINGLE ARTICLE
Includes PDF, HTML & Video, when available
Members: $17.00
Non-members: $21.00 ADD TO CART
PROCEEDINGS
 9 PAGES
DOWNLOAD PAPER SAVE TO MY LIBRARY
GET CITATION
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Scientific research
RELATED CONTENT
Subscribe to Digital Library
Receive Erratum Email Alert
Back to Top