Sciweavers

153 search results - page 22 / 31
» Nearest Neighbor Search on Moving Object Trajectories
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
14 years 12 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
94
Voted
AVSS
2005
IEEE
15 years 5 months ago
View registration using interesting segments of planar trajectories
We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the...
Walter Nunziati, Jonathan Alon, Stan Sclaroff, Alb...
104
Voted
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 11 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
15 years 4 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng