Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Delaunay Walk For Fast Nearest Neighbor: Accelerating Correspondence Matching For Icp, James D. Anderson, Ryan M. Raettig, Joshua Larson, Clark N. Taylor, Thomas Wischgoll
Delaunay Walk For Fast Nearest Neighbor: Accelerating Correspondence Matching For Icp, James D. Anderson, Ryan M. Raettig, Joshua Larson, Clark N. Taylor, Thomas Wischgoll
Faculty Publications
Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of …
Robust Error Estimation Based On Factor-Graph Models For Non-Line-Of-Sight Localization, O. Arda Vanli, Clark N. Taylor
Robust Error Estimation Based On Factor-Graph Models For Non-Line-Of-Sight Localization, O. Arda Vanli, Clark N. Taylor
Faculty Publications
This paper presents a method to estimate the covariances of the inputs in a factor-graph formulation for localization under non-line-of-sight conditions. A general solution based on covariance estimation and M-estimators in linear regression problems, is presented that is shown to give unbiased estimators of multiple variances and are robust against outliers. An iteratively re-weighted least squares algorithm is proposed to jointly compute the proposed variance estimators and the state estimates for the nonlinear factor graph optimization. The efficacy of the method is illustrated in a simulation study using a robot localization problem under various process and measurement models and measurement …