CSE 589Applied AlgorithmsSpring 1999

Table of Contents

CSE 589Applied AlgorithmsSpring 1999

Nearest Neighbor Search

NNS in VQ

Naive Linear Search

Orchard’s Method

Orchard’s Principle

Orchard Data Structure

Basic Orchard Algorithm

Orchard Improvements

Switching Lists (1)

Switching Lists (2)

Orchard Notes

k-d Tree

k-d Tree Construction

k-d Tree Construction (1)

k-d Tree Construction (2)

k-d Tree Construction (3)

k-d Tree Construction (4)

k-d Tree Construction (5)

k-d Tree Construction (6)

k-d Tree Construction (7)

k-d Tree Construction (8)

k-d Tree Construction (9)

k-d Tree Construction (10)

k-d Tree Construction (11)

k-d Tree Construction (12)

k-d Tree Construction (13)

k-d Tree Construction (14)

k-d Tree Construction (15)

k-d Tree Construction (16)

k-d Tree Construction (17)

k-d Tree Construction (18)

k-d Tree Construction Complexity

k-d Tree Codebook Organizaton

k-d Tree Splitting

Node Structure for k-d Trees

k-d Tree Nearest Neighbor Search

k-d Tree NNS (1)

k-d Tree NNS (2)

k-d Tree NNS (3)

k-d Tree NNS (4)

k-d Tree NNS (5)

k-d Tree NNS (6)

k-d Tree NNS (7)

k-d Tree NNS (8)

k-d Tree NNS (9)

k-d Tree NNS (10)

k-d Tree NNS (11)

k-d Tree NNS (12)

k-d Tree NNS (13)

k-d Tree NNS (14)

k-d Tree NNS (15)

k-d Tree NNS (16)

k-d Tree NNS (17)

k-d Tree NNS (18)

k-d Tree NNS (19)

k-d Tree NNS (20)

k-d Tree NNS (21)

Notes on k-d NNS

Alternative is PCP-Tree

Principal Component Partition

PCP Tree vs. k-d tree

16D Codewords Searched

16D Execution Time

Comparison in Time per Search

NNS Summary

Notes on VQ

Email: ladner@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/

Other information:
CSE 589: Applied Algorithms

Download presentation source