Multilinear Subspace Clustering

12/21/2015
by   Eric Kernfeld, et al.
0

In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (UOMS) model, which is a specific structured case of the much studied union of subspaces (UOS) model. For segmentation under this model, we develop Multilinear Subspace Clustering (MSC) algorithm and evaluate its performance on the YaleB and Olivietti image data sets. We show that MSC is highly competitive with existing algorithms employing the UOS model in terms of clustering performance while enjoying improvement in computational complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2014

Greedy Subspace Clustering

We consider the problem of subspace clustering: given points that lie on...
research
10/08/2020

A Critique of Self-Expressive Deep Subspace Clustering

Subspace clustering is an unsupervised clustering technique designed to ...
research
04/25/2018

RULLS: Randomized Union of Locally Linear Subspaces for Feature Engineering

Feature engineering plays an important role in the success of a machine ...
research
11/08/2019

Subspace Clustering with Active Learning

Subspace clustering is a growing field of unsupervised learning that has...
research
07/17/2018

Phase Retrieval for Signals in Union of Subspaces

We consider the phase retrieval problem for signals that belong to a uni...
research
06/18/2020

Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion

Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a...
research
08/06/2016

Leveraging Union of Subspace Structure to Improve Constrained Clustering

Many clustering problems in computer vision and other contexts are also ...

Please sign up or login with your details

Forgot password? Click here to reset