Graph Constrained Data Representation Learning for Human Motion Segmentation

by   Mariella Dimiccoli, et al.

Recently, transfer subspace learning based approaches have shown to be a valid alternative to unsupervised subspace clustering and temporal data clustering for human motion segmentation (HMS). These approaches leverage prior knowledge from a source domain to improve clustering performance on a target domain, and currently they represent the state of the art in HMS. Bucking this trend, in this paper, we propose a novel unsupervised model that learns a representation of the data and digs clustering information from the data itself. Our model is reminiscent of temporal subspace clustering, but presents two critical differences. First, we learn an auxiliary data matrix that can deviate from the initial data, hence confer more degrees of freedom to the coding matrix. Second, we introduce a regularization term for this auxiliary data matrix that preserves the local geometrical structure present in the high-dimensional space. The proposed model is efficiently optimized by using an original Alternating Direction Method of Multipliers (ADMM) formulation allowing to learn jointly the auxiliary data representation, a nonnegative dictionary and a coding matrix. Experimental results on four benchmark datasets for HMS demonstrate that our approach achieves significantly better clustering performance then state-of-the-art methods, including both unsupervised and more recent semi-supervised transfer learning approaches.


page 5

page 7

page 8


Consistency and Diversity induced Human Motion Segmentation

Subspace clustering is a classical technique that has been widely used f...

Superpixel Segmentation Based on Spatially Constrained Subspace Clustering

Superpixel segmentation aims at dividing the input image into some repre...

Simplex Representation for Subspace Clustering

Spectral clustering based methods have achieved leading performance on s...

Subspace Clustering for Action Recognition with Covariance Representations and Temporal Pruning

This paper tackles the problem of human action recognition, defined as c...

Unsupervised Feature Selection based on Adaptive Similarity Learning and Subspace Clustering

Feature selection methods have an important role on the readability of d...

On Matrix Factorizations in Subspace Clustering

This article explores subspace clustering algorithms using CUR decomposi...

Non-Negative Local Sparse Coding for Subspace Clustering

Subspace sparse coding (SSC) algorithms have proven to be beneficial to ...

Please sign up or login with your details

Forgot password? Click here to reset