CVOct 22, 2025

Data-Adaptive Transformed Bilateral Tensor Low-Rank Representation for Clustering

arXiv:2510.20077v1h-index: 3Has Code
Originality Incremental advance
AI Analysis

This work addresses noise robustness in image clustering, an incremental improvement for computer vision applications.

The paper tackles the problem of poor robustness to noise in tensor low-rank representation for image clustering by proposing TBTLRR, a data-adaptive model that learns unitary transforms and exploits bilateral structures, achieving superior clustering performance over state-of-the-art methods in extensive experiments.

Tensor low-rank representation (TLRR) has demonstrated significant success in image clustering. However, most existing methods rely on fixed transformations and suffer from poor robustness to noise. In this paper, we propose a novel transformed bilateral tensor low-rank representation model called TBTLRR, which introduces a data-adaptive tensor nuclear norm by learning arbitrary unitary transforms, allowing for more effective capture of global correlations. In addition, by leveraging the bilateral structure of latent tensor data, TBTLRR is able to exploit local correlations between image samples and features. Furthermore, TBTLRR integrates the $\ell_{1/2}$-norm and Frobenius norm regularization terms for better dealing with complex noise in real-world scenarios. To solve the proposed nonconvex model, we develop an efficient optimization algorithm inspired by the alternating direction method of multipliers (ADMM) and provide theoretical convergence. Extensive experiments validate its superiority over the state-of-the-art methods in clustering. The code will be available at https://github.com/xianchaoxiu/TBTLRR.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes