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

A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space

โœ Scribed by Esmaeili, Mani Malek; Ward, R. K.; Fatourechi, M.

Book ID
118221409
Publisher
IEEE
Year
2012
Tongue
English
Weight
765 KB
Volume
34
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast nearest-neighbor search algorithms
Fast nearest-neighbor search algorithms based on approximation-elimination search
โœ V. Ramasubramanian; Kuldip K. Paliwal ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approxima-tion}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of

A fast nearest neighbor search algorithm
A fast nearest neighbor search algorithm by filtration
โœ Sung-Hyuk Cha; Sargur N. Srihari ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is "nding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this namK ve method is O(nd) where n is the num