Computational Information Geometry Wonderland

Well, nearest neighbor queries are fundamental primitives to many algorithms (eg., computational geometry and texture synthesis). Often, we have to deal with high-dim data-sets and even if theoretical brand new algorithms (eg., LSH) have been designed, we are still lacking performance in practice. So why not, try the brute force method, and optimize on GPU the simplest algorithm using the intrinsic parallelism provided by graphics core. Here are the experiments we obtained. It is going to be presented at icip 2010 (image processing).

• Paper
• Poster

The question is how fast can you perform NN queries in practice....

Frank.