Subspace Segmentation by Successive Approximations: A Method for Low-Rank and High-Rank Data with Missing Entries
We propose a method to reconstruct and cluster incomplete high-dimensional data lying in a union of low-dimensional subspaces. Exploring the sparse representation model, we jointly estimate the missing data while imposing the intrinsic subspace structure. Since we have a non-convex problem, we propose an iterative method to reconstruct the data and provide a sparse similarity affinity matrix. This method is robust to initialization and achieves greater reconstruction accuracy than current methods, which dramatically improves clustering performance. Extensive experiments with synthetic and real data show that our approach leads to significant improvements in the reconstruction and segmentation, outperforming current state of the art for both low and high-rank data.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Orthogonal Multi-view Analysis by Successive Approximations via Eigenvectors
We propose a unified framework for multi-view subspace learning to learn individual orthogonal projections for all views. The framework integrates the correlations within multiple views, supervised discriminant capacity,…
General ClassificationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONSegmentation of Cardiac Structures via Successive Subspace Learning with Saab Transform from Cine MRI
Assessment of cardiovascular disease (CVD) with cine magnetic resonance imaging (MRI) has been used to non-invasively evaluate detailed cardiac structure and function. Accurate segmentation of cardiac structures from cin…
Dimensionality Reductionfeature selectionInterpretable Machine LearningPrognosis+1Distributed Low-rank Subspace Segmentation
Vision problems ranging from image clustering to motion segmentation to semi-supervised learning can naturally be framed as subspace segmentation problems, in which one aims to recover multiple low-dimensional subspaces …
ClusteringEvent DetectionFace RecognitionImage Clustering+2Point Cloud Attribute Compression via Successive Subspace Graph Transform
Inspired by the recently proposed successive subspace learning (SSL) principles, we develop a successive subspace graph transform (SSGT) to address point cloud attribute compression in this work. The octree geometry stru…
AttributeLow rank approximation and decomposition of large matrices using error correcting codes
Low rank approximation is an important tool used in many applications of signal processing and machine learning. Recently, randomized sketching algorithms were proposed to effectively construct low rank approximations an…
regression