Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

DOI10.1016/j.patcog.2005.08.016zbMath1118.68053OpenAlexW2014946817MaRDI QIDQ854189

Ting-Fang Yen, Chiou-Shann Fuh, Yong-Sheng Chen, Yi-Ping Hung

Publication date: 7 December 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2005.08.016

zbMATH Keywords

nearest neighbor searchlower bound tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items (2)

Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ Fast exact \(k\) nearest neighbors search using an orthogonal search tree

Cites Work

• Unnamed Item
• Unnamed Item
• Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform
• A fast search algorithm for vector quantization using mean pyramids of codewords
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Multidimensional binary search trees used for associative searching
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Nearest Neighbors
• Fast block matching algorithm based on the winner-update strategy

This page was built for publication: Fast and versatile algorithm for nearest neighbor search based on a lower bound tree