I came across a few links that might be interesting to those working on the GPU accelerated version of hugin.
SIFT GPU (http://www.cs.unc.edu/~ccwu/siftgpu/<http://www.cs.unc.edu/%7Eccwu/siftgpu/>) uses CUDA parallel processing to search for SIFT features in images. I'm not sure if it does the search to find nearest neighbor points. But there is also a GPU accelerated version of that algorithm too. It is a brute force version of the nearest-k points. Since it is done in parallel it is order of magnitudes faster than the ANN algorithm using by autopano-sift-c. http://www-sop.inria.fr/members/Vincent.Garcia/research_knn.php Anyways I came across these while reading about CUDA in an nvidia presentation that uses photo stitching as an example: http://developer.download.nvidia.com/presentations/2009/SIGGRAPH/Advances_in_GPU_based_Image_Processing.pdf Maybe this could be a google summer code project next year to make a GPU accelereated version of autopano-sift-c. Andrew -- You received this message because you are subscribed to the Google Groups "hugin and other free panoramic software" group. A list of frequently asked questions is available at: http://wiki.panotools.org/Hugin_FAQ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/hugin-ptx
