Randomized Quaternion Singular Value Decomposition for Low-Rank Approximation

by   Qiaohua Liu, et al.

Quaternion matrix approximation problems construct the approximated matrix via the quaternion singular value decomposition (SVD) by selecting some singular value decomposition (SVD) triplets of quaternion matrices. In applications such as color image processing and recognition problems, only a small number of dominant SVD triplets are selected, while in some applications such as quaternion total least squares problem, small SVD triplets (small singular values and associated singular vectors) and numerical rank with respect to a small threshold are required. In this paper, we propose a randomized quaternion SVD () method to compute a small number of SVD triplets of a large-scale quaternion matrix. Theoretical results are given about approximation errors and the corresponding algorithm adapts to the low-rank matrix approximation problem. When the restricted rank increases, it might lead to information loss of small SVD triplets. The blocked quaternion randomized SVD algorithm is then developed when the numerical rank and information about small singular values are required. For color face recognition problems, numerical results show good performance of the developed quaternion randomized SVD method for low-rank approximation of a large-scale quaternion matrix. The blocked randomized SVD algorithm is also shown to be more robust than unblocked method through several experiments, and approximation errors from the blocked scheme are very close to the optimal error obtained by truncating a full SVD.


Single-pass randomized QLP decomposition for low-rank approximation

The QLP decomposition is one of the effective algorithms to approximate ...

Computing low-rank approximations of large-scale matrices with the Tensor Network randomized SVD

We propose a new algorithm for the computation of a singular value decom...

Accurate and fast matrix factorization for low-rank learning

In this paper we tackle two important challenges related to the accurate...

Ranky : An Approach to Solve Distributed SVD on Large Sparse Matrices

Singular Value Decomposition (SVD) is a well studied research topic in m...

A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices

Singular value decomposition (SVD) is a widely used technique for dimens...

Fast algorithms for robust principal component analysis with an upper bound on the rank

The robust principal component analysis (RPCA) decomposes a data matrix ...

Information Compression and Performance Evaluation of Tic-Tac-Toe's Evaluation Function Using Singular Value Decomposition

We approximated the evaluation function for the game Tic-Tac-Toe by sing...

Please sign up or login with your details

Forgot password? Click here to reset