Interpretable nonconvex submodule clustering algorithm using ℓr-induced tensor nuclear norm and ℓ2,p column sparse norm with global convergence guarantees

基于ℓr诱导张量核范数和ℓ2,p列稀疏范数的可解释非凸子模块聚类算法,具有全局收敛性保证

阅读:1

Abstract

Tensor-based subspace clustering algorithms have garnered significant attention for their high efficiency in clustering high-dimensional data. However, when dealing with 2D image data, traditional vectorization operations in most algorithms tend to undermine the correlations of higher-order tensor terms. To tackle this limitation, this paper proposes a non-convex submodule clustering approach (2D-NLRSC) that leverages sparse and low-rank representations for 2D image data. An [Formula: see text]-induced tensor nuclear norm is introduced to approximate the tensor rank precisely. Instead of vectorizing each 2D image, the framework arranges samples as lateral slices of a third-order tensor. It employs the t-product operation to generate an optimal representation tensor with low-rank constraint. The proposed method combines [Formula: see text]-norm induced clustering awareness with laplacian regularization to obtain a representation tensor with a diagonal structure. Additionally, 2D-NLRSC incorporates the [Formula: see text]-norm as a regularization term, taking advantage of its excellent invariance, continuity, and differentiability. Experimental results on real image datasets validate the superior performance of the 2D-NLRSC model.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。