There are 2 images A and B. I extract the keypoints (a[i] and b[i]) from them. I wonder how can I determine the matching between a[i] and b[j], efficiently? The obvious method comes to me is to c...

I want to implement some king of spatial indexing data structure for my MKAnnotations. Currently it's horribly slow when I try to filter them based on distance criteria ( 3-4k of locations, curren...

I looked at the definition of KD-tree and R-tree. It seems to me that they are almost the same. What's the difference between a KD-tree and an R-tree?

I am trying to build a Distributed KD tree using map-reduce. Description of Distributed KD tree can be found out here Dkd-Tree I have a feature vector of images having dimension 20. I have to buil...

I am trying to build the KD tree(independent) for image features. I have extracted the image features,the feature contains suppose 1000 float values. Using map-reduce to distribute the images amo...

I'm going to write a templatized implementation of a KDTree, which for now should only work as Quadtree or Octree for a BarnesHut implementation. The crucial point here is the design, I would like...

The other day, I was reading about kd-trees. I was looking for a concrete and simple situation where such a data structure could be useful. Does anybody have such an example?

I'm writing an app that looks up points in two-dimensional space using a k-d tree. It would be nice, during development, to be able to "see" the nearest-neighbor zones surrounding each point. In t...

I've got a MongoDB with about 1 million documents in it. These documents all have a string that represents a 256 bit bin of 1s and 0s, like: 0110101010101010110101010101 Ideally, I'd like to quer...

I want to compare the SURF descriptors in one image (A), with the descriptors in several other images (B,C,D,..) to find the most similar image to A. The descriptors have 64 dimensions. Using C# a...

I am trying to make some Haskell types which are parametrized not by types but by elements of a type, specifically, integers. For instance, a (linear-algebra) vector in R^2 and a vector in R^3 are ...

I am trying to utilize k-nearest neighbors for the string similarity problem i.e. given a string and a knowledge base, I want to output k strings that are similar to my given string. Are there any ...

I have to implement k nearest neighbors search for 10 dimensional data in kd-tree. But problem is that my algorithm is very fast for k=1, but as much as 2000x slower for k>1 (k=2,5,10,20,100) Is ...

after one day of trying to figure out how to implement a kd-tree in OpenGL/GLSL i am pretty frustrated ... I declare my KD-Nodes like this in GLSL: layout(std140) uniform node{ ivec4 splitPoint;...