'Median curpts' presentation slideshows

What is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?

dim = argmax dim [var(pts dim )] split = median(pts dim ) L_pts = [pts dim < split] R_pts = [pts dim > split]. PCA Tree. axis = pca(pts).eigvec[0] curpts = project(pts, axis) split = median(curpts) L_pts = [curpts < split] R_pts = [curpts > split]. Ball Tree.

117 views • 1 slides