| 3. Feature
matching |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Nearest neighbor
search too slow for large |
|||||||||||||
| database of
128-dimenional data |
||||||||||||||
| • | Approximate nearest
neighbor search: |
|||||||||||||
| – | Best-bin-first [Beis et al. 97]:
modification to k-d tree |
|||||||||||||
| algorithm |
||||||||||||||
| – | Use heap data
structure to identify bins in order by |
|||||||||||||
| their distance
from query point |
||||||||||||||
| • | Result:
Can give speedup by factor of 1000 |
|||||||||||||
| while finding
nearest neighbor (of interest) |
||||||||||||||
| 95% of the time |
||||||||||||||