A resource-aware nearest-neighbor search algorithm for k-dimensional trees


Kd-tree search is widely used today in computer vision - for example in object recognition to process a large set of features and identify the objects in a scene. However, the search times vary widely based on the size of the data set to be processed, the number of objects present in the frame, the size and shape of the kd-tree, etc. Constraining the search interval is extremely critical for real-time applications in order to avoid frame drops and to achieve a good response time. The inherent parallelism in the algorithm can be exploited by using massively parallel architectures like many-core processors. However, the variation in execution time is more pronounced on such hardware (HW) due to the presence of shared resources and dynamically varying load situations created by applications running concurrently. In this work, we propose a new resource-aware nearest-neighbor search algorithm for kd-trees on many-core processors. The novel algorithm can adapt itself to the dynamically varying load on a many-core processor and can achieve a good response time and avoid frame drops. The results show significant improvements in performance and detection rate compared to the conventional approach while the simplicity of the conventional algorithm is retained in the new model.

Extracted Key Phrases

14 Figures and Tables

Cite this paper

@article{Paul2013ARN, title={A resource-aware nearest-neighbor search algorithm for k-dimensional trees}, author={Johny Paul and Walter Stechele and Manfred Kr{\"{o}hnert and Tamim Asfour and Benjamin Oechslein and Christoph Erhardt and Jens Schedel and Daniel Lohmann and Wolfgang Schr{\"{o}der-Preikschat}, journal={2013 Conference on Design and Architectures for Signal and Image Processing}, year={2013}, pages={80-87} }