Xu-Yun Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xu-Yun Xu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hongjia Chen
Department of Mathematics, School of Science, Nanchang University, Nanchang, People’s Republic of China
1 shared publication Huan Ren
School of Mathematical Sciences Jiangxi Science and Technology Normal University Nanchang People's Republic of China
1 shared publication- Huan Ren
School of Mathematical Sciences, Jiangxi Science and Technology Normal University, Nanchang, People’s Republic of China
1 shared publication - Jinping Zou
Department of Mathematics, School of Mathematics and Computer Sciences, Nanchang University, Nanchang, 330031, China; Institute of Mathematics and Interdisciplinary Sciences, Nanchang University, Nanchang, 330031, China
1 shared publication - Xiang Wang
School of Electronic and Information Engineering, Beihang University, Beijing 100191, China
1 shared publication
Latest Publications
- 15 February 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (1)
Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation
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.
- 15 February 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (1)
Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation
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.
- Top Cited Papers
- 8 January 2026
- Published by Elsevier in Pattern Recognition
- Vol. 175
A Bayesian deep prior-based quaternion matrix completion for color image inpainting
- 8 January 2026
- Published by Elsevier in Pattern Recognition
- Vol. 175
Top Cited PapersA Bayesian deep prior-based quaternion matrix completion for color image inpainting