1 | initial version |
Apparently there is at least one GPU implementation for RANSAC but I haven't tried it. To be honest I doubt that it will be faster than a descent C/C++ implementation. I have implemented my own RANSAC variant (See [1] for details) and it has an enormous speed of about > 400 images/second including I/O (loading features and determining correspondences) by just using a single thread. Obviously using multi-threading will further increase the throughput. I am not familiar with GPU programming, but I guess RANSAC is not the kind of algorithm that perfectly suits the GPU programming paradigma.
[1] Stefan Romberg and Rainer Lienhart. Bundle Min-Hashing for Logo Recognition. ACM International Conference on Multimedia Retrieval 2013 (ICMR2013)
2 | added link |
Apparently there is at least one GPU implementation for RANSAC but I haven't tried it. To be honest I doubt that it will be faster than a descent C/C++ implementation. I have implemented my own RANSAC variant (See [1] for details) and it has an enormous speed of about > 400 images/second including I/O (loading features and determining correspondences) by just using a single thread. Obviously using multi-threading will further increase the throughput. I am not familiar with GPU programming, but I guess RANSAC is not the kind of algorithm that perfectly suits the GPU programming paradigma.
[1] Stefan Romberg and Rainer Lienhart. Bundle Min-Hashing for Logo Recognition. ACM International Conference on Multimedia Retrieval 2013 (ICMR2013) [PDF]