Deep Subspace Clustering with Data Augmentation

2020-12-01 · NeurIPS 2020 12 · Mahdi Abavisani, Alireza Naghizadeh, Dimitris Metaxas, Vishal Patel

The idea behind data augmentation techniques is based on the fact that slight changes in the percept do not change the brain cognition. In classification, neural networks use this fact by applying transformations to the inputs to learn to predict the same label. However, in deep subspace clustering (DSC), the ground-truth labels are not available, and as a result, one cannot easily use data augmentation techniques. We propose a technique to exploit the benefits of data augmentation in DSC algorithms. We learn representations that have consistent subspaces for slightly transformed inputs. In particular, we introduce a temporal ensembling component to the objective function of DSC algorithms to enable the DSC networks to maintain consistent subspaces for random transformations in the input data. In addition, we provide a simple yet effective unsupervised procedure to find efficient data augmentation policies. An augmentation policy is defined as an image processing transformation with a certain magnitude and probability of being applied to each image in each epoch. We search through the policies in a search space of the most common augmentation policies to find the best policy such that the DSC network yields the highest mean Silhouette coefficient in its clustering results on a target dataset. Our method achieves state-of-the-art performance on four standard subspace clustering datasets.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringData Augmentation

Revisiting data augmentation for subspace clustering

2022-07-20 · Maryam Abdolali, Nicolas Gillis

Subspace clustering is the classical problem of clustering a collection of data samples that approximately lie around several low-dimensional subspaces. The current state-of-the-art approaches for this problem are based …

Clustering Data Augmentation

Neural Manifold Clustering and Embedding

2022-01-24 · Zengyi Li, Yubei Chen, Yann Lecun, Friedrich T. Sommer

Given a union of non-linear manifolds, non-linear subspace clustering or manifold clustering aims to cluster data points based on manifold structures and also learn to parameterize each manifold as a linear subspace in a…

Clustering Data Augmentation Representation Learning Self-Supervised Learning

Deep Adversarial Subspace Clustering

2018-06-01 · CVPR 2018 6 · Pan Zhou, Yunqing Hou, Jiashi Feng

Most existing subspace clustering methods hinge on self-expression of handcrafted representations and are unaware of potential clustering errors. Thus they perform unsatisfactorily on real data with complex underlying s…

Clustering Image Clustering Representation Learning

Subspace Structure-Aware Spectral Clustering for Robust Subspace Clustering

2019-10-01 · ICCV 2019 10 · Masataka Yamaguchi, Go Irie, Takahito Kawanishi, Kunio Kashino

Subspace clustering is the problem of partitioning data drawn from a union of multiple subspaces. The most popular subspace clustering framework in recent years is the graph clustering-based approach, which performs subs…

Clustering Graph Clustering graph construction

Learning Robust Subspace Clustering

2013-08-01 · Qiang Qiu, Guillermo Sapiro

We propose a low-rank transformation-learning framework to robustify subspace clustering. Many high-dimensional data, such as face images and motion sequences, lie in a union of low-dimensional subspaces. The subspace cl…

Clustering