scispace - formally typeset
Journal ArticleDOI

B-SHOT: a binary 3D feature descriptor for fast Keypoint matching on 3D point clouds

Reads0
Chats0
TLDR
A comprehensive evaluation on standard benchmarks reveals that B-SHOT offers comparable keypoint matching performance to that of the state-of-the-art real valued 3D feature descriptors, albeit at dramatically lower computational and memory costs.
Abstract
We present the first attempt in creating a binary 3D feature descriptor for fast and efficient keypoint matching on 3D point clouds. Specifically, we propose a binarization technique and apply it on the state-of-the-art 3D feature descriptor, SHOT (Salti et al., Comput Vision Image Underst 125:251–264, 2014) to create the first binary 3D feature descriptor, which we call B-SHOT. B-SHOT requires 32 times lesser memory for its representation while being six times faster in feature descriptor matching, when compared to the SHOT feature descriptor. Next, we propose a robust evaluation metric, specifically for 3D feature descriptors. A comprehensive evaluation on standard benchmarks reveals that B-SHOT offers comparable keypoint matching performance to that of the state-of-the-art real valued 3D feature descriptors, albeit at dramatically lower computational and memory costs.

read more

Citations
More filters
Journal ArticleDOI

The Iterative Closest Point Registration Algorithm Based on the Normal Distribution Transformation

TL;DR: In this paper, the authors proposed an iterative closest registration based on the normal distribution transform (NDT-ICP), which uses NDT as the coarse registration algorithm, and does not need to consume a large price to find the nearest neighbor matching points, which speeds up the registration speed.
Journal ArticleDOI

BRoPH: An efficient and compact binary descriptor for 3D point clouds

TL;DR: BRoPH is generated directly from point cloud by turning the description of 3D point cloud into a series binarization of 2D image patches and achieves about 14 times more compact, 28 and 4 times more faster in terms of describing and matching time respectively, than the average performance of the compared floating descriptors.
Journal ArticleDOI

Variance-Minimization Iterative Matching Method for Free-Form Surfaces—Part I: Theory and Method

TL;DR: A new method called variance-minimization matching (VMM), in which the objective function is optimized to weaken the effect of measuring defects, is proposed, which can achieve quadratic convergence speed and be insensitive to uneven/open point distributions.
Journal ArticleDOI

Relocalization With Submaps: Multi-Session Mapping for Planetary Rovers Equipped With Stereo Cameras

TL;DR: A relocalization pipeline which exploits both 3D and visual information from stereo cameras to detect matches across local point clouds of multiple SLAM sessions and is based on a Bag of Binary Words scheme where binarized SHOT descriptors are enriched with visual cues to recall in a fast and efficient way previously visited places.
Journal ArticleDOI

Approximate Intrinsic Voxel Structure for Point Cloud Simplification

TL;DR: In this paper, an approximate intrinsic Voxel Structure (AIVS) based point cloud simplification method is proposed to meet the diverse demands in real-world application scenarios, which includes point cloud pre-processing (denoising and down-sampling), AIVS-based realization for isotropic simplification and flexible simplification with intrinsic control of point distance.
References
More filters
Journal ArticleDOI

Distinctive Image Features from Scale-Invariant Keypoints

TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
Journal ArticleDOI

Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

TL;DR: New results are derived on the minimum number of landmarks needed to obtain a solution, and algorithms are presented for computing these minimum-landmark solutions in closed form that provide the basis for an automatic system that can solve the Location Determination Problem under difficult viewing.
Journal ArticleDOI

A method for registration of 3-D shapes

TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Journal ArticleDOI

A performance evaluation of local descriptors

TL;DR: It is observed that the ranking of the descriptors is mostly independent of the interest region detector and that the SIFT-based descriptors perform best and Moments and steerable filters show the best performance among the low dimensional descriptors.
Proceedings ArticleDOI

3D is here: Point Cloud Library (PCL)

TL;DR: PCL (Point Cloud Library) is presented, an advanced and extensive approach to the subject of 3D perception that contains state-of-the art algorithms for: filtering, feature estimation, surface reconstruction, registration, model fitting and segmentation.
Related Papers (5)