EUVIMEDEUVIMED entdecken
Crossref

Efficient and Effective Nonconvex Low-Rank Subspace Clustering via SVT-Free Operators

Hengmin Zhang, Shuyi Li, Jing Qiu, Yang Tang, Jie Wen, Zhiyuan Zha, Bihan Wen

IEEE Transactions on Circuits and Systems for Video Technology · 2023-12 · 33 (12) · 7515-7529

DOI: 10.1109/tcsvt.2023.3275299 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Circuits and Systems for Video Technology, 2023-12. Verfasst von Hengmin Zhang und 6 weiteren Autor:innen. Die Arbeit wurde bisher 34-mal zitiert (Crossref) und nennt 72 Literaturangaben. Gefördert von: National Natural Science Foundation of China, China Postdoctoral Science Foundation, National Key Research and Development Program of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

With the growing interest in convex and nonconvex low-rank matrix learning problems, the widely used singular value thresholding (SVT) operators associated with rank relaxation functions often face higher computational complexity, particularly for large-scale data matrices. To improve the efficacy of low-rank subspace clustering and overcome the issue of high computational complexity, this work proposes an efficient and effective method that avoids the need for singular value decomposition (SVD) computations in the iteration scheme. This can be achieved through the use of a computationally efficient and compact formulation, as well as automatic removal of the optimal mean, which reduces time consumption and enhances evaluation performance. A unified clustering framework based on Schatten- $p$ norm regularized by $\ell _{2,q}$ -norm can be formulated using this processing way, where inner element suppression can be achieved by choosing appropriate $p$ , $q \in (0,1)$ . Additionally, calculating the optimal mean enhances the robustness of the proposed method in the presence of outliers. Unlike the general iteration scheme of the alternating direction method of multiplier (ADMM) algorithms that introduce auxiliary splitting variables, the proposed alternating re-weighted least square (ARwLS) algorithm uses matrix inverse and multiplication computations to obtain analytic solutions, resulting in faster processing speeds for each sub-problem. To further investigate, we provide the computational complexity of each iteration and the theoretical analysis of the convergence property, where the derived solution is a stationary point. Experimental results on synthetic data and several benchmark datasets demonstrate the promising efficiency and efficacy of the proposed clustering method compared to classical and competing algorithms.

Förderung

  • National Natural Science Foundation of China
  • China Postdoctoral Science Foundation
  • National Key Research and Development Program of China
  • Major Key Project of Pengcheng Laboratory

Zitieren

APA

Zhang, H., Li, S., Qiu, J., Tang, Y., Wen, J., Zha, Z., & Wen, B. (2023). Efficient and Effective Nonconvex Low-Rank Subspace Clustering via SVT-Free Operators. IEEE Transactions on Circuits and Systems for Video Technology, 33(12), 7515-7529. https://doi.org/10.1109/tcsvt.2023.3275299

Vancouver

Zhang H, Li S, Qiu J, Tang Y, Wen J, Zha Z, et al. Efficient and Effective Nonconvex Low-Rank Subspace Clustering via SVT-Free Operators. IEEE Transactions on Circuits and Systems for Video Technology. 2023;33(12):7515-7529. doi:10.1109/tcsvt.2023.3275299

BibTeX
@article{Zhang2023,
  author = {Zhang, Hengmin and Li, Shuyi and Qiu, Jing and Tang, Yang and Wen, Jie and Zha, Zhiyuan and Wen, Bihan},
  title = {Efficient and Effective Nonconvex Low-Rank Subspace Clustering via SVT-Free Operators},
  journal = {IEEE Transactions on Circuits and Systems for Video Technology},
  year = {2023},
  volume = {33},
  number = {12},
  pages = {7515--7529},
  doi = {10.1109/tcsvt.2023.3275299}
}
Kostenlos starten →