Abstract
Face recognition and identification are very important applications in machine learning. Due to the increasing amount of available data, traditional approaches based on matricization and matrix PCA methods can be difficult to implement. Moreover, the tensorial approaches are a natural choice, due to the mere structure of the databases, for example in the case of color images. Nevertheless, even though various authors proposed factorization strategies for tensors, the size of the considered tensors can pose some serious issues. Indeed, the most demanding part of the computational effort in recognition or identification problems resides in the training process. When only a few features are needed to construct the projection space, there is no need to compute a SVD on the whole data. Two versions of the tensor Golub–Kahan algorithm are considered in this manuscript, as an alternative to the classical use of the tensor SVD which is based on truncated strategies. In this paper, we consider the Tensor Tubal Golub–Kahan Principal Component Analysis method which purpose it to extract the main features of images using the tensor singular value decomposition (SVD) based on the tensor cosine product that uses the discrete cosine transform. This approach is applied for classification and face recognition and numerical tests show its effectiveness.
Highlights
A Multidimensional PrincipalC-Product Golub–Kahan–singular value decomposition (SVD) for Classification and Face Recognition
Even though various factorization techniques have been developed over the last decades (high-order singular value decomposition (SVD) (HOSVD), Candecomp–Parafac (CP) and Tucker decomposition), the recent tensor SVDs (t-SVD and c-SVD), based on the use of the tensor t-product or c-products offer a matrix-like framework for third-order tensors, see [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] for more details on recent work related to tensors and applications
In order to illustrate the ability to approximate the first singular elements of a tensor using the Tensor Tube Global Golub–Kahan (TTGGKA) algorithm, we considered a 900 × 900 × 3 real tensor A which frontal slices were matrices generated by a finite difference discretization method of differential operators
Summary
C-Product Golub–Kahan–SVD for Classification and Face Recognition. This paper is dedicated to Mr Constantin M.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.