A Nearest Neighbor Method for Efficient ICP

13 years 8 months ago

Download rcvlab.ece.queensu.ca

A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The reference point set

Michael A. Greenspan, Guy Godin

Real-time Traffic

3DIM 2001 | Image Processing | Iterative Closest Point | Nearest Neighbor | Nearest Neighbor Problem |

claim paper

» GPUAccelerated Nearest Neighbor Search for 3D Registration

» Efficient Visual Object Tracking with Online Nearest Neighbor Classifier

» Adaptive Dual AKD Tree Search Algorithm for ICP Registration Applications

» BoostMap An Embedding Method for Efficient Nearest Neighbor Retrieval

» Conceptual Partitioning An Efficient Method for Continuous Nearest Neighbor Monitoring

» Cached kd tree search for ICP algorithms

» Adaptive Nearest Neighbor Classifier Based on Supervised Ellipsoid Clustering

» Two ellipsebased pruning methods for group nearest neighbor queries

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	3DIM
Authors	Michael A. Greenspan, Guy Godin

Comments (0)

Sciweavers

A Nearest Neighbor Method for Efficient ICP

3DIM 2001 | Image Processing | Iterative Closest Point | Nearest Neighbor | Nearest Neighbor Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers