Sciweavers

92 search results - page 9 / 19
» Quality and efficiency in high dimensional nearest neighbor ...
Sort
View
78
Voted
ICPR
2002
IEEE
15 years 10 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
ECCV
2008
Springer
15 years 11 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
TMM
2002
115views more  TMM 2002»
14 years 9 months ago
Principles of schema design for multimedia databases
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...
Simone Santini, Amarnath Gupta
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
15 years 4 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
JMLR
2006
206views more  JMLR 2006»
14 years 9 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray