期刊
IEEE TRANSACTIONS ON IMAGE PROCESSING
卷 28, 期 10, 页码 5161-5170出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2019.2917857
关键词
Subspace clustering; compressive sensing; sparsity; low-rankness
资金
- National Natural Science Foundation of China (NSFC) [61622305, 61825601, 61532009, 61672365, 61425011, 61720106001, 61529101]
- Natural Science Foundation of Jiangsu Province of China (NSFJPC) [BK20160040]
Dimension reduction is widely regarded as an effective way for decreasing the computation, storage, and communication loads of data-driven intelligent systems, leading to a growing demand for statistical methods that allow analysis (e.g., clustering) of compressed data. We therefore study in this paper a novel problem called compressive robust subspace clustering, which is to perform robust subspace clustering with the compressed data, and which is generated by projecting the original high-dimensional data onto a lower-dimensional subspace chosen at random. Given only the compressed data and sensing matrix, the proposed method, row space pursuit (RSP), recovers the authentic row space that gives correct clustering results under certain conditions. Extensive experiments show that RSP is distinctly better than the competing methods, in terms of both clustering accuracy and computational efficiency.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据