Structured AutoEncoders for Subspace Clustering

被引:315
作者
Peng, Xi [1 ]
Feng, Jiashi [2 ]
Xiao, Shijie [3 ]
Yau, Wei-Yun [4 ]
Zhou, Joey Tianyi [5 ]
Yang, Songfan [6 ]
机构
[1] Sichuan Univ, Coll Comp Sci, Chengdu 610065, Sichuan, Peoples R China
[2] Natl Univ Singapore, Dept ECE, Singapore 119077, Singapore
[3] 3OmniVis Technol Singapore Pte Ltd, Singapore 609935, Singapore
[4] ASTAR, Inst Infocomm Res, Singapore 138632, Singapore
[5] ASTAR, Inst High Performance Comp, Singapore 138632, Singapore
[6] Sichuan Univ, Coll Elect & Informat Engn, TAL Educ Grp, AI Lab, Chengdu 610065, Sichuan, Peoples R China
关键词
Unsupervised deep learning; locality preservation; globality preservation; spectral clustering; DIMENSIONALITY REDUCTION;
D O I
10.1109/TIP.2018.2848470
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Existing subspace clustering methods typically employ shallow models to estimate underlying subspaces of unlabeled data points and cluster them into corresponding groups. However, due to the limited representative capacity of the employed shallow models, those methods may fail in handling realistic data without the linear subspace structure. To address this issue, we propose a novel subspace clustering approach by introducing a new deep model-Structured AutoEncoder (StructAE). The StructAE learns a set of explicit transformations to progressively map input data points into nonlinear latent spaces while preserving the local and global subspace structure. In particular, to preserve local structure, the StructAE learns representations for each data point by minimizing reconstruction error with respect to itself. To preserve global structure, the StructAE incorporates a prior structured information by encouraging the learned representation to preserve specified reconstruction patterns over the entire data set. To the best of our knowledge, StructAE is one of the first deep subspace clustering approaches. Extensive experiments show that the proposed StructAE significantly outperforms 15 state-of-the-art subspace clustering approaches in terms of five evaluation metrics.
引用
收藏
页码:5076 / 5086
页数:11
相关论文
共 57 条
[1]  
[Anonymous], 2016, P ADV NEUR INF PROC
[2]  
[Anonymous], 2016, IJCAI
[3]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[4]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[5]   Triplet-Based Deep Hashing Network for Cross-Modal Retrieval [J].
Deng, Cheng ;
Chen, Zhaojia ;
Liu, Xianglong ;
Gao, Xinbo ;
Tao, Dacheng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2018, 27 (08) :3893-3903
[6]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[7]  
FAVARO P, 2011, PROC CVPR IEEE, P1801, DOI DOI 10.1109/CVPR.2011.5995365
[8]   Robust Subspace Segmentation with Block-diagonal Prior [J].
Feng, Jiashi ;
Lin, Zhouchen ;
Xu, Huan ;
Yan, Shuicheng .
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, :3818-3825
[9]   From few to many: Illumination cone models for face recognition under variable lighting and pose [J].
Georghiades, AS ;
Belhumeur, PN ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (06) :643-660
[10]   Deep Residual Learning for Image Recognition [J].
He, Kaiming ;
Zhang, Xiangyu ;
Ren, Shaoqing ;
Sun, Jian .
2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, :770-778