Sciweavers

4 search results - page 1 / 1
» Depth-first k-nearest neighbor finding using the MaxNearestD...
Sort
View
PAMI
2008
152views more  PAMI 2008»
14 years 10 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
68
Voted
ICIAP
2003
ACM
15 years 10 months ago
Depth-first k-nearest neighbor finding using the MaxNearestDist estimator
A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch and ...
Hanan Samet
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 2 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
ICIP
2004
IEEE
15 years 11 months ago
Estimating the quality of face localization for face verification
Face localization is the process of finding the exact position of a face in a given image. This can be useful in several applications such as face tracking or person authenticatio...
Yann Rodriguez, Fabien Cardinaux, Samy Bengio, Joh...