Robust Subspace Clustering for Multi-View Data by Exploiting Correlation Consensus

Abstract

More often than not, a multimedia data described by multiple features, such as color and shape features, can be naturally decomposed of multi-views. Since multi-views provide complementary information to each other, great endeavors have been dedicated by leveraging multiple views instead of a single view to achieve the better clustering performance. To effectively exploit data correlation consensus among multi-views, in this paper, we study subspace clustering for multi-view data while keeping individual views well encapsulated. For characterizing data correlations, we generate a similarity matrix in a way that high affinity values are assigned to data objects within the same subspace across views, while the correlations among data objects from distinct subspaces are minimized. Before generating this matrix, however, we should consider that multi-view data in practice might be corrupted by noise. The corrupted data will significantly downgrade clustering results. We first present a novel objective function coupled with an angular based regularizer. By minimizing this function, multiple sparse vectors are obtained for each data object as its multiple representations. In fact, these sparse vectors result from reaching data correlation consensus on all views. For tackling noise corruption, we present a sparsity-based approach that refines the angular-based data correlation. Using this approach, a more ideal data similarity matrix is generated for multi-view data. Spectral clustering is then applied to the similarity matrix to obtain the final subspace clustering. Extensive experiments have been conducted to validate the effectiveness of our proposed approach.

What-and-where to match: Deep spatially multiplicative integration networks for person re-identification

“…To avoid the dependency on body segments and reduce patch-wise mismatching, saliency-based approaches [Zhao et al, 2013a;Zhao et al, 2013b] are developed to estimate the saliency distribution relationship and control path-wise matching process. Some metric learning approaches [Chen et al, 2016;Huang et al, 2016;Wang et al, 2015c;Liao et al, 2015] make attempts to extract low-level features from local regions and perform local matching within each subregions. They aim to learn local similarities and global similarity, which can be leveraged into an unified framework.…”

TPM: A GPS-based Trajectory Pattern Mining System

“…In addition, some scholars have some deep learning related research. The work in [12] [13] [14] studies subspace clustering for multi-view data while keeping individual views well encapsulated and multiview spectral clustering via structured low-rank matrix factorization. The work in [15] [16] [17] observes that the same landmarks provided by different users over social media community may convey different geometry information depending on the viewpoints and angles, and may subsequently yield very different results.…”

Mask-Guided Style Transfer Network for Purifying Real Images

“…Implementation Details: In order to verify the effectiveness of the proposed method for gaze estimation, 3 public datasets (UTView [12], SynthesEyes [13], UnityEyes [10]) are used to train the estimator with k-NN [14][15] [16][17]and CNN [18,19,20,21,22]. MPIIGaze dataset [23] and purified MPIIGaze dataset (purified by proposed method) are used for testing the accuracy.…”