A Novel Efficient Approach with Data-Adaptive Capability for OMP-based Sparse Subspace Clustering

by   Jiaqiyu Zhan, et al.

Orthogonal Matching Pursuit (OMP) plays an important role in data science and its applications such as sparse subspace clustering and image processing. However, the existing OMP-based approaches lack of data adaptiveness so that the information cannot be represented well enough and may lose the accuracy. This paper proposes a novel approach to enhance the data-adaptive capability for OMP-based sparse subspace clustering. In our method a parameter selection process is developed to adjust the parameters based on the data distribution for information representation. Our theoretical analysis indicates that the parameter selection process can efficiently coordinate with any OMP-based methods to improve the clustering performance. Also a new Self-Expressive-Affinity (SEA) ratio metric is defined to measure the sparse representation conversion efficiency for spectral clustering to obtain data segmentations. Experiments show that our approach achieves better performances compared with other OMP-based sparse subspace clustering algorithms in terms of clustering accuracy, SEA ratio and representation quality, and keeps the time efficiency and anti-noise ability.



There are no comments yet.


page 1

page 2

page 3

page 4


Restricted Connection Orthogonal Matching Pursuit For Sparse Subspace Clustering

Sparse Subspace Clustering (SSC) is one of the most popular methods for ...

Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit

Subspace clustering methods based on ℓ_1, ℓ_2 or nuclear norm regulariza...

Doubly Stochastic Subspace Clustering

Many state-of-the-art subspace clustering methods follow a two-step proc...

Adaptive Affinity Matrix for Unsupervised Metric Learning

Spectral clustering is one of the most popular clustering approaches wit...

Accelerated Sparse Subspace Clustering

State-of-the-art algorithms for sparse subspace clustering perform spect...

Provable Noisy Sparse Subspace Clustering using Greedy Neighbor Selection: A Coherence-Based Perspective

Sparse subspace clustering (SSC) using greedy-based neighbor selection, ...

A novel centroid update approach for clustering-based superpixel method and superpixel-based edge detection

Superpixel is widely used in image processing. And among the methods for...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.