|
Real World Example – Fast K-Nearest Neighbor SearchCelestech has been developing a revolutionary method for hyperspectral image processing. The computational load of this sort of application is daunting, but provides some concrete data points on the types of performance improvement that can be achieved with GPU processing. Our GPU software development team has mastered the art of extracting maximum performance from the NVIDIA hardware. As part of our hyperspectral image processing effort, Celestech developed a proprietary K-Nearest Neighbors (KNN) algorithm with world-class speed. We have benchmarked this algorithm against other published approaches and believe it to be the fastest nearest neighbor search algorithm available.
Part of the challenge in developing efficient GPU applications lies in the sheer magnitude of their processing capabilities. One trillion floating-point operations per second is a number so large that it defies comprehension. In this realm, counter-intuitive approaches sometimes yield superior results. Related Links |








Research
21st Century Super Computing 
The
chart shows the performance of Celestech's Fast Nearest Neighbors
algorithm.