Journal of Information Technology & Software Engineering
Open Access
ISSN: 2165- 7866
+44 1300 500008
ISSN: 2165- 7866
+44 1300 500008
Gang Wu
China University of Mining and Technology, China
Posters & Accepted Abstracts: J Inform Tech Softw Eng
Recently, matrix-based methods have gained wide attention in pattern recognition and machine learning communities. The generalized low rank approximations of matrices (GLRAM) and the bilinear Lanczos components algorithm (BLC) are two popular algorithms that treat data as the native two-dimensional matrix pattern. However, these two algorithms often require heavy computation time and memory space in practice, especially for large scale problems. In this talk, we propose inexact and incremental bilinear Lanczos components algorithms for high dimensionality reduction and image reconstruction. We first introduce the thick-restarting strategy to the BLC algorithm, and present a thick-restarted Lanczos components algotithm (TRBLC). In this algorithm, we use the Ritz vectors as approximations to dominant eigenvectors instead of the Lanczos vectors. In our implementation, the iterative matrices are not formed nor stored explicitly, thanks to the characteristic of the Lanczos procedure. Then, we explore the relationship between the reconstruction error and the accuracy of the Ritz vectors, so that the computational complexities of eigenpairs can be reduced significantly. As a result, we propose an inexact thick-restarted Lanczos components algorithm (Inex-TRBLC). Moreover, we investigate the problem of incremental generalized low rank approximations of matrices, and propose an incremental and inexact TRBLC algorithm (Incr-TRBLC). Numerical experiments illustrate the superiority of the new algorithms over the GLRAM algorithm and its variations, as well as the BLC algorithm for some real-world image reconstruction and face recognition problems.
Email: gangwu76@126.com