Sciweavers

158 search results - page 19 / 32
» High dimensional reverse nearest neighbor queries
Sort
View
TKDE
2008
195views more  TKDE 2008»
14 years 9 months ago
Learning a Maximum Margin Subspace for Image Retrieval
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
Xiaofei He, Deng Cai, Jiawei Han
CVPR
2010
IEEE
15 years 5 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 2 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
15 years 2 months ago
Auxiliary Particle Filter Robot Localization from High-Dimensional Sensor Observations
We apply the auxiliary particle filter algorithm of Pitt and Shephard (1999) to the problem of robot localization. To deal with the high-dimensional sensor observations (images) ...
Nikos A. Vlassis, Bas Terwijn, Ben J. A. Krös...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon