Extracting geometric features from 3D scans or point clouds is the first step in applications such as registration, reconstruction, and tracking. State-of-the-art methods require computing low-level features as input or extracting patch-based features with limited receptive field. In this work, we present fully-convolutional geometric features, computed in a single pass by a 3D fully-convolutional network. We also present new metric learning losses that dramatically improve performance. Fully-convolutional geometric features are compact, capture broad spatial context, and scale to large scenes. We experimentally validate our approach on both indoor and outdoor datasets. Fully-convolutional geometric features achieve state-of-the-art accuracy without requiring prepossessing, are compact (32 dimensions), and are 600 times faster than the most accurate prior method.
2020-06-15 Source code for Deep Global Registration, CVPR'20 Oral has been released. Please refer to the repository and the paper for using FCGF for registration.
| Comparison Table | Speed vs. Accuracy |
|---|---|
 |
 |
Feature-match recall and speed in log scale on the 3DMatch benchmark. Our approach is the most accurate and the fastest. The gray region shows the Pareto frontier of the prior methods.
3DMatch by Zeng et al. uses a siamese convolutional network to learn 3D patch descriptors. CGF by Khoury et al. maps 3D oriented histograms to a low-dimensional feature space using multi-layer perceptrons. PPFNet and PPF FoldNet by Deng et al. adapts the PointNet architecture for geometric feature description. 3DFeat by Yew and Lee uses a PointNet to extract features in outdoor scenes.
Our work addressed a number of limitations in the prior work. First, all prior approaches extract a small 3D patch or a set of points and map it to a low-dimensional space. This not only limits the receptive field of the network but is also computationally inefficient since all intermediate representations are computed separately even for overlapping 3D regions. Second, using expensive low-level geometric signatures as input can slow down feature computation. Lastly, limiting feature extraction to a subset of interest points results in lower spatial resolution for subsequent matching stages and can thus reduce registration accuracy.
Traditional metric learning assumes that the features are independent and identically distributed (i.i.d.) since a batch is constructed by random sampling. However, in fully-convolutional feature extraction, adjacent features are locally correlated and hard-negative mining could find features adjacent to anchors, which are false negatives. Thus, filtering out these false negatives is a crucial step similar to how Universal Correspondence Network by Choy et al. used a distance threshold to filter out the false negatives.
Also, the number of features used in the fully-convolutional setting is orders of magnitude larger than that in standard metric learning algorithms. For instance, FCGF generates ~40k features for a pair of scans (this increases proportionally with the batch size) while a minibatch in traditional metric learning has around 1k features. Thus, it is not feasible to use all pairwise distances within a batch in the standard metric learning.
Instead, we propose the hardest-contrastive loss and the hardest-triplet loss. Visually, these are simple variants that use the hardest negatives for both features within a positive pair. One of the key advantages of the hardest-contrastive loss is that you do not need to save the temporary variables used to find the hardest negatives. This small change allows us to reconstruct the loss from the hardest negatives indices and throw away the intermediate results among a large number of feature. Here, we used almost 40k features to mine the hardest negative and destroy all intermediate variables once the indices of the hardest negatives are found for each positive feature.
| Contrastive Loss | Triplet Loss | Hardest Contrastive | Hardest Triplet |
|---|---|---|---|
 |
 |
 |
 |
Sampling and negative-mining strategy for each method. Blue: positives, Red: Negatives. Traditional contrastive and triplet losses use random sampling. Our hardest-contrastive and hardest-triplet losses use the hardest negatives.
Please refer to our ICCV'19 paper for more details.
We color-coded FCGF features for pairs of 3D scans that are 10m apart for KITTI and a 3DMatch benchmark pair for indoor scans. FCGF features are mapped to a scalar space using t-SNE and colorized with the Spectral color map.
| KITTI LIDAR Scan 1 | KITTI LIDAR Scan 2 |
|---|---|
 |
 |
| Indoor Scan 1 | Indoor Scan 2 |
|---|---|
 |
 |
Please follow the link Youtube Video or click the image to view the YouTube video of FCGF visualizations.
- Ubuntu 14.04 or higher
- CUDA 10.0 or higher
- Python v3.7 or higher
- Pytorch v1.2 or higher
- MinkowskiEngine v0.2.7 or higher
We recommend conda for installation. First, follow the MinkowskiEngine installation instruction to setup the environment and the Minkowski Engine.
Next, download FCGF git repository and install the requirement from the FCGF root directory..
git clone https://github.com/chrischoy/FCGF.git
cd FCGF
# Do the following inside the conda environment
pip install -r requirements.txt
For training, download the preprocessed 3DMatch benchmark dataset.
./scripts/download_datasets.sh /path/to/dataset/download/dir
For KITTI training, follow the instruction on KITTI Odometry website to download the KITTI odometry training set.
After installation, you can run the demo script by
python visualization_demo.py
The demo script will first extract FCGF features from a mesh file generated from a kitchen scene. Next, it will color code the features independent of their spatial location. After the color mapping using TSNE, the demo script will visualize the color coded features by coloring the input point cloud.
You may have to rotate the scene to get the above visualization.
python train.py --threed_match_dir /path/to/threedmatch/
For benchmarking the trained weights on 3DMatch, download the 3DMatch Geometric Registration Benchmark dataset from here or run
bash ./scripts/download_3dmatch_test.sh /path/to/threedmatch_test/
and follow:
python -m scripts.benchmark_3dmatch.py \
--source /path/to/threedmatch \
--target ./features_tmp/ \
--voxel_size 0.025 \
--model ~/outputs/checkpoint.pth \
--extract_features --evaluate_feature_match_recall --with_cuda
For KITTI training, follow the instruction on KITTI Odometry website to download the KITTI odometry training set.
export KITTI_PATH=/path/to/kitti/; ./scripts/train_fcgf_kitti.sh
| Model | Normalized Feature | Dataset | Voxel Size | Feature Dimension | Performance | Link |
|---|---|---|---|---|---|---|
| ResUNetBN2C | True | 3DMatch | 2.5cm (0.025) | 32 | FMR: 0.9578 +- 0.0272 | download |
| ResUNetBN2C | True | 3DMatch | 2.5cm (0.025) | 16 | FMR: 0.9442 +- 0.0345 | download |
| ResUNetBN2C | True | 3DMatch | 5cm (0.05) | 32 | FMR: 0.9372 +- 0.0332 | download |
| ResUNetBN2C | False | KITTI | 20cm (0.2) | 32 | RTE: 0.0534m, RRE: 0.1704° | download |
| ResUNetBN2C | False | KITTI | 30cm (0.3) | 32 | RTE: 0.0607m, RRE: 0.2280° | download |
| ResUNetBN2C | True | KITTI | 30cm (0.3) | 16 | RTE: 0.0670m, RRE: 0.2295° | download |
| ResUNetBN2C | True | KITTI | 30cm (0.3) | 32 | RTE: 0.0639m, RRE: 0.2253° | download |
FCGF will be presented at ICCV'19: Friday, November 1, 2019, 1030–1300 Poster 4.1 (Hall B)
@inproceedings{FCGF2019,
author = {Christopher Choy and Jaesik Park and Vladlen Koltun},
title = {Fully Convolutional Geometric Features},
booktitle = {ICCV},
year = {2019},
}
- A neural network library for high-dimensional sparse tensors: Minkowski Engine, CVPR'19
- Semantic segmentation on a high-dimensional sparse tensor: 4D Spatio Temporal ConvNets, CVPR'19
- The first fully convolutional metric learning for correspondences: Universal Correspondence Network, NIPS'16
- 3D Registration Network with 6-dimensional ConvNets: Deep Global Registration, CVPR'20
- Gojcic et al., Learning multiview 3D point cloud registration, CVPR'20
- Choy et al., Deep Global Registration, CVPR'20 Oral
We want to thank all the ICCV reviewers, especially R2, for suggestions and valuable pointers.