Dual Tensor Low-Rank Representation for Subspace Clustering
- 17 July 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (1) , 37-50
Abstract
Benefiting from the powerful tensor techniques, the tensor low-rank representation has been proposed to construct sophisticated subspace clustering models. Existing tensor low-rank representation methods predominantly rely on a single low-rank prior to reconstruct the row space, which is instrumental in determining the subspace membership of samples by the row space information. However, this strategy neglects the column space and would lead to a subspace information loss. To address this issue, we propose a Dual Tensor Low-Rank Representation method (DTLRR), the first subspace clustering framework to theoretically recover both row and column subspaces simultaneously. Particularly, not simply formulating a dual self-representation model, we instead prove the recovery of both row and column spaces via a unified theoretical framework. Then, we impose low-rank constraints on the two corresponding affinity tensors to effectively capture high-order correlations. Meanwhile, we theoretically demonstrate the existence of compact dictionary tensors within the dual self-representation framework, which effectively eliminates the null spaces of the affinity tensors and significantly reduces computational complexity. Furthermore, an efficient Alternating Direction Method of Multipliers (ADMM) algorithm is designed to solve the proposed DTLRR model with guaranteed convergence. Extensive experiments validate the superior performance of the proposed DTLRR in data clustering, hyperspectral image denoising, and hyperspectral anomaly detection.Keywords
Funding Information
- National Natural Science Foundation of China (62302394)
- China Postdoctoral Science Foundation (317751)
This publication has 48 references indexed in Scilit:
- Tensor Q-rank: new data dependent definition of tensor rankMachine Learning, 2021
- Double low-rank representation with projection distance penalty for clustering2021
- Tensor low-rank sparse representation for tensor subspace learningNeurocomputing, 2021
- Smooth robust tensor principal component analysis for compressed sensing of dynamic MRIPattern Recognition, 2020
- Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion SegmentationInternational Journal of Computer Vision, 2016
- Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering2016
- Novel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD2014
- Robust and Efficient Subspace Segmentation via Least Squares Regression2012
- Factorization strategies for third-order tensorsLinear Algebra and its Applications, 2011
- Characterising Virtual Eigensignatures for General Purpose Face Recognition1998