Skip to main content
SpringerLink
Log in

Fast k-Nearest Neighbor Searching in Static Objects

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The k-nearest neighbor searching is a classical problem that has been seriously studied, due to its many important applications. The paper proposes an efficient algorithm to search the k-nearest neighbors for static objects. Since locations of static objects are known in advance and not changed, most of existing solutions build a kd-tree as a preprocessing and search the k- nearest neighbors by using it. We propose a completely different preprocessing with kd-trees. The core idea of this paper is to build in advance the k-nearest neighbors of each static object as a preprocessing. If a querying point q is given, the nearest object p of q is firstly searched and then the k-nearest neighbors of q are found by using the k-nearest neighbors of p. It is to use the feature that two objects may share many neighbors if they are spatially close to each other. In order to measure the performance of the proposed algorithm, we have a number of experiments. The results of experiments showed that the proposed algorithm is 2–3 times quicker than the method using kd-tree in the Point Cloud Library(PCL).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Lee, K. W., Choi, D. W., & Chung, C. W. (2014). DART+: Direction-aware bichromatic reverse k nearest neighbor query processing in spatial databases. Journal of Intelligent Information Systems, 43(2), 349–377.

    Article  Google Scholar 

  2. Califano, A., & Mohan, R. (1994). Multidimensional index for recognizing visual shapes. IEEE Transaction on Pattern Analysis and Machine Intelligence, 16, 373–392.

    Article  Google Scholar 

  3. Lampert, C. H., Blaschko, M. M. & Hofmann, T. (2008). Beyond sliding windows: Object localization by efficient subwindow search. In IEEE conference on computer vision and pattern recognition (CVPR), pp. 1–8.

  4. Gotoh, Y. (2014). A simple routing method for reverse k-nearest neighbor queries in spatial networks. In 17th international conference on network-based information systems (NBiS), pp. 615–620.

  5. Zhang, H., Reardon, C., & Parker, L. E. (2013). Real-time multiple human perception with color-depth cameras on a mobile robot. IEEE Transactions on Cybernetics B (TMSC-B), 43(4), 1429–1441.

    Article  Google Scholar 

  6. Caraway, N. M., McCreight, J. L., & Rajagopalan, B. (2014). Multisite stochastic weather generation using cluster analysis and k-nearest neighbor time series resampling. Journal of Hydrology, 508(16), 197–213.

    Article  Google Scholar 

  7. Steed, T. C., Treiber, J. M., Patel, K. S., Taich, Z., White, N. S., Treiber, M. L., et al. (2015). Iterative probabilistic voxel labeling: Automated segmentation for analysis of the cancer imaging archive glioblastoma images. American Society of Neuroradiology, 36(4), 678–685.

    Article  Google Scholar 

  8. Yue, J., Wang, Y., Li, Z., Zhang, Z., & Hou, J. (2014). A new image retrieval method based on k-nearest neighbor multistage and multiple features. Sensor Letters, 12(3–5), 479–484.

    Article  Google Scholar 

  9. Nguyen, Huy, Viennot, Simon, & Ikeda, Kokolo. (2015). Fast optimization of the pattern shapes in board games with simulated annealing. Advances in Intelligent Systems and Computing, 326, 325–337.

    Article  Google Scholar 

  10. Nakagawa, Y., Yamamoto, K., & Thawonmas, R. (2014). Online adjustment of the AI’s strength in a fighting game using the k-nearest neighbor algorithm and a game simulator. In IEEE 3rd global conference on consumer electronics (GCCE), pp. 494–495.

  11. Wan, Q., Li, Y., Li, C., & Pal, R. (2014). Gesture recognition for smart home applications using portable radar sensors. In 36th annual international conference of the IEEE engineering in medicine and biology society (EMBC), pp. 6414–6417.

  12. Lee, Y., Wampler, K., Popović, J., & Popović, Z. (2014). Motion fields for interactive character locomotion. Communications of the ACM, 57(6), 101–108.

    Article  Google Scholar 

  13. Huang, Y. K., & He, Z Han. (2015). Processing continuous K-nearest skyline query with uncertainty in spatio-temporal databases. Journal of Intelligent Information Systems, 45(2), 165–186.

    Article  MathSciNet  Google Scholar 

  14. Gu, Y., Yu, G., & Yu, X. (2014). An efficient method for k nearest neighbor searching in obstructed spatial databases. Journal of Information Science and Engineering, 30, 1569–1583.

    Google Scholar 

  15. Zhong, R. et al. (2013). G-tree: An efficient index for knn search on road networks. In Proceedings of the 22nd ACM international conference on conference on information & knowledge management. ACM, pp. 39–48.

  16. Yi, X., Paulet, R., Bertino, E., & Varadharajan, V. (2014). Practical k nearest neighbor queries with location privacy. In IEEE 30th international conference on data engineering (ICDE), pp. 640–651.

  17. Qu, Y., Fang, J., & Zhang, S. (2012). Identifying neighbor and connectivity of wireless sensor networks with poisson point process. Wireless Personal Communications, 64(4), 795–809.

    Article  Google Scholar 

  18. Ranga, V., Dave, M., & Verma, A. K. (2013). Network partitioning recovery mechanisms in WSANs: A survey. Wireless Personal Communications, 72(2), 857–917.

    Article  Google Scholar 

  19. Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. ACM SIGMOD Rec, 14(2), 47–57.

    Article  Google Scholar 

  20. Rusu, R. B., & Cousins, S. (2011). 3D is here: Point cloud library (PCL). In IEEE international conference on robotics and automation (ICRA). Shanghai, China, pp. 1–4.

  21. Wolfson, H. J., & Rigoutsos, I. (1997). Geometric hashing: An overview. IEEE Computational Science and Engineering, 4, 10–21.

    Article  Google Scholar 

  22. Yen, S. H., Shih, C. Y., Li, T. K., & Chang, H. W. (2010). Applying multiple KD-trees in high dimensional nearest neighbor searching. International Journal of Circuits, Systems and Signal Processing, 4(4), 153–160.

    Google Scholar 

  23. Yu, X., Pu, K. Q., & Koudas, N. (2005). Monitoring k-nearest neighbor queries over moving objects. In 21st international conference on data engineering, pp. 631–642.

  24. Bentley, J. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18, 509–517.

    Article  MATH  Google Scholar 

  25. Boubou, S., & Suzuki, E. (2015). Classifying actions based on histogram of oriented velocity vectors. Journal of Intelligent Information Systems, 44(1), 49–65.

    Article  Google Scholar 

  26. Ku, W. S., Chen, Y., & Zimmermann, R. (2009). Privacy protected spatial query processing for advanced location based services. Wireless Personal Communications, 51(1), 53–65.

    Article  Google Scholar 

  27. Nguyen, V. G., Do, T. X., & Kim, Y. H. (2016). SDN and virtualization-based LTE mobile network architectures: A comprehensive survey. Wireless Personal Communications, 86, 1401–1438.

    Article  Google Scholar 

  28. Mouratidis, K., Hadjieleftheriou, M., & Papadias, D. (2005). Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In Proceedings of ACM SIGMOD international conference on management of data, pp. 634–645.

  29. Ma, J., Song, W. G., Zhang, J., Lo, S. M., & Liao, G. X. (2010). k-nearest-neighbor interaction induced self-organized pedestrian counter flow. Physica A, 389, 2101–2117.

    Article  Google Scholar 

  30. Lee, J. M. (2010). An efficient algorithm to find k-nearest neighbors in flocking behavior. Information Processing Letters, 110, 576–579.

    Article  MathSciNet  MATH  Google Scholar 

  31. Reynolds, C. W. (1987). Flocks, herds, and schools: A distributed behavioral model. SIGGRAPH, 21(4), 25–34.

    Article  Google Scholar 

  32. Olfati-Saber, R. (2006). Flocking for multi-agent dynamic systems: algorithms and theory. IEEE Transaction on Automatic Control, 51(3), 401–420.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This research was financially supported by Hansung University.

Author information

Authors and Affiliations

  1. Division of Computer Engineering, Hansung University, Seoul, Korea

    Jae Moon Lee

Authors
  1. Jae Moon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jae Moon Lee.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lee, J.M. Fast k-Nearest Neighbor Searching in Static Objects. Wireless Pers Commun 93, 147–160 (2017). https://doi.org/10.1007/s11277-016-3524-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3524-1

Keywords

Search

Navigation