Academic Journals Database
Disseminating quality controlled scientific knowledge

Inner Product Laplacian Embedding Based on Semidefinite Programming

Author(s): Xianhua Zeng

Journal: Journal of Signal and Information Processing
ISSN 2159-4465

Volume: 02;
Issue: 03;
Start page: 196;
Date: 2011;
Original page

Keywords: Inner Product | Semi-Definite Programming | Geodesic Distance | Laplacian Matrix

This paper proposes an inner product Laplacian embedding algorithm based on semi-definite programming, named as IPLE algorithm. The new algorithm learns a geodesic distance-based kernel matrix by using semi-definite programming under the constraints of local contraction. The criterion function is to make the neighborhood points on manifold as close as possible while the geodesic distances between those distant points are preserved. The IPLE algorithm sufficiently integrates the advantages of LE, ISOMAP and MVU algorithms. The comparison experiments on two image datasets from COIL-20 images and USPS handwritten digit images are performed by applying LE, ISOMAP, MVU and the proposed IPLE. Experimental results show that the intrinsic low-dimensional coordinates obtained by our algorithm preserve more information according to the fraction of the dominant eigenvalues and can obtain the better comprehensive performance in clustering and manifold structure.
Save time & money - Smart Internet Solutions      Why do you need a reservation system?