Random projection tree and multiview embedding for large-scale image retrieval

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Image retrieval on large-scale datasets is challenging. Current indexing schemes, such as k-d tree, suffer from the "curse of dimensionality". In addition, there is no principled approach to integrate various features that measure multiple views of images, such as color histogram and edge directional histogram. We propose a novel retrieval system that tackles these two problems simultaneously. First, we use random projection trees to index data whose complexity only depends on the low intrinsic dimension of a dataset. Second, we apply a probabilistic multiview embedding algorithm to unify different features. Experiments on MSRA large-scale dataset demonstrate the efficiency and effectiveness of the proposed approach. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Xie, B., Mu, Y., Song, M., & Tao, D. (2010). Random projection tree and multiview embedding for large-scale image retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6444 LNCS, pp. 641–649). https://doi.org/10.1007/978-3-642-17534-3_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free