Sciweavers

280 search results - page 18 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
3D face recognition using sparse spherical representations
This paper addresses the problem of 3D face recognition using spherical sparse representations. We first propose a fully automated registration process that permits to align the 3...
Effrosini Kokiopoulou, Ivana Tosic, Pascal Frossar...
ICIP
2008
IEEE
15 years 11 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
104
Voted
ICML
2010
IEEE
14 years 10 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
CVPR
2004
IEEE
15 years 11 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
15 years 9 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...