You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
28 January 2008Semi-supervised dimensionality reduction for image retrieval
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.
The alert did not successfully save. Please try again later.
Bin Zhang, Yangqiu Song, Wenjun Yin, Ming Xie, Jin Dong, 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