๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast exact k nearest neighbors search using an orthogonal search tree

โœ Scribed by Yi-Ching Liaw; Maw-Lin Leou; Chien-Min Wu

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
230 KB
Volume
43
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast indexing method for image retrieval
Fast indexing method for image retrieval using k nearest neighbors searches by principal axis analysis
โœ Shyi-Chyi Cheng; Tian-Luu Wu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 737 KB

This paper presents a fast indexing scheme for content-based image retrieval based on the principal axis analysis. Image databases often represent the image objects as high-dimensional feature vectors and access them via the feature vectors and similarity measure. A similarity measure similar to the

SR-tree: An index structure for nearest-
SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data
โœ Norio Katayama; Shin'ichi Satoh ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 273 KB ๐Ÿ‘ 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in