2020
DOI: 10.1109/tcsii.2020.3013758
|View full text |Cite
|
Sign up to set email alerts
|

Efficient FPGA Implementation of K-Nearest-Neighbor Search Algorithm for 3D LIDAR Localization and Mapping in Smart Vehicles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Compared to visual SLAM, only a few studies have considered an FPGA acceleration of LiDAR SLAM despite its importance and widespread use. In [46], a novel voxelbased data structure for hierarchical point cloud partitioning is proposed, and an FPGA-based KNN (k-nearest neighbor) accelerator for 3D point cloud matching is also presented. Though the accelerator provides orders of magnitude faster search speed than CPU counterpart while consuming less energy, its performance effects on 3D LiDAR SLAM are not evaluated.…”
Section: Related Workmentioning
confidence: 99%
“…Compared to visual SLAM, only a few studies have considered an FPGA acceleration of LiDAR SLAM despite its importance and widespread use. In [46], a novel voxelbased data structure for hierarchical point cloud partitioning is proposed, and an FPGA-based KNN (k-nearest neighbor) accelerator for 3D point cloud matching is also presented. Though the accelerator provides orders of magnitude faster search speed than CPU counterpart while consuming less energy, its performance effects on 3D LiDAR SLAM are not evaluated.…”
Section: Related Workmentioning
confidence: 99%
“…The set consisting of the class label of each sample in the set can be denoted as L = fC i ji = 1, 2, ⋯, mg. The test sample set is denoted as S = fS i = ðs i1 , s i2 , ⋯s in Þji = 1, 2, ⋯, ag, where a is the number of test samples [16,17]. Then, KNN classification calculation, where a is the number of test samples.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In (Sun et al, 2020) a new data structure with a spatial partitioning method was presented, which can be successfully built even for large volumes of point clouds. Based on this structure, a KNN search algorithm was developed that works effectively when the distribution of points is uneven.…”
mentioning
confidence: 99%