KANN on the GPU with shifted sorting

High-Performance Graphics 2012, HPG 2012 - ACM SIGGRAPH / Eurographics Symposium Proceedings

Volumn , Issue , 2012, Pages 39-47

  Li, Shengren ^a   Simons, Lance ^a   Pakaravoor, Jagadeesh Bhaskar ^a   Abbasinejad, Fatemeh ^a   Owens, John D ^a   Amenta, Nina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANN ALGORITHM; APPROXIMATE NEAREST NEIGHBOR; DATA ACCESS PATTERNS; INPUT DATAS; PROBLEM INSTANCES; QUERY POINTS; SIMPLE METHOD; STATE-OF-THE-ART METHODS;

INTERACTIVE COMPUTER GRAPHICS; QUERY PROCESSING;

COMPUTER GRAPHICS EQUIPMENT;

EID: 84875906342     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.2312/EGGH/HPG12/039-047     Document Type: Conference Paper

References (29)

1. [AMN-98] ARYA S., MOUNT D. M., NETANYAHU N. S., SILVERMAN R., WU A. Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM 45 (Nov. 1998), 891-923. doi:10.1145/293347. 293348. 2.
2. [BDHK06] BUSTOS B., DEUSSEN O., HILLER S., KEIM D.: A graphics hardware accelerated algorithm for nearest neighbor search. In Proceedings of the 6th International Conference on Computational Science, Alexandrov V., van Albada G., Sloot P., Dongarra J., (Eds.), vol. 3994 of Lecture Notes in Computer Science. Springer Berlin/Heidelberg, May 2006, pp. 196-199. doi:10.1007/11758549-30. 2.
3. [BGTP10] BARRIENTOS R. J., GÓMEZ J. I., TENLLADO C., PRIETO M.: Heap based k-nearest neighbor search on GPUs. In Congreso Espanol de Informática (CEDI) (2010), pp. 559-566.
4. [Cha97] CHAN T. M.: Approximate nearest neighbor queries revisited. In Proceedings of the Thirteenth Annual Symposium on Computational Geometry (New York, NY, USA, 1997), SCG '97, ACM, pp. 352-358. doi:10.1145/262839.263001. 1.
5. [Cha02] CHAN T. M.: Closest-point problems simplified on the RAM. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2002), SODA '02, pp. 472-473.
6. [FD09] FABIANOWSKI B., DINGLIANA J.: Interactive global photon mapping. Computer Graphics Forum 28, 4 (2009), 1151- 1159. doi:10.1111/j.1467-8659.2009. 01492.x. 2.
7. [GDB08] GARCIA V., DEBREUVE E., BARLAUD M.: Fast k nearest neighbor search using GPU. In Proceedings of the CVPR Workshop on Computer Vision on GPU. IEEE Computer Society, Los Alamitos, CA, USA, June 2008, pp. 1-6. doi: 10.1109/CVPRW.2008.4563100. 2.
8. [HJ09] HACHISUKA T., JENSEN H. W.: Stochastic progressive photon mapping. ACM Transactions on Graphics 28, 5 (Dec. 2009), 1411-1418. doi:10.1145/1661412. 1618487. 2.
9. [HJ10] HACHISUKA T., JENSEN H. W.: Parallel progressive photon mapping on GPUs. In ACM SIGGRAPH ASIA 2010 Sketches (New York, NY, USA, Dec. 2010), SA '10, ACM, p. 54-1. doi: 10.1145/1899950.1900004. 2.
10. [KH12] KATO K., HOSINO T.: Multi-GPU algorithm for knearest neighbor problem. Concurrency and Computation: Practice and Experience 24, 1 (2012), 45-53. doi:10.1002/cpe. 1718.
11. [KZ09] KUANG Q., ZHAO L.: A practical GPU based KNN algorithm. In Proceedings of the Second Symposium on International Computer Science and Computational Technology (ISCSCT '09) (Dec. 2009), Academy Publisher, pp. 151-155.
12. [LGS-09] LAUTERBACH C., GARLAND M., SENGUPTA S., LUEBKE D., MANOCHA D.: Fast BVH construction on GPUs. Computer Graphics Forum 28, 2 (2009), 375-384.
13. [LLL01] LIAO S., LOPEZ M. A., LEUTENEGGER S. T.: High dimensional similarity search with space filling curves. In Proceedings of the 17th International Conference on Data Engineering (2001), pp. 615-622.
14. [LTF-12] LEITE P., TEIXEIRA J., FARIAS T., REIS B., TEICHRIEB V., KELNER J.: Nearest neighbor searches on the GPU. International Journal of Parallel Programming 40 (2012), 313- 330. doi:10.1007/s10766-011-0184-3.
15. [MG11] MERRILL D., GRIMSHAW A.: High performance and scalable radix sorting: A case study of implementing dynamic parallelism for GPU computing. Parallel Processing Letters 21 (June 2011), 245-272. doi:10.1142/ S0129626411000187.
16. [ML09a] MCGUIRE M., LUEBKE D.: Hardware-accelerated global illumination by image space photon mapping. In High Performance Graphics 2009 (New York, NY, USA, Aug. 2009), ACM, pp. 77-89. doi:10.1145/1572769.1572783.
17. [ML09b] MUJA M., LOWE D. G.: Fast approximate nearest neighbors with automatic algorithm configuration. In International Conference on Computer Vision Theory and Application VISSAPP'09) (2009), INSTICC Press, pp. 331-340.
18. [ML11a] MUJA M., LOWE D. G.: FLANN - Fast Library for Approximate Nearest Neighbors: User Manual. The University of British Columbia, December 2011. URL: http://people.cs.ubc.ca/~mariusm/uploads/FLANN/flann-manual-1.7.1.pdf. 6.
19. [ML11b] MUJA M., LOWE D. G.: FLANN-fast library for approximate nearest neighbors. http://www.cs.ubc.ca/~mariusm/index.php/FLANN/FLANN, 2011. [Version 1.7.1].
20. [MM02] MA V. C. H., MCCOOL M. D.: Low latency photon mapping using block hashing. In Graphics Hardware (Aire-la- Ville, Switzerland, Switzerland, Sept. 2002), Eurographics Association, pp. 89-99. URL: http://portal.acm.org/citation. cfm?id=569046.569059.
21. [NVI12] NVIDIA: Nvidia OptiX ray tracing engine. http://developer.nvidia. com/optix-interactive-examples, 2012. [Version 2.1].
22. [Ope] OPENCV: Open source computer vision library. http://opencv. willowgarage.com/wiki/Welcome.
23. [PCL] PCL: The point cloud library. http://pointclouds.org/documentation/ .
24. [PDC-03] PURCELL T. J., DONNER C., CAMMARANO M., JENSEN H. W., HANRAHAN P.: Photon mapping on programmable graphics hardware. In Graphics Hardware 2003 (July 2003), pp. 41-50.
25. [PLM10] PAN J., LAUTERBACH C., MANOCHA D.: Efficient nearest-neighbor computation for GPU-based motion planning. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (Oct. 2010), pp. 2243-2248. doi:10.1109/IROS.2010.5651449. 2.
26. [QMN09] QIU D., MAY S., NÜCHTER A.: GPU-accelerated nearest neighbor search for 3D registration. In Computer Vision Systems, Fritz M., Schiele B., Piater J., (Eds.), vol. 5815 of Lecture Notes in Computer Science. Springer Berlin/Heidelberg, 2009, pp. 194-203. doi:10.1007/978-3-642-04667-4-20.
27. [WWZ-09] WANG R., WANG R., ZHOU K., PAN M., BAO H.: An efficient GPU-based approach for interactive global illumination. ACM Transactions on Graphics 28, 3 (July 2009), 911- 918. doi:10.1145/1576246.1531397. 2.
28. [ZGHG11] ZHOU K., GONG M., HUANG X., GUO B.: Dataparallel octrees for surface reconstruction. IEEE Transactions on Visualization and Computer Graphics 17 (May 2011), 669-681. doi:10.1109/TVCG.2010.75.
29. [ZHWG08] ZHOU K., HOU Q., WANG R., GUO B.: Real-time KD-tree construction on graphics hardware. ACM Transactions on Graphics 27 (Dec. 2008), 1261-126. doi:10.1145/1409060.1409079.