Translator Disclaimer
28 January 2008 Semi-supervised dimensionality reduction for image retrieval
Author Affiliations +
Proceedings Volume 6822, Visual Communications and Image Processing 2008; 682225 (2008) https://doi.org/10.1117/12.767197
Event: Electronic Imaging, 2008, San Jose, California, United States
Abstract
This paper proposes a novel semi-supervised dimensionality reduction learning algorithm for the ranking problem. Generally, we do not make the assumption of existence of classes and do not want to find the classification boundaries. Instead, we only assume that the data point cloud can construct a graph which describes the manifold structure, and there are multiple concepts on different parts of the manifold. By maximizing the distance between different concepts and simultaneously preserving the local structure on the manifold, the learned metric can indeed give good ranking results. Moreover, based on the theoretical analysis of the relationship between graph Laplacian and manifold Laplace-Beltrami operator, we develop an online learning algorithm that can incrementally learn the unlabeled data.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bin Zhang, Yangqiu Song, Wenjun Yin, Ming Xie, Jin Dong, and Changshui Zhang "Semi-supervised dimensionality reduction for image retrieval", Proc. SPIE 6822, Visual Communications and Image Processing 2008, 682225 (28 January 2008); https://doi.org/10.1117/12.767197
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top