Implicit Block Diagonal Low-Rank Representation.
IEEE Transactions on Image Processing(2018)
摘要
While current block diagonal constrained subspace clustering methods are performed explicitly on the original data space, in practice, it is often more desirable to embed the block diagonal prior into the reproducing kernel Hilbert feature space by kernelization techniques, as the underlying data structure in reality is usually nonlinear. However, it is still unknown how to carry out the embedding...
更多查看译文
关键词
Kernel,Clustering methods,Optimization,Robustness,Clustering algorithms,Convergence,Laplace equations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络