Evaluating Local Geometric Feature Representations for 3D Rigid Data Matching

06/29/2019 ∙ by Jiaqi Yang, et al. ∙ 0

Local geometric descriptors remain an essential component for 3D rigid data matching and fusion. The devise of a rotational invariant local geometric descriptor usually consists of two steps: local reference frame (LRF) construction and feature representation. Existing evaluation efforts have mainly been paid on the LRF or the overall descriptor, yet the quantitative comparison of feature representations remains unexplored. This paper fills this gap by comprehensively evaluating nine state-of-the-art local geometric feature representations. Our evaluation is on the ground that ground-truth LRFs are leveraged such that the ranking of tested feature representations are more convincing as opposed to existing studies. The experiments are deployed on six standard datasets with various application scenarios (shape retrieval, point cloud registration, and object recognition) and data modalities (LiDAR, Kinect, and Space Time) as well as perturbations including Gaussian noise, shot noise, data decimation, clutter, occlusion, and limited overlap. The evaluated terms cover the major concerns for a feature representation, e.g., distinctiveness, robustness, compactness, and efficiency. The outcomes present interesting findings that may shed new light on this community and provide complementary perspectives to existing evaluations on the topic of local geometric feature description. A summary of evaluated methods regarding their peculiarities is also presented to guide real-world applications and new descriptor crafting.



There are no comments yet.


page 1

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

The era of pervasive 3D technologies has arrived [1], with 3D data acquisition systems ranging from classical LiDAR scanner to commodity depth sensors such as Microsoft Kinect and Space Time cameras. Similar to the trend for 2D image fusion [2, 3], great research efforts have characterized the realm of 3D rigid data (e.g., point clouds and meshes) matching and fusion (a.k.a, registration) with a number of real-world applications such as point cloud registration [4, 5], 3D reconstruction [6], 3D object recognition [7, 8], localization [9], and cultural heritage [10]. Methods for 3D rigid data matching and fusion can be categorized as local and global. The arguably most well-known local method is the iterative closest points (ICP) [11] algorithm, but it suffers from the limitation of converging to the local minimum frequently without good initialization. For global methods, correspondences-based approaches [12, 13, 14] have become a de-facto solution for many applications [15]

. The establishment of point-to-point correspondences between 3D rigid shapes critically relies on the quality of the local geometric feature descriptor, whose goal is to comprehensively represent the contained geometric and spatial information within a local surface by a feature vector.

Usually, a local reference frame (LRF) is first constructed in the local surface to on one hand make the descriptor rotational invariant and on the other encode the 3D spatial information such as to enhance the distinctiveness of the descriptor. Examples include signatures of histograms of orientations (SHOT) [7], rotational contour signatures (RCS) [16], and local voxelized structure (LoVS) [17]. There are also some local geometric descriptors without LRF, e.g., spin images [18] and 3D shape context (3DSC) [19]. However, LRF-based descriptors have generally surpassed those LRF-independent ones on most publicly available datasets [20]

and the LRF-based feature representation approaches have a vaster devising corpus. Despite traditional local feature descriptors, there are also some deep-learning-based descriptors such as PointNet 

[21], 3DMatch [22], CGF [23], PPFNet [24], PPF-FoldNet [25], and 3DFeat-Net [26]. Unfortunately, most of existing learned descriptors are still sensitive to rotation [25] and thus may limit their applications in real-world scenarios. Although CGF and PPF-FoldNet are rotational invariant, both descriptors take traditional feature representations to parametrize the input. Given above analysis, this paper concentrates on traditional LRF-based feature representations (Fig. 1).

Fig. 1: Illustration of local geometric feature representation. Left: a local surface (data within the red sphere) around a keypoint (the red dot) on a 3D rigid model. Middle: the construction of LRF to achieve independence from the world coordinate system (WCS). Right: encoding the geometric and spatial information in the transformed local surface with respect to the LRF via a feature vector (the focus of this evaluation).

To demonstrate the significance of our evaluation, we are amenable to answer the following questions.

1) Why are traditional feature representations still important? Admittedly, deep-learning-based descriptors have outperformed many traditional local geometric descriptors in 2.5D scene registration context [22, 25]. The majority of current learned descriptors from raw point cloud data suffer from the sensitivity to rotation. An effective solution to this problem in both rigid (e.g., CGF [23] and PPF-FoldNet [24]) and non-rigid (e.g., [27] and [28]

) fields is first using traditional feature descriptors for parametrization and then employing convolutional neural networks to further boost the performance. Consequently, the performance of these rotational-invariant learned descriptors critically relies on the quality of their used traditional feature representations. In addition, traditional LRF-based descriptors are still very competitive on tasks such as multi-point-cloud registration 

[6] and 3D object recognition [29].

2) Why have not existing evaluations addressed this concern? As illustrated in Fig. 1, the devise of a local descriptor usually contains two steps, i.e., LRF establishment and feature representation. Existing evaluations [20] mainly concentrate on the overall descriptors. This can tell us which descriptors are better but with limited insights to know which part makes it better. Explaining this is critical for assessing the quality of point attributes, e.g., normals [7], point densities [8, 13], and signed distance [30, 31], for feature representation. For the evaluation of LRF, some studies have already been conducted [32, 33, 34]. But no study yet, to the best of our knowledge, has been conducted to specifically assess the quality of existing feature representations. The goal of this evaluation is to fill this gap and provide complementary insights to existing evaluations of LRFs [34] and descriptors [20].

3) What benefits can this evaluation bring to the community? This paper will consider nine state-of-the-art feature representations and abstract their core computational steps and ideas. It will therefore help the researchers to understand existing literature more deeply and devise either solid improvements based on existing methods or ground-breaking new approaches. In addition, the quantitative comparison makes it clear to the community about the trait of each feature representation. Based on current evaluations for LRFs [32, 33, 34], new descriptors can be proposed by simply replacing more proper feature representations under existing frames. Finally, this evaluation is beneficial for deep-learning-based descriptors because more reliable choices can be made regarding the selection of rotation invariant feature representations as the input for learning, rather than empirical selection [23].

Motivated by above considerations, this paper first abstracts the core ideas and computational steps of nine state-of-the-art local geometric feature representations and then comprehensively evaluates their performance on six standard datasets. The feature representations considered in this paper are mainly based on their popularity and state-of-the-art performance. Because these methods are originally based on different LRFs, we specifically use ground-truth LRFs in this evaluation to eliminate the effect of LRF calculation errors and independently assess the quality of different feature representations. Note that we will still consider the effect of LRF errors in experiments because LRFs are not guaranteed to be fully repeatable especially in point cloud registration and object recognition applications [34], but such errors are made identical for all feature representations to ensure a fair comparison. Our evaluation covers four major concerns for a feature representation. First, distinctiveness is tested on experimental datasets with different data modalities (i.e., LiDAR, Kinect, and Space Time) and application contexts (i.e., shape retrieval, point cloud registration, and object recognition). Second, robustness is thoroughly tested with respect to a rich variety of nuisances including Gaussian noise, shot noise, data decimation, clutter, occlusion, and limited overlap. Third, compactness is assessed by taking both storage and feature matching performance into consideration on all datasets. Forth, computational efficiency regarding different scales of local surface is evaluated. Based on the experimental outcomes, we summarize the peculiarities, merits, and demerits of selected methods for evaluation. In a nutshell, this paper has three main contributions.

  • An abstraction of nine state-of-the-art local geometric feature representations regarding their core ideas and computational steps, which may help researchers to highlight the blind spots in this realm and devise new feature descriptors.

  • A comprehensive evaluation of several feature representations in terms of distinctiveness, robustness, compactness, and computational efficiency on six datasets with various data modalities, application scenarios, and nuisances. This evaluation presents complementary perspectives to [20, 34] on the topic of local geometric feature description.

  • A summary of the peculiarities, advantages, and shortcomings of selected methods for evaluation that will provide instructive information to the developers in real-world applications and are inspiring to the following researchers.

The remainder of this paper is structured as follows. Sect. II gives a review of 3D local geometric descriptors and relevant evaluations. Sect. III presents the taxonomy and description of selected feature representations for evaluation. Sect. IV introduces the experimental datasets, challenges, metrics, and implementation details. Sect. V reports the experimental results with necessary discussions and explanations. Sect. VI gives a summary of tested methods with respect to their traits, merits, and demerits. The conclusions are finally drawn in Sect. VII.

Ii Related Work

This section presents a brief review of existing local geometric feature representations and relevant evaluations on the topic of local feature descriptors for 3D rigid data.

Ii-a Local Geometric Feature Representations

Traditional methods. Classical local geometric descriptors are either based on an LRF or not. As we concentrate on the feature representation stage, we will give more details to the feature representations of traditiaonal local geometric descriptors and ignore their employed LRFs (if used). A comprehensive overview of existing LRFs is available in [34].

For LRF-independent methods, spin images (SI) [18] projects the neighboring points of a keypoint on a 2D plane by calculating their horizontal and vertical distances with respect to the tangent plane of the keypoint normal, and the ratio of points in each 2D grid is taken as the bin value. Local surface patches (LSP) [35], similar to SI, projects 3D points to 2D as well but the projection is conducted in a latent feature space. Point feature histograms (PFH) [4] and Fast PFH (FPFH) [36]

leverage the point pair features extracted from the local surface to generate statistical histograms, where PFH considers all possible point pairs but FPFH speeds up the procedure by requiring each point pair to include the keypoint. Local feature statistics histograms (LFSH) 

[5] fuses three histograms of normal deviation, signed distance, and point densities into a single feature vector. Due to the lack of spatial information, above features usually suffer from limited descriptiveness [8].

For LRF-based methods, point signatures (PS) [37] first intersects the surface with a sphere to extract boundary points of the local surface and then computes the distance of the boundary points to the tangent plane of the keypoint normal in a clockwise order. Snapshots [30] first projects the local surface on a 2D plane in the LRF and then splits the 2D map into uniform grid; the feature value of each grid is the minimum signed projection distance of the points within the grid to the 2D plane. Later, triple orthogonal local depth images (TOLDI) [31] improves snapshots by computing three orthogonal local depth images to achieve a more comprehensive feature characterization. SHOT [7] divides the local 3D volume into a set of subspaces and concatenates the histograms of normal deviation in each subspace as the final feature representation. Unique shape context (USC) [38] partitions the local spherical volume along the radial, azimuth, and elevation directions and computes the point density for each partition as the feature value. Rotational projections statistics (RoPS) [8] proposes a “rotation and projection” mechanism that continually rotates the local surface with respect to the LRF and performs 3D-to-2D projection for each rotated surface; the eventual feature is the integration of the statistical information of the projected maps. Similar features based on “rotation and projection” include rotational contour signatures (RCS) [16] and rotational silhouette maps (RSM) [39], where contour and silhouette cues of the 2D projection map are encoded, respectively. Triple spin images (TriSI) [13] is a variant of SI [18] that concatenates three spin images calculated with respect to the three axes of the LRF, showing a great improvement over SI. Unlike the spherical volume used in most features, signatures of geometric centroids (SGC) [40] and LoVS [17] instead employ a cubic volume to determine the local surface and they perform uniform spatial partition in the cubic volume to generate a set of voxels. SGC encode each voxel by the centroid and number of the points in the voxel, while LoVS simply uses a binary code to judge whether the voxel is empty or not. The leverage of spatial information for LRF-based methods greatly enhances their performance, yet, the quality of each feature representation remains unclear due to the lack of a comprehensive benchmarking comparison.

Deep-learning-based methods. 3DMatch [22] is a pioneer learning-based representation that uses truncated distance function (TDF) to parametrize input local patches and learns the feature representation using a Siamese network paired with a metric learning network. CGF [23] first parametrizes the local surface with a traditional feature representation and then utilizes a multi-layer perception (MLP) network as the feature embedding to shorten the initial feature as well as boost its distinctiveness. PPFNet [24] employs the point pair features between the keypoint and its neighbors to encode the raw local point cloud and proposes an N-branch network for feature learning. PPF-FoldNet [24] further improves PPFNet by leveraging rotational invariant point pair features and uses a point cloud auto-encoder network to achieve unsupervised feature learning. 3DFeat-Net [26] takes the whole point cloud as input and leverages an attention-based mechanism to simultaneously learn keypoints and descriptors. Deep-learning-based methods show great improvements over traditional methods in scene registration scenario, but most of them cannot generalize well and are sensitive to rotation [24], limiting their effectiveness in real-world applications.

Ii-B Relevant Evaluations

Sukno et al. [41] performed a performance evaluation of local geometric descriptors for craniofacial landmarks on a set of point clouds for clinical study. Kim and Hilton [42] presented a comparison of four local geometric descriptors for the registration of multi-modal data. Guo et al. [20] presented a quantitative evaluation of ten local geometric feature descriptors from different perspectives. This evaluation is closely related to this work but it pays attention to the overall feature descriptor rather than the particular feature representation. Buch et al. [43] evaluated the feature matching and object recognition performance when utilizing multiple different local descriptors for fusion. Yang et al. [44] quantitatively evaluated the effect of encoding different spatial information on the distinctiveness and robustness of local geometric features.

There are also some evaluation studies for the LRF. Petrelli and Stefano [32] gave a study of LRF errors on the feature matching performance of local descriptors and evaluated the repeatability performance of seven LRFs in partial shape matching context. They later proposed a new metric to more accurately test the repeatability of an LRF and evaluated two additional LRFs on a variety of datasets [33]. In addition to the concern of repeatability, Yang et al. [34] presented an extensive evaluation of eight LRFs regarding their repeatability, robustness, efficiency, and feature matching performance when equipped with identical feature representations on six datasets.

Above evaluation studies either focus on the LRF or the overall descriptor, yet the overall quality of existing feature representations remains unclear.

Iii Considered Feature Representations

Generic 3D keypoint
The local spherical volume around
A radius neighbor of
The local cubic volume around
A cubic neighbor of
Normal vector of
LRF at
TABLE I: Notations.

This section introduces the main ideas and computational stages of nine local geometric feature representations, i.e., SHOT [7], USC [38], RoPS [8], TriSI [13], SGC [40], TOLDI [31], RCS [16], LoVS [17], and RSM [39]. We choose these representations based on their popularity and state-of-the-art performance. According to the taxonomy in [15], they are either based on histogram or signature. We note that the abbreviations used for each methods here and hereinafter indicate the feature representation of the descriptor rather than the overall descriptor, and in the following description for each method we assume that LRFs are already available (we will use ground-truth LRFs in the experiments).

To help better understanding each feature representation, a schematic illustration of each method is shown in Fig. 2 and some notations used for method introduction are reported in Table I.

Iii-a Histogram-based Methods

Histogram-based methods describe the local surface through spatial distribution histogram, geometric attribute histogram, or a hybrid of them with spatial/geometric cues such as point numbers and surface normals.

SHOT [7]. It takes hint from the SIFT [45] image descriptor that first splits the whole local volume into a set of subspaces and then calculates an attribute histogram for each subspace.

First, is divided into sub-volumes along the radial, azimuth, and elevation axes. Then, for each point in a particular sub-volume, the cosine of the deviation angle between its normal and the -axis of is calculated that will be later used for binning over the cosine space. Using cosine value instead of the deviation angle also speeds up the attribute extraction process. Finally, an attribute histogram with bins is computed for each sub-volume and all histograms are concatenated as the -dimensional SHOT representation.

USC [38]. Shape context is a well-known descriptor for 2D shape recognition [46]. USC extends it to 3D by collecting 3D point distribution information.

First, it splits into bins with respectively and equally spaced boundaries in the azimuth and elevation directions but logarithmically spaced boundaries in the radial direction. Neighboring points near to are discarded to avoid being susceptive to small variations in shape close to the keypoint. Second, a weight is calculated for each neighboring point as:


where , , and represent the bin index of radial, elevation, and azimuth partitions, respectively; is the volume of bin ; is the local point density of , i.e., the number of points in a small sphere centered at . The bin value is the accumulation of the weights of points falling inside the bin. By concatenating all bin values, the final -dimensional feature is obtained.

RoPS [8]. This is the first method based on the “rotation and projection” mechanism, in oder to capture multi-view information represented by multiple 2D point distribution maps. RoPS is originally proposed for 3D object recognition [8] but also revealed to be very effective for surface registration [47].

Fig. 2: Schematic illustration of considered feature representations.

Let be the local surface inside . First, is rotated around each coordinate axis of by a set of discrete angles ,,,. Then, the rotate surface, e.g., , are projected on the , , and planes of the , creating three distribution maps that are further bounded by 2D rectangles. For each 2D distribution map, it is divided into

grids, and the central moment and Shannon entropy are employed to describe the distribution map. Specifically, the central moment

for matrix with an order of is defined as:


where and . The Shannon entropy is defined as:


RoPS finally chooses 5 combinations of these statistics and integrates the statistical information of all distribution maps for feature description with a dimensionality of .

TriSI [13]. TriSI is a variant of the spin image descriptor [18] that generates three spin images around different spinning axes to achieve a comprehensive information description, showing great improvements over spin image [20].

It maps 3D points to a 2D space represented by two parameters, i.e., and . In particular, the definitions of the two parameters are given as:


where is chosen as the -axis, -axis, and -axis of the LRF , respectively. By partitioning each projection with grids, three spin images are generated. The concatenation of all spin images is the -dimensional TriSI representation.

Iii-B Signature-based Methods

The methods in this category compute one or more geometric attributes individually for each 3D point within the local support or each 2D grid after performing 3D-to-2D projection.

SGC [40]. Instead of using a local spherical volume, SGC proposes constructing a bounding cubical volume to simplify the extraction of local geometric features as well as the descriptor construction.

First, the local cubic volume is regularly partitioned into voxels. Second, the centroid and the number of the points within each voxel are utilized to represent the shape feature of a voxel. The motivation of extracting centroid feature is twofold. One is that centroid is an integral feature, making it robust to noise and point density variation [48]. The other is that the computation of centroid only requires linear computational operations. To save storage, the centroid feature is compressed into a single value via , where is the length of cube edges. The dimension of SGC therefore is .

TOLDI [31]. TOLDI takes use of the signed distance cue to generate local depth images for the description of 3D local shape. It simultaneously achieves promising performance in shape retrieval, 3D object recognition, and point cloud registration scenarios [31].

First, the local surface is projected with respect to the , , and planes of the LRF , generating three orthogonal 2D maps. Each map is then divided uniformly into grids. Unlike the popular point distribution map representation used in RoPS and TriSI, TOLDI chooses the minimum of the projection distances (a.k.a., local depth or signed distance) of those points within a 2D grid to the projection plane as the bin value. The reason of opting the minimum projection distance is imitating the humans’ vision mechanism and occluded information cannot be captured. The integration of three orthogonal local depth images forms the final feature with dimensions.

RCS [16]. It presents the first attempt to employ 2D contour information for the description of 3D geometric information. To remedy the limitation that contour, though shown to be robust to noise, has limited discriminative information, it borrows the idea from RoPS and employs multi-view contour information.

First, the local surface is rotated times around the three axes of simultaneously by an incremental angle. For each rotated surface, it is then projected on a 2D plane (the -plane of ). Subsequently, the intersection point of a ray and the projection map with the largest distance from is defined as a contour point. Here, the first ray is aligned with the -axis and the angular gap between any two neighboring rays is identical. A total of contour points are extracted after each rotation and the signature formed by concatenating the distances from to the contour points is calculated for representing a rotated surface. The concatenation of all contour signatures is the eventual feature representation.

LoVS [17]. This method, similar to SGC, also encodes the local geometric information within a cubical volume. The difference is that LoVS discards the description for the geometric information inside a voxel, it instead judges the occupancy of each voxel to craft a binary feature.

The calculation of LoVS is straightforward. It first splits the local cubic volume into uniform voxels. A voxel is labeled as 1 if there are points inside; otherwise, 0. These labels are concatenated in a pre-defined order, generating the LoVS representation with bits.

RSM [39]. This representation is the first to leverage silhouette images for the characterization of local shapes. The binary nature of silhouette makes RSM binary as well. It demonstrates that simply using silhouette images can achieve comparable distinctiveness as point distribution and local depth images, yet being even more robust.

The calculation of RSM is very similar to RoPS and RCS, i.e., rotation and projection are frequently performed to gain multi-view information. For each 2D

projection map, RSM converts it to a silhouette image through judging if there are points insider a grid. In order to improve the robustness to outliers, a

connectivity constraint is enforced on each grid. A total of silhouette images are generated and concatenated, generating a feature with bits.

Iv Evaluation Methodology

Fig. 3: Six datasets for experimental evaluation. For each dataset, samples of a source model and two target models are visualized.

In this section, datasets and metrics for experimental evaluation are presented. The nuisances offered by each dataset or manually injected are also detailed to test a feature representation’s robustness. Finally, implementation details of evaluated methods are introduced. In the following, we will use source and target models to denote two rigid point clouds to be matched.

Iv-a Datasets

Retrieval [49]

. It has three groups of matching pairs. The first group is a noise-free subset while the other two groups contain two levels of Gaussian noise with standard deviations being 0.3

pr and 0.5 pr, respectively. The unit pr here and hereinafter denotes the point cloud resolution, i.e., the average of the distances from each point to its nearest neighbor. Each group has 18 matching pairs and the target models are the rotated copies of the source models. This dataset addresses the 3D shape retrieval scenario and the main challenge is Gaussian noise.

Laser Scanner [50, 51]

. This dataset addresses model-based 3D object recognition scenario, which contains 5 source models and 50 target models with different levels of clutter and occlusion. A total of 188 valid matching pairs are available for this dataset. The point clouds were scanned using a laser scanner and incorporate uniformly distributed and dense points.

Kinect [7]. It is a 3D object recognition dataset and was collected with a Microsoft Kinect v1.0 sensor, consisting of 26 source models and 15 target models. It provides 43 matching pairs with challenges such as real noise, clutter, and occlusion for evaluation.

Space Time [49]. The Space Time dataset addresses rigid matching in 3D object recognition scenario that was captured using space-time stereo technology. 6 source models and 12 models are provided by this dataset, forming 24 matching cases. Note that although it is a 3D object recognition dataset, the source models are 2.5D point clouds.

LiDAR Registration [50]. There are 22, 16, 16, and 21 2.5D views of four models in this dataset scanned by a laser scanner. It addresses 3D rigid registration scenario and offers 496 valid matching pairs having at least 10% overlap (c.f. Eq. 7 for the definition of overlap). The point clouds in this dataset have well-preserved structures. Challenges of this dataset include limited overlap and self-occlusion.

Kinect Registration [7]. It consists of 15, 16, 20, 13, 16, and 15 partial point cloud views of six object models. This dataset addresses 3D rigid registration scenario for low-quality point clouds, i.e., data acquired by a Microsoft Kinect v1.0 sensor. Analogous to the LiDAR Registration dataset, we only consider matching pairs with at least 10% overlap. This dataset is more challenging than the LiDAR Registration dataset because it is additionally contaminated by real noise.

The experimental datasets have the following peculiarities. (i) Varying application contexts. The matching of rigid data finds a wide range of real-word applications and the selected datasets address three typical application contexts, e.g., shape retrieval (the Retrieval dataset), model-based 3D object recognition (the Laser Scanner, Kinect, and Space Time datasets), and point cloud registration (the LiDAR Registration and Kinect Registration datasets). Thus, they offer challenges from different application contexts such as clutter, occlusion, and limited overlap for a thorough evaluation. (ii) Different data modalities. Data captured by LiDAR, Kinect, and space time acquisition systems are considered in our evaluation. Different sensor technology results in point clouds with various qualities. For instance, data generated by LiDAR consist of fairly dense points with good uniformity, while data acquired by Kinect and space-time systems often suffer from sparsity, real noise, and holes. Since the sensor may vary with applications and performance demands, it is desired to considering data with different modalities.

Iv-B Nuisances

A desired geometric feature representation should be robust to common nuisances. Some nuisances only exist for a particular application, e.g., clutter and occlusion in 3D object recognition; but some are independent from applications, e.g., noise. Therefore, we classify these common nuisances into two categories: application-dependent and application-independent. We follow a rule, i.e., independently examining the effect of one particular nuisance to avoid unclear impacts resulted by a mixture of nuisances. The nuisance-free matching case is that all matched local patches are identically fused. So we choose the first subset of B3R dataset (noise-free) where the target models are rotated copies of the source models and enforce all application-independent nuisances to the target models for robustness evaluation regarding application-independent perturbations. As for application-dependent nuisances, we choose the

Laser Scanner and LiDAR Registration datasets to include challenges existed in 3D object recognition and point cloud registration scenarios. Although there are additional datasets to them, e.g., Kinect and Kinect Registration, these datasets include a mixed nuisances. e.g., noise and outliers, and will make it ambitious for evaluation. We also note that the raw Retrieval dataset only concerns about noise so we do not consider shape retrieval datasets regarding the evaluation of robustness to application-dependent nuisances. Details of each nuisance are given as follows.

Iv-B1 Application-dependent Nuisances

Varying support radii. The support radius of a geometric feature representation, denoted by , determines its spatial scale. A small support radius will result in limited geometric information to be encoded, yet a large support radius may drag in unwanted perturbations such as data from cluttered objects. Thus, stay distinctive across difference scales of local surface patches is challenging for a feature representation. The scale issue is frequently investigated for 3D object recognition [8, 49] so we test this term on the Laser Scanner dataset. We vary the support radius of each tested geometric feature from 5 pr to 30 pr with an interval of 5 pr.

Fig. 4: Illustration of three sets of randomly sampled keypoints (the total number is 1000) on a scene from the Laser Scanner dataset with different distances to the boundary. Red points: detected boundary using the method in [51]; green , purple, and blue points represent keypoints whose distances to the boundary are in the range of , and , respectively.

Distance to boundary. Boundary effect caused by occlusion is troublesome because it will lead to data missing and corrupt the original local geometric structure. This is mainly owing to the limitation of current 3D data acquisition systems that they can only capture the 2.5D view data for a 3D object. To preserve sufficient numbers of correct feature correspondences, it is desired for a good geometric feature to retrieve correspondences in boundary regions.

Therefore, we first detect boundary for the target models in the Laser Scanner dataset. Here we use the approach in [51] for boundary detection in point clouds. Then, keypoints on the target models are then split into six groups in which each point distances to the boundary are in the ranges of , , , , , and , respectively. Fig. 4 gives an illustration of several sets of keypoints with different distances to the boundary (for clarity purpose, we show three sets of keypoints in this figure).

Clutter. Clutter refers to as additional data with respect to the object to be recognized in the target model. Without preprocessing such as segmentation, more candidates should be considered in the matching phase for each keypoint in the source model and many of them may have similar geometric structures to the true corresponding local patch, resulting in repeatable patterns. Specifically, clutter is defined as [50, 20]:


We accordingly divide the Laser Scanner dataset into 7 groups with less than 65%, , , , , , and clutter, respectively.

Occlusion. Cluttered objects in the front of the object to be recognized will cause occlusion. This is a long-standing issue for 3D rigid data matching [15]. Occlusion, according to [50, 20], is defined as:


We partition the Laser Scanner dataset, similar to the test of robustness to clutter, into 7 groups with less than 60%, , , , , and of occlusion, respectively.

Partial overlap. Data pairs scanned from different viewpoints usually have only limited overlapping region. According to [52], the overlap ratio of two point clouds is given as:


This experiment is deployed on the LiDAR Registration dataset. We hence split this dataset into 7 subsets with less than 0.3, , , , , , and overlaps, respectively.

Iv-B2 Application-independent Nuisances

Fig. 5: Visual illustration of four application-independent nuisances including Gaussian noise (0.5 pr standard deviation), shot noise (3% outliers), uniform data decimation ( decimation rate), and random data decimation ( decimation rate).

Gaussian noise. Noise may appear as perturbations of points, or unwanted points close to a 3D surface [53]. Eight levels of Gaussian noise whose standard deviations range from 0.25 pr to 2 pr with an interval of 0.25 pr are respectively added to the target models. The noise is independently injected from the -,-, and -axis of each point. A visual illustration of a model with 0.5 pr Gaussian noise is shown in Fig. 5 (the second column).

Shot noise. Shot noise, i.e., outliers, are undesired points far from the 3D surface. To synthetic shot noise, we follow the procedure in [54]. Specifically, we move a portion of points (i.e., of the total number of points in the target model) along their normal vectors with a given distance (), because shot noise usually lie along the viewing direction and such way can well approximate real shot noise. Eight levels of shot noise are considered, i.e., is set from 1% to 8% with an incremental step of 1%. In this evaluation, is set to 0.8 [34]. The visual illustration of a model with 3% shot noise is presented in Fig. 5 (the third column).

Data decimation. The change of distance from the sensor to the object/scene will result in data resolution variation for 3D point clouds, as compared to the scale variation for images. Handling sparse data is challenging but necessary especially for remote sensing applications. We down-sample the target models to , , , , and of their original resolutions, respectively. In most prior works, the data used in such experiment are uniformly down-sampled [8, 31]. Nevertheless, the change of data resolution may not in a uniform manner. We thus propose a new evaluation setup for this term, i.e., random down-sampling. As illustrated by Fig. 5 (the last two columns), the model after random down-sampling has lower quality than the one after uniform-down-sampling. Besides, performing random down-sampling will generate data with irregularly distributed points. The term of point irregularity remains has been overlooked in past studies but is necessary for robustness evaluation.

Fig. 6: Illustration of key point localization error. Points and are correctly matched without localization errors, whereas points and suffer from a key point localization error of .

Keypoint localization error. Prior to feature extraction and matching, a set of distinctive keypoints need to be detected. An evaluation of existing 3D keypoint detectors [49] reveals that the repeatability performance of current 3D keypoint detectors is still limited, so one has to expect keypoint localization errors. By default, the performance of a feature representation is evaluated on ground-truth keypoints to eliminate the effect of keypoint localization errors [8, 7] (Sect. IV-C), thus enabling a specific evaluation for other terms. In this experiment, we focus on the impact of keypoint detection errors on feature matching.

Let be a pair of corresponding keypoints between the source and target data. Then, a point is localized in the target model with a distance of to . Hence, a localization error is enforced on point pair (Fig. 6). This procedure is repeated for all ground-truth corresponding keypoint pairs and the performance is evaluated on these re-organized keypoints. In particular, we vary from 1 pr to 6 pr with a gap of 1 pr, thus obtaining datasets with six levels of keypoint localization error.

LRF error. As previously mentioned in Sect. I, we use ground-truth LRFs by default to specifically examine the quality of feature representations. However, existing LRF methods are not guaranteed to be repeatable [32, 34] and may produce different degrees of LRF errors in various cases. To address this concern, we examine the performance of geometric features when their LRFs suffer from different degrees of angular errors.

The LRF error is defined as the overall angular error between corresponding axes of two LRFs [32, 34]. As suggested by [32], we specifically examine the effect of LRF errors injected from the -axis, the -axis, and both axes. The -axis is not necessary to be considered because it is orthogonal to other axes. For each case, we vary the LRF error from 2.5 degrees to 15 degrees with an increasing step of 2.5 degrees. Note that when injecting LRF errors from two axes, the angular error is randomly split for both axes.

Iv-C Metrics

The distinctiveness of a geometric feature is usually quantitatively evaluated using the Recall versus 1-Precision Curve (RPC) [8, 7, 16]. We also use this criterion for evaluation, which is defined as follows. First, a source feature is matched against all target features to determine the closest and second closest target features. If the ratio of the smallest distance to the second smallest distance is smaller than a threshold , the source feature and the closest target feature are identified as a match. Only if their associated ketpoints are spatially close enough, the matched is judged as correct. Assume that there are correspondences, of them are defined as matches, and there are correct matches in total, 1-Precision is defined as:


Recall is defined as:


By varying from 0 to 1, a curve would be generated. As in [8, 16], 1000 keypoints are randomly selected from the source model and their corresponding point are located in the target model via ground-truth information. RPC is then calculated by matching these keypoints.

For the comparison of features’ robustness, we use the area under curve (AUC) metric to aggregately measure an RPC’s quality [20]. By varying the test condition, e.g., adding different levels of nuisance, a curve will be generated. The compactness of a feature representation, as in [44], is reflected by taking its AUC and storage into consideration simultaneously. We finally examine the computational efficiency by comparing the time cost required for each feature when extracting features for local surfaces with different scales.

Iv-D Implementation Details

No. Features Parameters Dimensionality Data type
1 SHOT [7] 352 Float
2 USC [38] 1980 Float
3 RoPS [8] 135 Float
4 TriSI [13] 675 Float
5 SGC [40] 1024 Float
6 TOLDI [31] 1200 Float
7 RCS [16] 72 Float
8 LoVS [17] 729 Binary
9 RSM [39] 726 Binary
TABLE II: Parameter settings of evaluated methods.

All methods are implemented in the point cloud library (PCL) 1.8.1 [1]. SHOT, USC, RoPS are available in PCL; the code of TOLDI, RCS, LoVS, and RSM was provided by the authors; TriSI and SGC are our re-implementations in PCL. The parameters of all methods are reported in Table II (we use default parameter settings suggested by the authors). Because SHOT needs point normals for feature representation, we employ the principle component analysis (PCA)-based method [55] for normal extraction where the neighborhood size is set to 20. The support radius for all descriptor, by default, is set to 15 pr [20, 16].

The experiments were conducted on a laptop with a 3.4 GHz CPU and 24 GB RAM without usages of parallel computing techniques or GPU implementation.

V Experimental Results

In this section, experimental results produced by following the setup in Sect. IV along with relevant explanations and discussions are presented.

(a) Retrieval
(b) Laser Scanner
(c) Kinect
(d) Space Time
(e) LiDAR Registration
(f) Kinect Registration
Fig. 7: Distinctiveness performance of evaluated feature representations on six experimental datasets (numbers in square brackets are AUC values).

V-a Distinctiveness

The distinctiveness performance of all evaluated methods on experimental datasets are shown in Fig. 7. Several observations can be made from the results.

(i) Retrieval dataset. The key challenge of this dataset is Gaussian noise. SGC and LoVS are two top-ranked features, marginally surpassing RoPS, RSM, TOLDI, and USC. Obviously, SHOT is significantly inferior to others, because it is composed of attribute histograms from a set of subspaces that may fail to employ the spatial information within each subspace. As already demonstrated in [44], spatial information is critical to a feature’s distinctiveness. Another interesting finding is that RSM behaves comparable to RoPS (the calculations of these two representations are very similar), though RSM simply relies on silhouette maps rather than density maps. It indicates the information redundancy of RoPS.

(ii) Laser Scanner dataset. LoVS neatly surpasses other features on this dataset, followed by SGC. Note that both descriptors perform uniform partition in a cubic volume. LoVS shows better performance than SGC as it solely describes a voxel by judging if there are points inside. By contrast, SGC takes the point count and centroid into consideration that can be easily affected by clutter and occlusion. SHOT and RoPS perform poorly in this context. SHOT lacks enough discriminative power because it uses normal deviation for feature representation that may be ambiguous when ignoring point locations [31]. The density map encoded by RoPS may change frequently when computed over occluded local surface patches [39] due to the significant variation of point count in corresponding patches. In this case, RSM abnegating the point density information for each projected 2D map shows stronger resilience to clutter and occlusion.

(iii) Kinect dataset. USC and LoVS achieve the best and the second best performance, respectively. A common trait of both methods is performing feature description directly in the 3D space instead of performing 3D-to-2D projection, as done in RoPS, TriSI, RSM, and RCS. It is reasonable because projection, though enabling image-like feature representations for 3D point clouds, yet will result in certain information loss [17]. Although USC directly performs feature characterization in the 3D space, it relies on point density information which is questionable for this dataset due to the irregular distribution of points. This also results in the performance deterioration of TriSI. Since RoPS also employs point density information but it achieves clear better performance than TriSI, we can infer that further abstracting statistics information (e.g., entropy and moments) from raw density maps produces more robust representations than directly using the density maps.

(iv) Space Time dataset. The ranking of evaluated features on this dataset is very similar to that on the Kinect dataset. An interesting phenomenon is the behavior of SHOT. Unlike the performance on the Retrieval and Laser Scanner datasets, it achieves the second best performance datasets on this dataset. It suggests that for point clouds acquired by low-cost sensors that suffer from sparsity, holes, and irregular distributions of points, encoding surface normals is a preferable option. RCS exhibits very limited distinctiveness, indicating that the contour cue turns to be unreliable for such data modality.

(v) LiDAR Registration dataset. Clearly, one can see that LoVS outperforms other features by a large margin. LoVS approximates the spatial structure of with voxel labels, ignoring the information within each voxel. This is shown to be quite robust to partial overlap because the shape geometry inside voxels is vulnerable when local surface patches are incomplete. It has also been demonstrated by SGC, a descriptor that leverages voxel shape information but returns worse performance. The behaviors of other feature representations are similar to each other, except for RoPS. Owing to limited overlap, the point counts of two corresponding local surfaces may vary significantly, causing a negative impact on the grid values of 2D density maps as employed by RoPS.

(vi) Kinect Registration dataset. Similar observations on this dataset to those on the LiDAR Registration dataset can be made. Specifically, LoVS achieves the best performance, while features based on 2D density maps such as RoPS and TriSI, are inferior to others. However, 2D depth maps, as employed by TOLDI, are revealed to be more robust than 2D density maps.

V-B Robustness

(a) Varying support radii
(b) Distance to boundary
(c) Clutter
(d) Occlusion
(e) Partial overlap
Fig. 8: Robustness performance of evaluated feature representations with respect to application-dependent nuisances.

Fig. 8 reports the results of evaluated descriptors in terms of robustness to application-dependent nuisances. The following phenomenons can be found from the figure.

(a) Gaussian noise
(b) Shot noise
(c) Uniform data decimation
(d) Random data decimation
(e) Keypoint localization error
(f) LRF error: -axis
(g) LRF error: -axis
(h) LRF error: &-axis
Fig. 9: Robustness performance of evaluated feature representations with respect to application-independent nuisances.

(i) Varying support radii. When the support radius is 5 pr, LoVS, SGC, and RoPS achieve better performance than others. USC and TriSI almost fail to retrieve any correct matches at this scale. As further increases, LoVS consistently surpasses other competitors. The performance of RoPS drops quickly as is greater than 10 pr, while the variation of performance for other features is mild. A general trend for all features is that their performance first monotonically increases with as more geometric information can be encoded, but then degrades when further gets larger because of the perturbation caused by clutter. Overall, LoVS and SGC are the two most robust features to the variation of support radius.

(ii) Distance to boundary. The more closer to the boundary, the more challenging the keypoints are for feature matching. Local surfaces in boundary regions usually suffer from data missing, which well explains the limited performance by RoPS and TriSI because 2D density maps are not consistent for corresponding local surface patches. In this case, LoVS and SGC clearly outperform all others. For keypoints at a distance larger than the support radius to the boundary, i.e., corresponding surface patches are relatively complete, all methods except for SHOT behave comparable with each other. Nonetheless, the performance variation of SHOT as the distance to boundary changes is less significant than most features, arising from the fact that normal deviation histograms from non-empty subspaces remain stable.

(iii) Clutter and occlusion. In terms of the robustness to clutter and occlusion, it is noteworthy that although RoPS and TriSI are particularly designed to resist the impact of clutter and occlusion, they cannot handle these nuisances effectively. Although RoPS and TriSI (the overall descriptors) are demonstrated to be very effective for 3D object recognition [8, 13], their feature representations are obviously not prior options. Interestingly, LoVS is originally designed for the pairwise registration of point clouds, though, it is demonstrated to be the best option as well for 3D object recognition in cluttered and occluded scenes. Our results may motivate the researchers to rethink the traditional approaches or rules for promoting feature representations’ robustness to some particular nuisances.

(iv) Partial overlap. For data pairs with very limited overlap, i.e., an overlap ratio of 0.3, all features exhibit quite poor performance. In less challenging cases with higher overlap ratios, LoVS becomes the best performed feature representation and exceeds others by a significant gap. RoPS and TriSI are the two most inferior features. We can therefore conclude that when the local surface undergoes data missing (mainly caused by limited overlap and occlusion) or data expansion (mainly caused by clutter), 2D density maps are very susceptible meta-representations.

Regarding the evaluation of the robustness to application-independent nuisances, as shown in Fig. 9, we can make the following observations.

(i) Gaussian noise. When the standard deviation of Gaussian noise is smaller than 0.75 pr, SGC and LoVS are two outstanding features as their AUC values remain almost unaltered. As the Gaussian noise becomes more severe, the SGC feature achieves the best performance and the margin between SGC and the second best one is particularly large when the standard deviation is greater than 1.5 pr, while LoVS meets a clear performance degradation. It is owing to the robustness of geometric centroids to noise [40]. However, noise with large standard deviations can frequently change the voxel labels of LoVS because noisy points may exist in originally empty voxels. The performance of USC drops rapidly as well with severe noise. This is because USC splits the local volume in a more fine-grained manner than SGC and LoVS, leading to an increased sensitivity to noise. Although normals are demonstrated to be sensitive to noise [5, 8], SHOT encoding normal deviation information is even more stable than several competitors such as TriSI, RSM, and RCS as the standard deviation of noise exceeds 1.5 pr.

(ii) Shot noise. TriSI, RSM, and SHOT show very stable performance for data with outliers. TriSI is based on 2D point density maps and outliers hold low opportunities to significantly change the density of a grid; RSM alleviates the influence of outliers via 3D-to-2D projection and the exclusion of isolated 1-labeled pixels in each silhouette image; SHOT relies on surface normals that are computed by performing PCA on a subset of nearest neighbors, whereas outliers are distant points from the 3D surface and not likely to be included for normal calculation. We can see that RoPS is inferior to TriSI although both features resort to 2D density maps, the difference is that RoPS further extracts statistics information for these density maps, shortening the feature length yet sacrificing the robustness to outliers. Another finding is the susceptibility of signature-based features with 3D spatial information to shot noise, i.e., SGC, LoVS, and USC. Common to all the three features is the fact that a single point in a 3D subspace may significantly affect the bin value of the feature.

(iii) Uniform data decimation. When reducing the data volume to and of its original volume, the performance of most feature representations except for TriSI keeps very stable. As more points are uniformly extracted, LoVS achieves the best performance, followed by SGC and TOLDI; USC and TriSI exhibit limited performance in such case. Besides USC, all features have designed particular rules to achieve robustness to data decimation. For instance, TriSI and RoPS have performed normalization on the 2D density maps; SHOT employs statistical histograms; LoVS, TOLDI, RSM, and RCS only consider one representative point for bin value assignment. Our results indicate that among all these rules, the solutions proposed by LoVS and SGC are more effective.

(iv) Random data decimation. Compared with uniform data decimation, random data decimation possesses an additional challenge, i.e., non-uniformity. Few feature representations have noticed this nuisance that is common in real-world scanned data. Experimental results show that LoVS is the most robust feature to random data decimation, followed by SGC. This is benefited from the fact that LoVS assigns feature values to voxels based on judging whether a voxel contains points but ignores the exact point count. As a result, neither uniform nor random data decimation is expected to significantly vary the feature value of a voxel. The impact on TriSI is especially obvious, i.e., it drops to the most inferior one with random data decimation. Although it has performed normalization for each 2D density map, but it is based on the assumption that the density value of each grid changes simultaneously with the total number of points and therefore fails to cope with non-uniformity.

(v) Keypoint localization error. When the keypoint localization error is within 2 pr, SGC, LoVS, and RoPS are more robust than others. As further increases, RoPS surpasses all others. It is noteworthy that although SHOT is less distinctive than other features, but it achieves the second best performance when is greater than 4 pr. It is because keypoint localization error will lead to certain differences between corresponding surface patches; signature-based methods, e.g., LoVS, SGC, TOLDI, and RCS, are very sensitive to such changes because their feature values are often determined by some particular points that are difficult to keep consistent in this context; the effect on features based on statistical histograms, e.g., RoPS and SHOT, are less obvious as the main statistical information between two coarsely corresponding surface patches are supposed to be similar.

(vi) LRF error. The ranking of features with respect to LRF errors from the -axis, -axis, and both axes are generally similar. Specifically, RoPS, SGC, and LoVS are more stable than others. For RoPS, a potential explanation is that it abstracts more robust statistics from initial density features; for SGC and LoVS, they coarsely split the local cubic volume into uniform voxels and slight LRF errors are not likely to significantly change the voxel labels and geometric centroids employed by the two features. The behaviors of TriSI and RCS are relatively sensitive to LRF errors. Specifically, the performance of RCS drops clearly even with small LRF errors, arising from the fact that RCS characterizes the geometry of each projected 2D map with a set of contour points. Unfortunately, the coordinates of these contour points would change simultaneously with unrepeatable LRFs, resulting a significant variation in the final feature.

V-C Compactness

The compactness results reflected by AUC versus storage of evaluated feature representations are presented in Fig. 10.

Among all evaluated features, LoVS, RSM, RCS, and RoPS require less storage than others. LoVS and RSM are two binary features, and RCS and RoPS are two compact real-valued features. A light-weight feature is expected to achieve a good balance between storage occupancy and distinctiveness. On the Retrieval dataset, LoVS, RSM, and RoPS are three superior feature against others. On the Space Time dataset, we find that none of tested features manage to strike a well balance between compactness and descriptiveness. On the other four experimental datasets, it is salient that LoVS dramatically surpasses others on these datasets. Although SGC usually shows competitive distinctness to LoVS, the results suggest it has great redundancy. It is interesting to note that SGC additionally considers the geometric center and point count attributes of a voxel, yet resulting less robustness and more storage occupancy. We believe further investigations should be made on the relationship between spatial partition and feature description within a subspace.

(a) Retrieval
(b) Laser Scanner
(c) Kinect
(d) Space Time
(e) LiDAR Registration
(f) Kinect Registration
Fig. 10: Compactness performance (AUC versus storage) of evaluated feature representations on six experimental datasets.

V-D Computational Efficiency

Fig. 11: Time costs of calculating evaluated feature representations for 1000 local surface patches with respect to different support radii.

We assess the computational efficiency of a feature representation as follows. First, 1000 local surface patches are randomly sampled from an experimental dataset. Note that the computational efficiency of a feature representation is only related to the point count of a local surface rather than its shape geometry, so we experiment with the the Retrieval dataset. Then, we compute the features to be tested at various scales on these sampled points. Finally, the former two steps are repeated for ten rounds and the average results are kept for evaluation. The results are shown in Fig. 11.

Obviously, USC is the most time-consuming feature representation, especially for large-scale local patches. It is because USC assigns a density

value to each point in the local volume, which needs to estimate the number of points within a spherical region centered at the query point. Usually, this is done by building a

d-tree in the local surface to achieve fast radius neighbor search yet has a computational complexity of . Another observation is that features leveraging the rotation and projection mechanism, e.g., RoPS and RCS, are also inefficient to calculate. The reason is that rotating the local surface requires matrix multiplication, which has a non-linear computational complexity. SHOT is the most efficient feature when the support radius is greater than 12.5 pr, followed by TOLDI and SGC. The high efficiency of SHOT is benefited from the low computational complexity of attribute extraction (i.e., the cosine of two unit vectors) and histogram binning. Since local geometric feature matching usually employs features with a scale around 15 pr [20, 44], SHOT, TOLDI, SGC, and LoVS are recommended choices.

Vi Summary and Discussion

Based upon the evaluation results in Sect. V, it is necessary to give a summary of the performance of evaluated features in different assessing scenarios, in order to highlight the advantages and limitations of these feature representations to guide real-world applications and new descriptor crafting. Besides, we discuss about some new findings based on our evaluation that may indicate future research directions in the research field of local geometric feature description.

Vi-a Performance Summary

Superior features Inferior features
Distinctiveness Retrieval SGC, LoVS SHOT
Laser Scanner LoVS, SGC SHOT, RoPS
LiDAR Registration LoVS RoPS, TriSI
Kinect Registration LoVS TriSI
Robustness Varying support radii LoVS, SGC, RSM RoPS, SHOT, RCS
Distance to boundary LoVS, SGC RoPS, RCS, SHOT
Clutter LoVS, SGC RoPS, SHOT
Occlusion LoVS, SGC RoPS, SHOT
Partial overlap LoVS RoPS
Gaussian noise SGC USC, RCS
Shot noise TriSI, RSM, TOLDI USC
Uniform data decimation LoVS, SGC USC, TriSI
Random data decimation LoVS, SGC TriSI, RCS
Keypoint localization error RoPS, SHOT TriSI, USC
Compactness Retrieval LoVS, RSM, RoPS USC, TOLDI
Laser Scanner LoVS USC, TOLDI
Kinect LoVS, RSM, RoPS USC
Space Time LoVS USC
LiDAR Registration LoVS USC, SGC, TOLDI
Kinect Registration LoVS USC, SGC, TOLDI
Efficiency SHOT USC, RoPS
TABLE III: Superior and inferior feature representations summarized based on the outcomes in Sect. V.

A performance summary of evaluated feature representations based on the results in Sect. V is presented in Table III. Two main observations can be made. (i) Most of evaluated feature representations fail to achieve a good balance among distinctiveness, robustness, compactness, and computational efficiency. However, two features, i.e., LoVS and SGC, exhibit favorable performance in most cases. In particular, LoVS achieves top-ranked performance on most datasets, e.g., Laser Scanner, Kinect Registration, and LiDAR Registration, and is robust to a variety of nuisances such as clutter, occlusion, data decimation, and LRF errors. In addition, the binary format of LoVS makes it compact as well. (ii) The evaluation results find that some features designed for a particular application, e.g., RoPS and TriSI for 3D object recognition, are even inferior to many other competitors. By contrast, there exist several features that generalize well across different applications, e.g., LoVS. It is therefore necessary to rethink the rationality of some feature description approaches for a particular application. We can also get inspirations from LoVS regarding the issue of generalization ability as it remains a very challenging task in this field [20].

Vi-B Findings

This evaluation presents the following interesting findings that worth future investigation.

(i) Cubic volume vs. Spheric volume. The majority of existing local geometric features are extracted within a cubic volume, originally to promise that corresponding surface patches can be cropped identically around the keypoint regardless object poses. With the help of LRF, a cubic volume can also achieve such goal [17]. As revealed by the results, features computed within a cubic volume, i.e., SGC and LoVS, generally outperform those spheric volume-based features. This is potentially because more uniform partition can be performed with a cubic volume, while irregular partition may lead to subspaces with varying sizes and therefore complicates the feature extraction for each subspace.

(ii) 3D-to-2D projection vs. 3D preserving. 3D-to-2D projection is widely employed in many existing feature representations, e.g., RoPS, TriSI, RCS, and TOLDI. The motivation behind is to convert spatially irregular point clouds to regular images, in order to facilitate feature description with relatively matured image description techniques. There are also 3D preserving features such as SGC, USC, and LoVS, which first split the local 3D volume into a set of subspaces and then perform feature description. The evaluation results suggest that features based on 3D-to-2D projection are generally less distinctive than 3D preserving-based feature due to the information loss after projection. Besides stronger robustness to outliers, projection-based features are also more susceptible to other nuisances such as Gaussian noise, data decimation, clutter, and occlusion.

(iii) Space partition. To encode spatial information, performing space partition is a simple yet very effective way [44]. Nonetheless, determining the number of partitions needs a special care. Less partitions can hardly fully leverage the spatial information, e.g., SHOT has 32 partitions and shows limited discriminative power; more partitions will increase the sensitivity to point-level perturbations such as noise and data decimation, e.g., USC has 1980 partitions and is very sensitive to common nuisances. LoVS and SGC seem to have attained a well balance, which have 729 and 512 partitions, respectively.

(iv) Rethinking attribute description for subspaces. It is a common practice to perform attribute description for subspaces in both 3D-to-2D projection-based and 3D preserving-based features. For instance, RoPS and TriSI use point density feature to describe each 2D gird after projection; SHOT and SGC respectively resort to normal deviation histograms and geometric centroids for 3D subspace description. However, now we should rethink the reasonability and necessity of such operation. Because the evaluation results demonstrate that directly replacing attribute description with occupancy labels can achieve comparative or even stronger discriminative power and more robustness to common perturbations, yet being more compact and efficient. A typical example is LoVS that simply uses structural information without attribute description for subspaces, but it is the overall best feature showed by this evaluation. In addition, RSM, as a variant of RoPS without employing density features, shows stronger robustness to shot noise, clutter, and occlusion.

Vii Conclusions

This paper has presented a comprehensive evaluation for several state-of-the-art local geometric feature representations, presenting complementary perspectives to existing evaluations of overall feature descriptors [20] and LRFs [34]. The experiments were conducted on datasets addressing different application scenarios with various data modalities and nuisances such as clutter, occlusion, partial overlap, Gaussian noise, shot noise, and data decimation. The tested terms for a feature representation include distinctiveness, robustness, compactness, and computational efficiency. Based upon evaluation outcomes, a summary of the overall performance and peculiarities of evaluated features has been presented, being helpful for either devising new feature descriptors or choosing a proper feature representation in a particular application. We have also discussed some interesting findings through this evaluation that may be instructive to the following researchers.


The authors would like to thank the publishers of datasets used in our evaluation for making them publicly available.


  • [1] R. B. Rusu and S. Cousins, “3d is here: Point cloud library (pcl),” in Proc. IEEE International Conference on Robotics and Automation, 2011, pp. 1–4.
  • [2] A. P. James and B. V. Dasarathy, “Medical image fusion: A survey of the state of the art,” Information Fusion, vol. 19, pp. 4–19, 2014.
  • [3] H. Ghassemian, “A review of remote sensing image fusion methods,” Information Fusion, vol. 32, pp. 75–89, 2016.
  • [4] R. B. Rusu, N. Blodow, Z. C. Marton, and M. Beetz, “Aligning point cloud views using persistent feature histograms,” in Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008, pp. 3384–3391.
  • [5] J. Yang, Z. Cao, and Q. Zhang, “A fast and robust local descriptor for 3d point cloud registration,” Information Sciences, vol. 346, pp. 163–179, 2016.
  • [6] J. Yang, Y. Xiao, and Z. Cao, “Aligning 2.5 d scene fragments with distinctive local geometric features and voting-based correspondences,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 29, no. 3, pp. 714–729, 2019.
  • [7] F. Tombari, S. Salti, and L. Di Stefano, “Unique signatures of histograms for local surface description,” in

    Proc. European Conference on Computer Vision

    , 2010, pp. 356–369.
  • [8] Y. Guo, F. Sohel, M. Bennamoun, M. Lu, and J. Wan, “Rotational projection statistics for 3d local surface description and object recognition,” International Journal of Computer Vision, vol. 105, no. 1, pp. 63–86, 2013.
  • [9] K. Tateno, F. Tombari, and N. Navab, “When 2.5 d is not enough: Simultaneous reconstruction, segmentation and recognition on dense slam,” in Proc. IEEE International Conference on Robotics and Automation.   IEEE, 2016, pp. 2295–2302.
  • [10] L. Gomes, O. R. P. Bellon, and L. Silva, “3d reconstruction methods for digital preservation of cultural heritage: A survey,” Pattern Recognition Letters, vol. 50, pp. 3–14, 2014.
  • [11] P. J. Besl and N. D. McKay, “Method for registration of 3-d shapes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239–256, 1992.
  • [12] J. Yang, Q. Zhang, and Z. Cao, “Multi-attribute statistics histograms for accurate and robust pairwise registration of range images,” Neurocomputing, vol. 251, pp. 54–67, 2017.
  • [13] Y. Guo, F. Sohel, M. Bennamoun et al., “A novel local surface feature for 3d object recognition under clutter and occlusion,” Information Sciences, vol. 293, pp. 196–213, 2015.
  • [14] F. Tombari and L. Di Stefano, “Object recognition in 3d scenes with occlusions and clutter by hough voting,” in Proc. Pacific-Rim Symposium on Image and Video Technology.   IEEE, 2010, pp. 349–355.
  • [15] Y. Guo, M. Bennamoun, F. Sohel, M. Lu, and J. Wan, “3d object recognition in cluttered scenes with local surface features: A survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 11, pp. 2270–2287, 2014.
  • [16] J. Yang, Q. Zhang, K. Xian, Y. Xiao, and Z. Cao, “Rotational contour signatures for both real-valued and binary feature representations of 3d local shape,” Computer Vision and Image Understanding, vol. 160, pp. 133–147, 2017.
  • [17] S. Quan, M. Jie, F. Hu, B. Fang, and M. Tao, “Local voxelized structure for 3d binary feature representation and robust registration of point clouds from low-cost sensors,” Information Sciences, vol. 444, pp. 153–171, 2018.
  • [18] A. E. Johnson and M. Hebert, “Using spin images for efficient object recognition in cluttered 3d scenes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 5, pp. 433–449, 1999.
  • [19] A. Frome, D. Huber, R. Kolluri, T. Bülow, and J. Malik, “Recognizing objects in range data using regional point descriptors,” in Proc. European Conference on Computer Vision, 2004, pp. 224–237.
  • [20] Y. Guo, M. Bennamoun, F. Sohel, M. Lu, J. Wan, and N. M. Kwok, “A comprehensive performance evaluation of 3d local feature descriptors,” International Journal of Computer Vision, vol. 116, no. 1, pp. 66–89, 2016.
  • [21] R. Q. Charles, S. Hao, K. Mo, and L. J. Guibas, “Pointnet: Deep learning on point sets for 3d classification and segmentation,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition, 2017, pp. 195–205.
  • [22] A. Zeng, S. Song, M. Nießner, M. Fisher, J. Xiao, and T. Funkhouser, “3dmatch: Learning local geometric descriptors from rgb-d reconstructions,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition.   IEEE, 2017, pp. 199–208.
  • [23] M. Khoury, Q.-Y. Zhou, and V. Koltun, “Learning compact geometric features,” in Proc. IEEE International Conference on Computer Vision, 2017, pp. 153–61.
  • [24] H. Deng, T. Birdal, and S. Ilic, “Ppfnet: Global context aware local features for robust 3d point matching,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 195–205.
  • [25]

    ——, “Ppf-foldnet: Unsupervised learning of rotation invariant 3d local descriptors,” in

    Proc. European Conference on Computer Vision, 2018, pp. 602–618.
  • [26] Z. J. Yew and G. H. Lee, “3dfeat-net: Weakly supervised local 3d features for point cloud registration,” in Proc. European Conference on Computer Vision.   Springer, 2018, pp. 630–646.
  • [27] M. Liu, F. Yao, C. Choi, A. Sinha, and K. Ramani, “Deep learning 3d shapes using alt-az anisotropic 2-sphere convolution,” in Proc. International Conference on Learning Representations, 2019.
  • [28] H. Wang, J. Guo, D. M. Yan, W. Quan, and X. Zhang, “Learning 3d keypoint descriptors for non-rigid shape matching,” in Proc. European Conference on Computer Vision, 2018, pp. 3–19.
  • [29] A. G. Buch, D. Kraft, S. Robotics, and D. Odense, “Local point pair feature histogram for accurate 3d matching,” in Proc. British Machine Vision Conference, 2018.
  • [30] S. Malassiotis and M. G. Strintzis, “Snapshots: A novel local surface descriptor and matching algorithm for robust 3d surface alignment,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 7, pp. 1285–1290, 2007.
  • [31] J. Yang, Q. Zhang, Y. Xiao, and Z. Cao, “Toldi: An effective and robust approach for 3d local shape description,” Pattern Recognition, vol. 65, pp. 175–187, 2017.
  • [32] A. Petrelli and L. D. Stefano, “On the repeatability of the local reference frame for partial shape matching,” in Proc. IEEE International Conference on Computer Vision, 2011, pp. 2244–2251.
  • [33] ——, “A repeatable and efficient canonical reference for surface matching,” in Proc. IEEE Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission, 2012, pp. 403–410.
  • [34] J. Yang, Y. Xiao, and Z. Cao, “Toward the repeatability and robustness of the local reference frame for 3d shape matching: An evaluation,” IEEE Transactions on Image Processing, vol. 27, no. 8, pp. 3766–3781, 2018.
  • [35] H. Chen and B. Bhanu, “3d free-form object recognition in range images using local surface patches,” Pattern Recognition Letters, vol. 28, no. 10, pp. 1252–1262, 2007.
  • [36] R. B. Rusu, N. Blodow, and M. Beetz, “Fast point feature histograms (fpfh) for 3d registration,” in Proc. IEEE International Conference on Robotics and Automation, 2009, pp. 3212–3217.
  • [37] C. S. Chua and R. Jarvis, “Point signatures: A new representation for 3d object recognition,” International Journal of Computer Vision, vol. 25, no. 1, pp. 63–85, 1997.
  • [38] F. Tombari, S. Salti, and L. Di Stefano, “Unique shape context for 3d data description,” in Proc. ACM Workshop on 3D Object Retrieval.   ACM, 2010, pp. 57–62.
  • [39] S. Quan, M. Jie, M. Tao, F. Hu, and B. Fang, “Representing local shape geometry from multi-view silhouette perspective: A distinctive and robust binary 3d feature,” Signal Processing: Image Communication, vol. 65, pp. 67–80, 2018.
  • [40] K. Tang, S. Peng, and X. Chen, “Signature of geometric centroids for 3d local shape description and partial shape matching,” in Proc. Asian Conference on Computer Vision, 2016, pp. 311–326.
  • [41] R. Hänsch, T. Weber, and O. Hellwich, “Comparison of 3d interest point detectors and descriptors for point cloud fusion,” ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. 2, no. 3, p. 57, 2014.
  • [42] H. Kim and A. Hilton, “Evaluation of 3d feature descriptors for multi-modal data registration,” in Proc. International Conference on 3D Vision.   IEEE, 2013, pp. 119–126.
  • [43] A. G. Buch, H. G. Petersen, and N. Krüger, “Local shape feature fusion for improved matching, pose estimation and 3d object recognition,” SpringerPlus, vol. 5, no. 1, p. 297, 2016.
  • [44] J. Yang, Q. Zhang, and Z. Cao, “The effect of spatial information characterization on 3d local feature descriptors: A quantitative evaluation,” Pattern Recognition, vol. 66, pp. 375–391, 2017.
  • [45] D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004.
  • [46] S. Belongie, J. Malik, and J. Puzicha, “Shape matching and object recognition using shape contexts,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509–522, 2002.
  • [47] Y. Guo, F. Sohel, M. Bennamoun, J. Wan, and M. Lu, “An accurate and robust range image registration algorithm for 3d object modeling,” IEEE Transactions on Multimedia, vol. 16, no. 5, pp. 1377–1390, 2014.
  • [48] H. Pottmanna, J. Wallnerb, Q. X. Huangc, and Y. L. Yangd, “Integral invariants for robust geometry processing,” Computer Aided Geometric Design, vol. 26, no. 1, pp. 37–60, 2009.
  • [49] F. Tombari, S. Salti, and L. Di Stefano, “Performance evaluation of 3d keypoint detectors,” International Journal of Computer Vision, vol. 102, no. 1-3, pp. 198–220, 2013.
  • [50] A. S. Mian, M. Bennamoun, and R. Owens, “Three-dimensional model-based object recognition and segmentation in cluttered scenes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1584–1601, 2006.
  • [51] A. Mian, M. Bennamoun, and R. Owens, “On the repeatability and quality of keypoints for local feature-based 3d object retrieval from cluttered scenes,” International Journal of Computer Vision, vol. 89, no. 2-3, pp. 348–361, 2010.
  • [52] A. S. Mian, M. Bennamoun, and R. A. Owens, “A novel representation and feature matching algorithm for automatic pairwise registration of range images,” International Journal of Computer Vision, vol. 66, no. 1, pp. 19–40, 2006.
  • [53] G. K. Tam, Z.-Q. Cheng, Y.-K. Lai, F. C. Langbein, Y. Liu, D. Marshall, R. R. Martin, X.-F. Sun, and P. L. Rosin, “Registration of 3d point clouds and meshes: a survey from rigid to nonrigid.” IEEE Transactions on Visualization and Computer Graphics, vol. 19, no. 7, pp. 1199–1217, 2013.
  • [54] A. Zaharescu, E. Boyer, and R. Horaud, “Keypoints and local descriptors of scalar functions on 2d manifolds,” International Journal of Computer Vision, vol. 100, no. 1, pp. 78–98, 2012.
  • [55] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, Surface reconstruction from unorganized points.   ACM, 1992, vol. 26, no. 2.