EUVIMEDEUVIMED entdecken
Crossref

Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation

Huan Ren, Xu‐Yun Xu

Numerical Linear Algebra with Applications · 2026-02 · 33 (1)

DOI: 10.1002/nla.70066 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, online erschienen am 15.02.2026. Verfasst von Huan Ren und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 31 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Jiangxi Province, Jiangxi Science and Technology Normal University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Robust quaternion matrix completion (RQMC), which aims to recover clean data from data that is both incomplete and corrupted by noise, has recently attracted extensive attention in the fields of image and signal processing. This problem can be iteratively solved by applying the close‐form solution of proximal operator, including quaternion singular value thresholding (QSVT) operator. However, the computational complexity of the QSVT operator is extremely high, which seriously affects the solution efficiency of the RQMC model. In this paper, we propose a randomized algorithm for the RQMC model based on the randomized low‐rank approximation technique. Then, through theoretical analysis, we prove that the randomized algorithm offers an ideal approximation of the deterministic algorithm. Finally, through some numerical experiments, we demonstrate the effectiveness and reliability of the proposed algorithm.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Jiangxi Province
  • Jiangxi Science and Technology Normal University

Zitieren

APA

Ren, H., & Xu, X. (2026). Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation. Numerical Linear Algebra with Applications, 33(1). https://doi.org/10.1002/nla.70066

Vancouver

Ren H, Xu X. Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation. Numerical Linear Algebra with Applications. 2026;33(1). doi:10.1002/nla.70066

BibTeX
@article{Ren2026,
  author = {Ren, Huan and Xu, Xu‐Yun},
  title = {Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation},
  journal = {Numerical Linear Algebra with Applications},
  year = {2026},
  volume = {33},
  number = {1},
  doi = {10.1002/nla.70066}
}
Kostenlos starten →