Transformation invariant subspace clustering | |
Li, Qi ; Sun, Zhenan ; Lin, Zhouchen ; He, Ran ; Tan, Tieniu | |
刊名 | PATTERN RECOGNITION |
2016 | |
关键词 | Transformation Subspace clustering Joint alignment and clustering ROBUST FACE RECOGNITION SPARSE REPRESENTATION ALIGNMENT SEGMENTATION MINIMIZATION ALGORITHM VIDEO GRAPH |
DOI | 10.1016/j.patcog.2016.02.006 |
英文摘要 | Subspace clustering has achieved great success in many computer vision applications. However, most subspace clustering algorithms require well aligned data samples, which is Often not straightforward to achieve. This paper proposes a Transformation Invariant Subspace Clustering framework by jointly aligning data samples and learning subspace representation. By alignment, the transformed data samples become highly correlated and a better affinity matrix can be obtained. The joint problem can be reduced to a sequence of Least Squares Regression problems, which can be efficiently solved. We verify the effectiveness of the proposed method with extensive experiments on unaligned real data, demonstrating its higher clustering accuracy than the state-of-the-art subspace clustering and transformation invariant clustering algorithms. (C) 2016 Elsevier Ltd. All rights reserved.; National Basic Research Program of China [2012CB316300, 2015CB352502]; National Natural Science Foundation of China [61273272, 61473289]; SCI(E); EI; ARTICLE; qli@nlpr.ia.ac.cn; znsun@nlpria.ac.cn; zlin@pku.edu.cn; rhe@nlpr.ia.ac.cn; tnt@nlpr.ia.ac.cn; ,SI; 142-155; 59 |
语种 | 英语 |
内容类型 | 期刊论文 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/447853] |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Li, Qi,Sun, Zhenan,Lin, Zhouchen,et al. Transformation invariant subspace clustering[J]. PATTERN RECOGNITION,2016. |
APA | Li, Qi,Sun, Zhenan,Lin, Zhouchen,He, Ran,&Tan, Tieniu.(2016).Transformation invariant subspace clustering.PATTERN RECOGNITION. |
MLA | Li, Qi,et al."Transformation invariant subspace clustering".PATTERN RECOGNITION (2016). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论