By Topic

Eigenvalues and Singular Value Decompositions of Reduced Biquaternion Matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Soo-Chang Pei ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei ; Ja-Han Chang ; Jian-Jiun Ding ; Ming-Yang Chen

In this paper, the algorithms for calculating the eigenvalues, the eigenvectors, and the singular value decompositions (SVD) of a reduced biquaternion (RB) matrix are developed. We use the SVD to approximate an RB matrix in the least square sense and define the pseudoinverse matrix of an RB matrix. Moreover, the RB SVD is employed to implement the SVD of a color image. The computational complexity for the SVD of an RB matrix is only one-fourth of that for the SVD of conventional quaternion matrices. Therefore, many useful image-processing methods using the SVD can be extended to a color image without separating the color image into three channels. The numbers of the eigenvalues of an n times n RB matrix, the nth roots of an RB, and the zeros of an RB polynomial with degree n are all finite and equal to n2 , not infinite as those of conventional quaternions.

Published in:

IEEE Transactions on Circuits and Systems I: Regular Papers  (Volume:55 ,  Issue: 9 )