Group-invariant Subspace Clustering

In this paper we consider the problem of group-invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given group. Algebraically, such group-invariant subspaces are also referred to as submodules. Similar to the well known Sparse Subspace Clustering approach where the data is assumed to come from a union of subspaces, we analyze an algorithm which, following a recent work [1], we refer to as Sparse Sub-module Clustering (SSmC). The method is based on finding group-sparse self-representation of data points. In this paper we primarily derive general conditions under which such a group-invariant subspace identification is possible. In particular we extend the geometric analysis in [2] and in the process we identify a related problem in geometric functional analysis.

[1]  P. Pivovarov.  On determinants and the volume of random polytopes in isotropic convex bodies , 2010 .

[2]  Rama Chellappa,et al.  Rotation invariant simultaneous clustering and dictionary learning , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[3]  R. Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications. , 2013, IEEE transactions on pattern analysis and machine intelligence.

[4]  Misha Elena Kilmer,et al.  Clustering multi-way data: a novel algebraic approach , 2014, ArXiv.

[5]  D. Alonso-Gutiérrez.  ON THE ISOTROPY CONSTANT OF RANDOM CONVEX SETS , 2007, 0707.1570.

[6]  Apostolos Giannopoulos,et al.  Asymptotic shape of a random polytope in a convex body , 2009 .

[7]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[8]  Randall R. Holmes.  Linear Representations of Finite Groups , 2008 .

[9]  Emmanuel J. Candès,et al.  A Geometric Analysis of Subspace Clustering with Outliers , 2011, ArXiv.

[10]  Misha Elena Kilmer,et al.  Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging , 2013, SIAM J. Matrix Anal. Appl..

[11]  Helmut Bölcskei,et al.  Subspace clustering via thresholding and spectral clustering , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[12]  René Vidal,et al.  Block-Sparse Recovery via Convex Optimization , 2011, IEEE Transactions on Signal Processing.

[13]  R. Rockafellar.  Convex Analysis: (pms-28) , 1970 .

[14]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[15]  Patrice Y. Simard,et al.  Metrics and Models for Handwritten Character Recognition , 1998 .

[16]  Ronen Basri,et al.  Lambertian reflectance and linear subspaces , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[17]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..