Neither Global Nor Local: A Hierarchical Robust Subspace Clustering For Image Data

Abstract

In this paper, we consider the problem of subspace clustering in presence of contiguous noise, occlusion and disguise. We argue that self-expressive representation of data in current state-of-the-art approaches is severely sensitive to occlusions and complex real-world noises. To alleviate this problem, we propose a hierarchical framework that brings robustness of local patches-based representations and discriminant property of global representations together. This approach consists of 1) a top-down stage, in which the input data is subject to repeated division to smaller patches and 2) a bottom-up stage, in which the low rank embedding of local patches in field of view of a corresponding patch in upper level are merged on a Grassmann manifold. This summarized information provides two key information for the corresponding patch on the upper level: cannot-links and recommended-links. This information is employed for computing a self-expressive representation of each patch at upper levels using a weighted sparse group lasso optimization problem. Numerical results on several real data sets confirm the efficiency of our approach.

References in corpus (7)

• Robust Recovery of Subspace Structures by Low-Rank Representation
• A note on the group lasso and a sparse group lasso
• A geometric analysis of subspace clustering with outliers
• Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
• Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds
• Median K-flats for hybrid linear modeling with many outliers
• Learning Transformations for Clustering and Classification

Cited by in corpus (1)

• Deep Embedded Multi-view Clustering with Collaborative Training