Sciweavers

120 search results - page 23 / 24
» Complementary Hashing for Approximate Nearest Neighbor Searc...
Sort
View
TKDE
2010
195views more  TKDE 2010»
13 years 4 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
ICCV
2005
IEEE
14 years 8 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon
3DIM
2007
IEEE
14 years 19 days ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
TKDE
2011
332views more  TKDE 2011»
13 years 1 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
13 years 11 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich