Find your neighbors (quickly!)
In many computer vision problems, answering the nearest neighbor queries efficiently, especially in higher dimensions over a large dataset is a difficult task and highly time consuming. The brute force method to find the nearest neighbor to a point q requires a linear scan of all objects in S. Howev...
Saved in:
Main Author: | Wong, Wei Tian. |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Final Year Project |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/48509 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Multi-agent path finding (part A)
by: Ong, Wei Hua
Published: (2020) -
Multi-agent path finding (part B)
by: Cao, Lifeng
Published: (2020) -
Memes co‐evolution strategies for fast convergence in solving single machine scheduling problems
by: Huang, Wei-Hsiu, et al.
Published: (2013) -
AED placement optimisation
by: Lee, Qian Yu
Published: (2021) -
Indoor localization+
by: Somani, Palak
Published: (2021)