Abstract

In recent years, the reduced biquaternion algebras have been widely used in color image processing problems and in the field of electromagnetism. This paper studies eigen-problems of reduced biquaternion matrices by means of a complex representation of a reduced biquaternion matrix and derives new algebraic algorithms to find the eigenvalues and eigenvectors of reduced biquaternion matrices. This paper also concludes that the number of eigenvalues of an n×n reduced biquaternion matrix is infinite. In addition, the proposed algebraic algorithms are shown to be effective in application to a color face recognition problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call