Sciweavers

201 search results - page 15 / 41
» Computing nearest neighbors in real time
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
14 years 2 months ago
Real-time keypoints matching: application to visual servoing
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
Thi-Thanh-Hai Tran, Éric Marchand
FOCS
2006
IEEE
14 years 2 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
CVPR
2001
IEEE
14 years 10 months ago
Gait Recognition from Time-Normalized Joint-Angle Trajectories in the Walking Plane
This paper demonstrates gait recognition using only the trajectories of lower body joint angles projected into the walking plane. For this work, we begin with the position of 3D m...
Rawesak Tanawongsuwan, Aaron F. Bobick