Fast exact k nearest neighbors search using an orthogonal search tree

DOI10.1016/J.PATCOG.2010.01.003zbMATH Open1192.68587DBLPjournals/pr/LiawLW10OpenAlexW2132824401WikidataQ35664452 ScholiaQ35664452MaRDI QIDQ962830FDOQ962830

Authors: Yi-Ching Liaw, Maw-Lin Leou, Chien-Min Wu 

Publication date: 7 April 2010

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

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

Recommendations

• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• Algorithm for finding k-nearest neighbors based on octree segmentation in space
• Fast neighbor search by using revised \(k\)-d tree
• scientific article; zbMATH DE number 5670169
• scientific article; zbMATH DE number 437556

zbMATH Keywords

fast algorithmorthonormal basis\(k\) nearest neighborsprincipal axis search tree

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Principal component analysis.
• Nearest neighbor pattern classification
• Title not available (Why is that?)
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Refinements to nearest-neighbor searching in k-dimensional trees
• Improvement of the fast exact pairwise-nearest-neighbor algorithm
• Image restoration of compressed image using classified vector quantization
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
• New algorithms for efficient high-dimensional nonparametric classification

Cited In (14)

• Fast neighbor search by using revised \(k\)-d tree
• VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
• Title not available (Why is that?)
• Title not available (Why is that?)
• An MPCA/LDA based dimensionality reduction algorithm for face recognition
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• Improvement of the fast exact pairwise-nearest-neighbor algorithm
• Answering k-NN query of Chinese calligraphic character based on data grid
• Title not available (Why is that?)
• Algorithm for finding k-nearest neighbors based on octree segmentation in space
• A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing
• Refinements to nearest-neighbor searching in k-dimensional trees
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

This page was built for publication: Fast exact \(k\) nearest neighbors search using an orthogonal search tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962830)