High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search
Authors:
- Linjia HuLHLinjia Hu
- Saeid NooshabadiSNSaeid Nooshabadi
- 1 October 2019
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 132, 127-140
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- G-SHOT: GPU accelerated 3D local descriptor for surface matchingJournal of Visual Communication and Image Representation, 2015
- Massively parallel KD-tree construction and nearest neighbor search algorithms2015
- Exploiting Massive Parallelism for IndexingMulti-Dimensional Datasets on the GPUIEEE Transactions on Parallel and Distributed Systems, 2014
- Scalable Nearest Neighbor Algorithms for High Dimensional DataIEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
- Object Bank: An Object-Level Image Representation for High-Level Visual RecognitionInternational Journal of Computer Vision, 2013
- Unique Signatures of Histograms for Local Surface Description2010
- GPU-Accelerated Nearest Neighbor Search for 3D Registration2009
- Real-time KD-tree construction on graphics hardwareACM Transactions on Graphics, 2008
- A Graphics Hardware Accelerated Algorithm for Nearest Neighbor Search2006
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975