Parallel search of k-nearest neighbors with synchronous operations

2012 IEEE Conference on High Performance Extreme Computing, HPEC 2012

Volumn , Issue , 2012, Pages

  Sismanis, Nikos ^a   Pitsianis, Nikos ^a   Sun, Xiaobai ^b  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM ANALYSIS; BITONIC SORT; DATA LOCALITY; GRAPHICS PROCESSING UNIT; HIGH-DIMENSIONAL; K NEAREST NEIGHBOR (KNN); K-NEAREST NEIGHBORS; K-NN SEARCH; MANY-CORE PROCESSORS; NEW STUDY; PARALLEL SEARCH; PRIMITIVE OPERATIONS; PROGRAM STRUCTURES; SORT ALGORITHM; SYNCHRONOUS OPERATIONS;

ALGORITHMS; COMPUTER GRAPHICS EQUIPMENT; PROGRAM PROCESSORS;

COMPUTER GRAPHICS;

EID: 84873553818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPEC.2012.6408667     Document Type: Conference Paper

References (33)

1. T. M. Cover and P. Hart, "Nearest neighbor pattern classification," IEEE Transactions on Information Theory, vol. 13, no. 1, pp. 21-27, 1967.
2. M. Cooper, T. Lui, and E. Rieffel, "Video Segmentation via Temporal Pattern Classification," IEEE Transactions on Multimedia, vol. 9, no. 3, pp. 610-618, 2007. (Pubitemid 46479792)
3. A. Joly and O. Buisson, "Logo Retrieval with a Contrario Visual Query Expansion," in Proceedings of 17th ACM international conference on multimedia, ser. MM '09. ACM, 2009, pp. 581-584.
4. X. Luo, Y. Ouyang, and Z. Xiong, "Improving K-nearest neighborhood based Collaborative Filtering via Similarity Support," International Journal of Digital Content Technology and its Applications, vol. 5, pp. 248-256, 2011.
5. H. Jegou, M. Douze, and C. Schmid, "Hamming embedding and weak geometric consistency for large scale image search," in Proceedings of the 10th European Conference on Computer Vision: Part I, ser. ECCV '08. Springer-Verlag, Oct 2008, pp. 304-317.
6. L. Kuang and M. Zulkernine, "An anomaly intrusion detection method using CSI-KNN algorithm," in Proceeding of ACM symposium on Applied computing, ser. SEC '08, 2008, pp. 921-926.
7. S. Manne, S. K. Kotha, and S. S. Fratima, "A Query based Text Categorization using K-nearest neighbor Approach," International Journal of Computer Applications, vol. 32, no. 7, pp. 16-21, 2011.
8. J. H. Friedman, J. L. Bentley, and R. A. Finkel, "An Algorithm for Finding Best Matches in Logarithmic Expected Time," Journal of ACM Transactions on Mathematical Software, vol. 3, no. 2, pp. 209-226, 1977.
9. S. M. Omohundro, "Five Balltree Construction Algorithms," International Computer Science Institute, Berkeley, Tech. Rep., 1989.
10. J. Uhlmann, "Satisfying General Proximity/Similarity Queries with Metric Trees," Information Processing Letters, vol. 40, no. 4, pp. 175-179, 1991.
11. R. Weber, H.-J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," in Proceeding of the 24th International Conference on Very Large Data Bases, ser. VLDB '98. Morgan Kaufmann Publishers Inc., 1998, pp. 194-205.
12. J. Z. C. Lai, Y.-C. Liaw, and J. Liu, "Fast k-nearest-neighbor search based on projection and triangular inequality," Journal of Pattern Recog- nition, vol. 40, no. 2, pp. 351-359, 2007. (Pubitemid 44635639)
13. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in Proceedings of the thirtieth annual ACM symposium on Theory of computing, ser. STOC '98. ACM, 1998, pp. 604-613.
14. L. Paulev́e, H. Jegou, and L. Amsaleg, "Locality sensitive hashing: A comparison of hash function types and querying mechanisms," Pattern Recognition Letters, vol. 31, pp. 1348-1358, 2010.
15. R. J. Barrientos, J. I. Gómez, C. Tenllado, M. P. Matías, and M. Marín, "kNN Query Processing in Metric Spaces using GPUs," in Proceed- ings of the 17th international European Conference on Parallel and Distributed Computing, ser. Euro-Par '11, 2011, pp. 380-392.
16. V. Garcia, Eric Debreuve, F. Nielsen, and M. Barlaud, "K-Nearest Neighbor Search: Fast GPU-Based Implementation and Application to High-Dimensional Feature Matching," in Proceedings of IEEE 17th International Conference on Image Processing, ser. ICIP '10. IEEE Computer Society, 2010, pp. 3757-3760.
17. K. Kato and T. Hosino, "Solving k-Nearest Neighbor Problem on Multiple Graphics Processors," in Proceedings of 10th International Conference on Cluster, Cloud and Grid Computing, ser. CCGRID '10. IEEE Computer Society, 2010, pp. 769-773.
18. Q. Kuang and L. Zhao, "A Practical GPU Based kNN Algorithm," in Proceeding of the 2nd International Symposium on Computer Science and Computational Technology, ser. ISCSCT '09, vol. 7, no. 3, 2009, pp. 151-155.
19. S. Liang, Y. Lui, C. Wang, and L. Jian, "Design and Evaluation of a Parallel K-Nearest Neighbor Algorithm on CUDA-enabled GPU," in Proceedings of the 2nd IEEE Symposium of web Society, ser. SWS '10. IEEE Computer Society, 2010, pp. 53-60.
20. J. Pan and D. Manocha, "Fast GPU-based locality sensitive hashing for k-nearest neighbor computations," in Proceeding of the 19th Interna- tional Conference on Advances in Geographic Information Systems, ser. GIS '11, 2011, pp. 211-220.
21. D. G. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," International Journal of Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
22. "BelgaLogos images," 2007, http://www.belga.be/.
23. C. E. Leiserson, "Systolic Priority Queues," Department of Computer Science, Carnegie Mellon University, Tech. Rep., 1979.
24. R. M. Karp and V. Ramachandran, "A survey of parallel algorithms for shared-memory machines," University of California at Berkeley, Tech. Rep. CSD-88-408, 1988.
25. C. A. R. Hoare, "Algorithm 65: find," Commun. ACM, vol. 4, no. 7, 1961.
26. D. Knuth, The Art of Computer Programming, 3rd ed. Addison-Wesley, 1997, vol. 3.
27. T. Alabi, J. D. Blanchard, B. Gordin, and R. Steinbach, "Fast K-selection Algorithm for Graphics Processing Units," 2012, to appear in ACM Journal of Experimental Algorithms.
28. K. E. Batcher, "Sorting Networks and their Applications," in Proceed- ings of the spring joint computer conference, ser. AFIPS '68 (Spring). ACM, 1968, pp. 307-314.
29. H. S. Stone, "Parallel Processing with the Perfect Shuffle," IEEE transactions on computers, vol. c-20, no. 2, pp. 153-161, 1971.
30. NVIDIA CUDA CUBLAS Library, 4th ed., 2011, http://developer.nvidia.com/ nvidia-gpu-computing-documentation.
31. D. Merrill and A. Grimshaw, "High Performance and Scalable Radix Sorting: A case study of implementing dynamic parallelism for GPU computing," Parallel Processing Letters, vol. 21, no. 02, pp. 245-272, 2011.
32. A. Vedaldi and B. Fulkerson, "VLFeat: An Open and Portable Library of Computer Vision Algorithms," 2008, http://www.vlfeat.org/.
33. C. Wu, "SiftGPU: A GPU implementation of scale invariant feature transform (SIFT)," University of North Carolina at Chapel Hill, 2012, http://cs.unc.edu/ccwu/siftgpu/.