Semi-Supervised Semantic Mapping through Label Propagation with Semantic Texture Meshes

TL;DR

This paper introduces a scalable semi-supervised method for semantic mapping that combines geometric meshes with high-resolution semantic textures, improving consistency and accuracy in scene understanding for robotics.

Contribution

It presents a novel approach that couples geometric meshes with independent-resolution semantic textures, enabling scalable and accurate semantic mapping with temporal and spatial consistency.

Findings

Effective semantic map reconstruction on NYUv2 dataset

Scalable approach for large building scenes

Improved consistency in semantic segmentation

Abstract

Scene understanding is an important capability for robots acting in unstructured environments. While most SLAM approaches provide a geometrical representation of the scene, a semantic map is necessary for more complex interactions with the surroundings. Current methods treat the semantic map as part of the geometry which limits scalability and accuracy. We propose to represent the semantic map as a geometrical mesh and a semantic texture coupled at independent resolution. The key idea is that in many environments the geometry can be greatly simplified without loosing fidelity, while semantic information can be stored at a higher resolution, independent of the mesh. We construct a mesh from depth sensors to represent the scene geometry and fuse information into the semantic texture from segmentations of individual RGB views of the scene. Making the semantics persistent in a global mesh enables us to enforce temporal and spatial consistency of the individual view predictions. For this, we propose an efficient method of establishing consensus between individual segmentations by iteratively retraining semantic segmentation with the information stored within the map and using the retrained segmentation to re-fuse the semantics. We demonstrate the accuracy and scalability of our approach by reconstructing semantic maps of scenes from NYUv2 and a scene spanning large buildings.

Figures

Tables

Table 1. Table 1: NYUv2 results: We compare our method against single-frame predictions and SemanticFusion  (McCormac et al., 2017 ) . All cases are evaluated with and without Label Propagation (LP). For the case of single-frame, we exclude pixel without a valid depth measurement. All evaluations were performed at 320 × 240 320 240 320\times 240 resolution.

Method	Bed	Bookshelf	Ceiling	Chair	Floor	Furniture	Objects	Picture	Sofa	Table	Tv	Wall	Window	Mean IoU
Single frame	0.46	0.17	0.13	0.25	0.68	0.34	0.28	0.33	0.22	0.15	0.12	0.51	0.29	0.302
Single frame with LP	0.52	0.20	0.14	0.27	0.68	0.35	0.30	0.35	0.26	0.14	0.14	0.53	0.31	0.322
SemanticFusion	0.47	0.15	0.18	0.30	0.65	0.36	0.30	0.35	0.24	0.15	0.20	0.53	0.33	0.324
SF with LP	0.52	0.18	0.21	0.31	0.65	0.38	0.31	0.38	0.28	0.16	0.20	0.54	0.36	0.343
Ours	0.54	0.17	0.23	0.35	0.71	0.40	0.33	0.39	0.28	0.18	0.21	0.56	0.37	0.363
Ours with LP	0.56	0.20	0.25	0.35	0.68	0.40	0.34	0.41	0.31	0.17	0.23	0.57	0.38	0.372

Table 2. Table 2: Poisson reconstruction using the naïvely aggregated cloud and our edge-aware simplified cloud. We report the number of points of the input cloud, the number of vertices of the reconstructed mesh, and the time and peak memory used by the reconstruction process.

Cloud	#Points	#Verts	Time($s$)	Mem($\mathrm{GB}$)
full	$103$M	$4.5$M	$521.9$	$2.82$
simple	$21$M	$3.3$M	$193.8$	$1.99$

Table 3. Table 3: Distance fall-off: We experiment with various thresholds for d m ​ i ​ n subscript 𝑑 𝑚 𝑖 𝑛 d_{min} and d m ​ a ​ x subscript 𝑑 𝑚 𝑎 𝑥 d_{max} for the linear fall-off during semantic integration on the courtyard dataset. Having no distance weighting (full confidence in the semantic information regardless of distance), achieves the lowest IoU. Modifying d m ​ i ​ n subscript 𝑑 𝑚 𝑖 𝑛 d_{min} has a marginal effect while restricting d m ​ a ​ x subscript 𝑑 𝑚 𝑎 𝑥 d_{max} is detrimental as too much distant information is discarded.

	No weight	$30m$-$100m$	$0m$-$100m$	$0m$-$30m$
IoU	0.294	0.3259	0.3289	0.309

Equations

$$g_F({\mathbf{p}}_w)$$

$$({\mathbf{p}}_F,1{)}^{⊺}$$

$${\pi }_F({\mathbf{p}}_F)$$

$$(x,y,z{)}_F^{⊺}$$

$${\mathbf{u}}_F$$

$$\begin{array}{rl}{\vec{n}}_f& =\frac{{\mathbf{e}}_{1,2}\times {\mathbf{e}}_{3,2}}{\Vert {\mathbf{e}}_{1,2}\times {\mathbf{e}}_{3,2}\Vert },\\ {\vec{n}}_v& =\sum _{f\in AdyF(v)}^n{\alpha }_f\cdot {\vec{n}}_f,\\ {\vec{n}}_v& ={\vec{n}}_v/\Vert {\vec{n}}_v\Vert .\end{array}$$

$$q=\frac{4a\sqrt{3}}{h_1^2+h_2^2+h_3^2},$$

$$\begin{array}{rl}L& =\underset{c}{\mathrm{argmax}}P(O_u=l_i|I_k),\\ P^{\ast }& =\underset{c}{\max }P(O_u=l_i|I_k).\end{array}$$

$$r_{x_i}$$

$$S({\mathbf{u}}_x,l{)}^t$$

$$W({\mathbf{u}}_x{)}^t$$

$$l_{x_i}$$

$$p_{x_i}$$

$$w_{x_i}$$

$$\begin{array}{rl}C({\mathbf{u}}_x{)}^t& =\frac{W({\mathbf{u}}_x{)}^{t-1}C({\mathbf{u}}_x{)}^{t-1}+w_{x}I(\pi (g_F({\mathbf{p}}_x)))}{W({\mathbf{u}}_x{)}^{t-1}+w_x},\\ W({\mathbf{u}}_x{)}^t& =W({\mathbf{u}}_x{)}^{t-1}+w_x.\end{array}$$

$$\begin{array}{rl}{w}_x& =w_{dist}\cdot w_{vign}\cdot w_{view},\\ w_{dist}& =({\Vert g_F({\mathbf{p}}_{w,x})\Vert }_2^2{)}^{-1},\\ w_{vign}& =\cos ({\theta }_x{)}^4,\\ w_{view}& =({\mathbf{o}}_w-{\mathbf{p}}_{w,x})\cdot {\mathbf{n}}_x.\end{array}$$

$$\begin{array}{rl}{p}_{x_l}& =S({\mathbf{u}}_x,l)/W(u_x).\end{array}$$

$$\begin{array}{rl}{\mathbf{u}}_F& =\pi (g_F({\mathbf{p}}_x)),\\ S^{\ast }& =\underset{c}{\mathrm{argmax}}S,\\ S_F^{\ast }({\mathbf{u}}_F)& =S^{\ast }({\mathbf{u}}_x),\\ \tilde{L}({\mathbf{u}}_F)& =\{\begin{array}{ll}{S}_F^{\ast }({\mathbf{u}}_F),& p_{x_l}\ge p_{min}\\ Unlabeled,& \text{otherwise}\end{array}.\end{array}$$

$$\begin{array}{rl}\gamma & =\sum _{i}B(L_i,S_F^{\ast }({\mathbf{u}}_F))P^{\ast },\\ B(L_i,S_F^{\ast }({\mathbf{u}}_F))& =\{\begin{array}{ll}1,& L_i\ne S_F^{\ast }({\mathbf{u}}_F)\\ 0,& L_i=S_F^{\ast }({\mathbf{u}}_F)\end{array}\end{array}$$

Full text

In: International Journal of Computer Vision (IJCV), 2019 DOI: 10.1007/s11263-019-01187-z

1 Introduction

Robots acting in real-world environments need the ability to understand their surroundings, and know their location within the environment. While the problem of geometrical mapping and localization can be solved through SLAM methods (Zollhöfer et al., 2018), many tasks require knowledge about the semantic meaning of objects or surfaces in the environment. The robot should, for instance, be able to recognize where the obstacles are in the scene, and also understand whether those obstacles are cars, pedestrians, walls, or otherwise.

The problem of building maps has been extensively studied (Kostavelis and Gasteratos, 2015). Most approaches can be grouped into the following three categories, based on map representation:

• •

Voxel-based: The scene is discretized into voxels, either using a regular grid, or an adaptive octree. Each voxel stores the binary occupancy value (occupied, empty, unknown) or the distance to the surface commonly referred to as Signed Distance Function (SDF).

• •

Surfel-based: The map is represented by small surface elements, which store the mean and covariance of a set of 3D-points. Surfels suffer from less discretization errors than voxels.

• •

Mesh-based: The map is represented as a set of vertices with faces between them. This naturally fills holes and allows for fast rendering using established graphics pipelines.

Current semantic mapping systems treat the semantic information as part of the geometry, and store label probabilities per map element (voxel, sufel or mesh vertex/face). This approach has the intrinsic disadvantage of coupling the resolution of the geometrical representation to the semantics, requiring a large number of elements to represent small semantic objects or surface parts. This is an undesirable effect as it leads to unnecessary memory usage especially in man-made environments, where the geometry is mostly planar, and high geometrical detail would be redundant. Often, it suffices to represent the semantics relative to a rough geometric shape.

The key idea of our approach, visualized in Fig. 1, is to couple the scene geometry with the semantics at independent resolution by using a semantic texture mesh. In this, the scene geometry is represented by vertices and faces, whereas the semantic texture categorizes the surface with higher resolution. This allows us to represent semantics and geometry at different resolutions in order to build a large semantic map, while still maintaining a low memory usage. As our segmentation module we make use of RefineNet (Lin et al., 2017) to predict a semantic segmentation for each individual RGB view of the scene. These predictions are probabilistically fused onto the semantic texture that is supported by a coarse mesh representing the scene geometry. Having a globally persistent semantic map enables us to establish a temporal and spatial consistency that was previously unobtainable for individual-view predictor. To this end, we propose to propagate labels from the stable mesh by projection onto each camera frame, in order to retrain the semantic segmentation in a semi-supervised manner. Expectation Maximization (EM) is then carried out by alternating between fusing semantic predictions and propagating labels. This iterative refinement allows us to cope with view points which were not common in the training dataset. A predictor pretrained on street-level segmentation will not work well on images captured by a micro aerial vehicle (MAV) at higher altitudes or close to buildings. However, projecting confident semantic labels fused from street level onto less confident parts of views will enable to learn the semantic segmentation of new viewpoints (see Fig. 3).

We compare our method with SemanticFusion (McCormac et al., 2017), and evaluate the accuracy on the NYUv2 dataset (Silberman et al., 2012). We show that the increased resolution of the semantic texture allows for more accurate semantic maps. Finally, propagation and retraining further improve the accuracy, surpassing SemanticFusion in every class.

To showcase the benefits of textured meshes in terms of scalability and speed, we also recorded a dataset spanning multiple buildings, annotated with the $66$ classes of the Mapillary dataset (Neuhold et al., 2017). We demonstrate that we are able to construct a large map using both RGB and semantic information in a time- and memory-efficient manner.

2 Related Work

The annotation of large datasets is a costly and time-consuming matter. Hence, the automation of annotation as well as the transfer of knowledge across different domains and datasets are active research topics. Most networks for image segmentation or their respective backbone (e.g. RefineNet (Lin et al., 2017) and Mask R-CNN (He et al., 2017) with ResNet-backbone (He et al., 2016) ) are nowadays pretrained on large datasets like ImageNet (Deng et al., 2009) and only finetuned for a specific dataset or purpose.

Vezhnevets et al. (2012) classify super pixels in an automated manner using a pairwise conditional random field and request human intervention based on the expected change. Likewise, Jain and Grauman (2016) use a Markov Random Field for joint segmentation across images given region proposals with similar saliency. The resulting proposals are later fused to obtain foreground masks while supervision is requested based on an images influence, diversity and the predicted annotation difficulty. Instead, Yang et al. (2017) cluster unannotated data based on cosine similarity to other images and simply choose per cluster the one with most similar images for human labeling. Mackowiak et al. (2018) take a more cost-centric approach and train one CNN for semantic segmentation and one for a cost model that estimates the necessary clicks for annotating a region. The cost model predictions are then fused with the vote entropy of the segmenting networks activation and supervision is requested for a fixed number of regions. Castrejon et al. (2017) provide with Polygon-RNN a more interactive approach. Given a (drawn) bounding box around an object, the RNN with VGG-16 backbone (Simonyan and Zisserman, 2014) predicts an enclosing polygon around the object. The polygon can be corrected by a human annotator and fed back into the RNN to improve the overall annotation accuracy. Acuna et al. (2018) improve upon Polygon-RNN through architecture modifications, training with reinforcement learning and increased polygonal output resolution.

Most semantic segmentation methods are not real-time capable. Hence, Sheikh et al. (2016) proposed to use quad-tree based super pixels where only the center is classified by a random forest and labels are propagated to a new image if the super pixels location and intensity do not change significantly. This inherently assumes small inter frame motion but does not take spatial correspondences into account, yet runs on a CPU with up to 30 fps.

While image segmentation is fairly advanced, labeling point clouds still has a large potential for improvement. Voxel-based approaches like OctNet (Riegler et al., 2017) precompute a voxel grid and apply 3D- convolutions. Most grid cells are empty for sparse LIDAR point clouds. Hence, recent research shifts towards using points directly (Qi et al., 2017a, b), forming cluster of points (Landrieu and Simonovsky, 2017), applying convolutions on local surfaces (Tatarchenko et al., 2018) or lifting points to a high-dimensional sparse lattice (Su et al., 2018). These methods do not enforce consistent labels for sequential data and would need to be recomputed once new data is aggregated while being strongly memory constrained. Nevertheless, Zaganidis et al. (2018) showed that semantic predictions can improve point cloud registration with GICP and NDT.

Semantic reconstruction and mapping received much attention in recent years. Civera et al. (2011), for example, paved the way towards a semantic SLAM system by presenting an object reasoning system, able to learn object models using feature descriptors in an offline step and then recognizing and registering them to the map at run time. However, their system was limited to a small number of objects and apart from the recognized objects, the map was represented only as a sparse point cloud. Bao and Savarese (2011) exploit semantics for Structure-from-Motion (SfM) to reduce the initial number of possible camera configurations and add a semantic term during Maximum-Likelihood estimation of camera poses and scene structure. Subsequently, Bao et al. (2013) use the estimated scene structure to generate dense reconstructions from learned class-specific mean shapes with anchor points. The mean shape is warped with a 3D thin plate spline and local displacements are obtained from actual details of the instance.

Instead, Häne et al. (2013) fuse single frame depth maps from plane sweep stereo to reconstruct a uniform voxel grid and jointly label these voxels by rephrasing the fusion as a multi-label assignment problem. A primal-dual algorithm solves the assignment while penalizing the transition between two classes based on class-specific geometry priors for surface orientation. Their method is also able to reconstruct and label underlying voxels and not only visible ones.

In subsequent work, more elaborate geometry priors have been learned, e.g. using Wolff shapes from surface normal distributions (Häne et al., 2014) and recently end-to-end-learned with a 3D-CNN  (Cherabier et al., 2018). The data term in the optimization has been improved (Savinov et al., 2016), memory consumption and runtime reduced (Cherabier et al., 2016; Blaha et al., 2016), and an alignment to shape priors integrated (Maninchedda et al., 2016).

Schönberger et al. (2018) utilize the approach of Häne et al. (2013) for visual localization with semantic assistance to learn descriptors. An encoder-decoder CNN is trained on the auxiliary task of Scene Completion given incomplete subvolumes. The encoder is then used for descriptor estimation. Given a bag of words with a corresponding vocabulary one can thus query matching images for a given input frame.

For incremental reconstruction, Stueckler et al. (2014) presented a densely- represented approach using a voxel grid map. Semantic labels were generated for individual RGB-D views of the modeled scene by a random forest. Labels were then assigned projectively to each occupied voxel and fused using a Bayesian update. The update effectively improved the accuracy of backprojected labels compared to instantaneous segmentation of individual RGB-D views.

Similarly, Hermans et al. (2014) fused semantic information obtained from segmenting RGB-D frames using random forests but represented the map as a point cloud. Their main contribution was an efficient spatial regularizing Conditional Random Field (CRF), which smoothes semantic labels throughout the point cloud. Li and Belaroussi (2016) extended this approach to monocular video while using the semi-dense map of LSD-SLAM (Engel et al., 2014). Here, the DeepLab-CNN (Chen et al., 2018) was used instead of a random forest for segmentation.

Vineet et al. (2015) achieve a virtually unbounded scene reconstruction through the use of an efficient voxel hashed data structure for the map. This further allows them to incrementally reconstruct the scene. Instead of RGB-D cameras, stereo cameras were employed and depth was estimated by stereo disparity. Semantic segmentation was performed through random forest. The requirement for dense depth estimates is lifted in the approach of Kundu et al. (2014). They use only sparse triangulated points obtained through monocular Visual SLAM and recover a dense volumetric map through a CRF that jointly infers semantic category and occupancy for each voxel.

A different approach is used in the keyframe-based monocular SLAM system by Tateno et al. (2017) where a CNN predicts per keyframe the pixel-wise monocular depth and semantic labels.

Lianos et al. (2018) reduce drift in visual odometry via establishing of semantic correspondences over longer periods than possible with pure visual correspondences. The intuition is that the semantic class of a car will stay a car even under diverse illumination and view point changes while visual correspondences may be lost. However, semantic correspondences are not discriminative in the short term.

Tulsiani et al. (2017) perform single view reconstruction of a dense voxel grid with a CNN. During training multiple views of the same scene guide the learning by enforcing the consistency of viewing rays incorporating information from multiple sources like foreground masks, depth, color or semantics. Whereas, Ma et al. (2017) examined the use of warping RGB-D image sequences into a reference frame for semantic segmentation to obtain more consistent predictions. Sun et al. (2018) extend OctoMap (Hornung et al., 2013) with a LSTM per cell to be able to account for long term changes like dynamic obstacles.

Nakajima et al. (2018) segment surfels from the depth image and semantic prediction using connected component analysis and further refined incrementally over time. Geometric segments along with their semantic label are stored in the 3D map. The probabilistic fusion combines the rendered current view with the current frame and its low resolutional semantics.

Surfels are also used in the work of McCormac et al. (2017). The authors integrated semantics into ElasticFusion (Whelan et al., 2015) which represents the environment as a dense surfel map. ElasticFusion is able to reconstruct the environment in real-time on a GPU given RGB-D images and can handle local as well as global loop closure. Semantic information is stored on a per-surfel basis. Inference is done by an RGB-D-CNN before fusing estimates probabilistically. SemanticFusion fuses for each visible surfel and all possible classes which is very time- and memory-consuming since the class probabilities need to be stored per surfel and class on the GPU. Objects normally consist of a large number of surfels and share in reality a single class label even though semantic information within a surfel would only be required at the border of the object where the class is likely to change. Hence, many surfels store the same redundant information and since GPU memory is notoriously limited, memory usage becomes a problem for larger surfel maps. Furthermore, SemanticFusion tends to create many unnecessary surfels with differing scales and labels for the same surface when sensed from different distances.

Closely related to our approach is the work of Valentin et al. (2013). Their map is represented as a triangular mesh. They aggregate depth images in a Truncated Signed Distance Function (TSDF) and obtain the explicit mesh representation via the marching cubes algorithm. Afterwards, semantic inference is performed for each triangle independently using a learned classifier on an aggregation of photometric (color dependent) and handcrafted local geometric (mesh related) features. Spatial regularization is ensured through a CRF over the mesh faces. Their classifier infers the label with all visible pixels per face at once and is not designed to incrementally fuse new information. Furthermore, the pairwise potential of the CRF does not take the likelihood for other classes in to account. Especially around object borders this may lead to suboptimal results. The semantic resolution is tied to the geometry of the mesh, hence to have fine details the mesh resolution needs to be fine grained. Geometrically a wall can be described with a small number of vertices and faces, but to semantically distinguish between an attached poster and the wall itself the mesh would need a high resolution.

In comparison, we only store the likelihood for a small number of most probable classes and the meshing creates a single simplified surface while the texture resolution can be chosen independent of the geometry yet appropriate to the scene. During fusion we further include weighting to account for the sensor distance and in the case of color integration include vignetting and viewing angle.

3 Overview

In this paper, we present a novel approach to building semantic maps by decoupling the geometry of the environment from its semantics by using semantic textured meshes. This decoupling allows us to store the geometry of the scene as a lightweight mesh which efficiently represents even city-sized environments.

Our method (see Fig. 2) operates in three steps: mesh generation, semantic texturing and label propagation.

In the mesh generation step, we create a mesh of the environment by aggregating the individual point clouds recorded by a laser scanner or an RGB-D camera. We assume that the scans are preregistered into a common reference frame using any off-the-shelf SLAM system. We calculate the normals for the points in each scan by estimating an edge-maintaining local mesh for the scan. Once the full point cloud equipped with normals is aggregated, we extract a mesh using Poisson reconstruction (Kazhdan and Hoppe, 2013) and further simplify it using QSlim (Garland and Heckbert, 1998). Our main contribution for 3D reconstruction is the proposal of system capable of fast normal estimation by using a local mesh and also local line simplification which heavily reduces the number of points, therefore reducing the time and memory used by Poisson reconstruction.

In the semantic texturing step, we first prepare the mesh for texturing by parameterizing it into a 2D plane. Seams and cuts are added to the mesh in order to deform it into a planar domain. A semantic texture is created in which the number of channels corresponds to the number of semantic classes. The semantic segmentation of each individual RGB frame is inferred by RefineNet and fused probabilistically into the semantic texture. We ensure bounded memory usage on the GPU by dynamically allocating and deallocating parts of the semantic texture as needed. Additionally, the RGB information is fused in an RGB texture.

In the Label Propagation step, we project the stable semantics, stored in the textured mesh, back into the camera frames and retrain the predictor in a semi-supervised manner using high confidence fused labels as ground truth, allowing the segmentation to learn from novel view points.

Hence, the contribution presented in this article is fourfold:

• •

a scalable system for building accurate meshes from range measurements with coupled geometry and semantics at independent resolution,

• •

an edge-maintaining local mesh generation from lidar scans,

• •

a label propagation that ensures temporal and spatial consistency of the semantic predictions, which helps the semantic segmentation to learn and perform segmentation from novel view points,

• •

fast integration of probability maps by leveraging the GPU with bounded memory usage.

4 Notation

In the following, we will denote matrices by bold uppercase letters and (column-)vectors with bold lowercase letters. The rigid transformation $\mathbf{T}_{F_{2}F_{1}}$ is represented as $4\times 4$ matrix and maps points from coordinate frame $F_{1}$ to coordinate frame $F_{2}$ by operating on homogeneous coordinates. When necessary, the frame in which a point is expressed is added as a subscript: e.g. $\mathbf{p}_{w}$ for points in world coordinates. A point $\mathbf{p}_{w}$ is projected into frame $F$ with the pose $\mathbf{T}_{F}$ and the camera matrix $\mathbf{K}_{F}\in\mathbb{R}^{3\times 3}$. For the camera matrix, we assume a standard pinhole model with focal length $f_{x},f_{y}$, and principal point $c_{x},c_{y}$. The projection of $\mathbf{p}_{w}$ into image coordinates $\mathbf{u}=(u_{x},u_{y})^{\intercal}_{F}\in\mathbf{\Omega}\subset\mathbb{R}^{2}$ is given by the following mapping:

[TABLE]

An image or a texture is denoted by $I(\mathbf{u}):\mathbf{\Omega}\to\mathbb{R}^{n}$, where $\mathbf{\Omega}\subset\mathbb{R}^{2}$ maps from pixel coordinates $\mathbf{u}=(u_{x},u_{y})^{\intercal}$ to $n$-channel values.

5 Method

The input to our system is a sequence of organized point clouds $\{\mathcal{P}^{t}\}$111An organized point cloud exhibits an image resembling structure, e.g. from commodity RGB-D sensors., and RGB images $\{I^{t}\}$ ($t$ indicates the time step). We assume that the point clouds are already registered into a common reference frame, and the extrinsic calibration $\mathbf{T}_{cd}$ from depth sensor to camera, as well as camera matrices, are given. The depth sensor can be an RGB-D camera or a laser scanner. The output of our system is threefold:

• •

a triangular mesh of the scene geometry, defined as a tuple $\mathcal{M}=(\mathcal{V},\mathcal{F})$ of vertices $\mathcal{V}$ and faces $\mathcal{F}$. Each vertex $\in(\mathbb{R}^{3}\times\mathbb{R}^{2})$ contains a 3D point and a UV texture coordinate, while the mesh face is represented by the indices $\in\mathbb{N}^{3}$ of the three spanning vertices within $\mathcal{V}$.

• •

a semantic texture $S$ indicating the texels class probabilities,

• •

an RGB texture $C$ representing the surface appearance.

After describing the necessary depth preprocessing in Sec. 5.1, we will explain in detail the mesh generation and parametrization (Sec. 5.2), before elaborating on the semantic (Sec. 5.3) and color integration (Sec. 5.4), sparse representation (Sec. 5.5) and label propagation (Sec. 5.6).

5.1 Depth Preprocessing

As previously mentioned, our system constructs a global mesh from the aggregation of a series of point clouds $\{\mathcal{P}^{t}\}$ recorded from a depth sensor. Many surface reconstruction algorithms require accurate per-point normal. One way to obtain these normals is by aggregating the full global point cloud, and using the k-nearest-neighbors to estimate the normals for each point. However, this would be prohibitively slow as it requires a spatial subdivision structure, like a Kd-tree, which can easily grow to a considerable size for large point clouds, limiting the scalability of the system. For fast normal estimation we take advantage of the structure of the recorded point cloud. Since depth from an RGB-D sensor is typically structured as an image, we can easily query adjacent neighboring points. Similarly, rotating lidar sensors can produce organized scans. A complete revolution of e.g. a Velodyne VLP-16 produces a 2D array of size $$16$\times N$ containing the measured range of each recorded point, where $N$ is determined by the speed of revolution of the laser scanner.

Given the organized structure, we could create a triangular local mesh with approximate normals as introduced by Holz and Behnke (2015). However, this would imply using all aggregated points despite the fact that a significant number of them are redundant, since they lay on a common plane. Hence, we propose a method for fast normal estimation and point cloud reduction which helps to reconstruct the mesh in a fast and memory efficient manner (Fig. 4). We first simplify each individual scan to obtain a reduced point cloud without sacrificing geometrical fidelity. For that, we start with the line simplification algorithm of Ramer-Douglas-Peucker (Douglas and Peucker, 1973) which is applied on each scan ring. To maintain hard edges of the point cloud, we extend Ramer-Douglas-Peucker to create offset points around the simplified edges to add a further constraint on the normals of the points, and allow the subsequent mesh generator to recover sharp features as visualized in Fig. 5 and Fig. 6. The local mesh is created by unwrapping the scan in 2D using polar coordinates, and performing a constrained 2D Delaunay triangulation. Constrained edges are set to the ones obtained from the line simplification. This ensures that points that lie on the same scan ring will be connected together by triangles. After recovering a local mesh from the point cloud, normals are first estimated per face by calculating the cross product between two of the edges, and finally per vertex using a Mean Weighted by Angle (MWA) scheme (Thürrner and Wüthrich, 1998) which weighs each triangle’s contribution by the angle under which it is incident to the vertex:

[TABLE]

where $\vec{n}_{f}$ and $\vec{n}_{v}$ denote the face and vertex normals, respectively, and $\alpha_{f}$ is the angle between the two edge vectors $\mathbf{e}_{1}$ and $\mathbf{e}_{2}$ that share the vertex. The angle between the two edge vectors can be computed using the dot product between them: $\alpha_{f}=\arccos\left(\frac{\mathbf{e}_{1}\cdot\mathbf{e}_{2}}{\left\lVert\mathbf{e}_{1}\right\rVert\left\lVert\mathbf{e}_{2}\right\rVert}\right)$.

Until now, we have obtained fast normals using only the points contained in one revolution of the Velodyne. However, due to the anisotropy in the sampling of a laser scanner, the connections between points created by the Delaunay triangulation in 2D may not be optimal when lifted to 3D, as seen in Fig. 7. Since the connections between points are crucial for an accurate normal estimation, an iterative local mesh refinement is performed. The refinement ensures that each point will be connected to the neighbors that lie spatially close in 3D. Again, in order to avoid cumbersome and slow spatial subdivision structures we introduce an edge flipping algorithm which iteratively flips the edge shared between two triangles to increase the following quality measure:

[TABLE]

where $a$ denotes the area of the triangle and $h$ is the length of the edge. We chose it such that it is monotonically increasing, and promotes more equilateral triangles. We perform edge flipping in a greedy fashion by choosing first the triangle which will experience the most quality increase. After performing the flip for a triangle, the quality of adjacent triangles may change and is updated. We continue flipping edges until the quality measure can no longer be increased.

5.2 Mesh Generation

After aggregation of the points with corresponding normals from all simplified scans, we perform Poisson reconstruction to recover a high quality mesh, despite having potentially noisy data and missing measurements. The resulting mesh can still be overly dense in areas which are geometrically simple, like the ground. Hence, we apply a second global simplification step following the QSlim method (Garland and Heckbert, 1998). This approach iteratively collapses edges until a certain error threshold, or a predetermined number of faces, is reached.

The last step in the creation of the global mesh is to prepare it for texturing by parameterizing the mesh in the 2D domain in order to obtain UV coordinates for the vertices. For that, we make use of the UV smart project function provided within Blender222https://www.blender.org.

5.3 Semantic Integration

In this section we detail our approach on how to update the global semantic texture $S$ using individual color images $I^{t}$. For semantic segmentation, we retrain RefineNet on the Mapillary dataset (Neuhold et al., 2017) for street level segmentation. The dataset contains $25\,000$ images densely labeled with $66$ classes. Given the input image $I_{k}$, the output of the predictor can be interpreted as a per-pixel probability over all the class labels $P(O_{\mathbf{u}}=l_{i}|I_{k})$, with $\mathbf{u}$ denoting pixel coordinates. One common approach to integrate semantic information is to perform a Bayesian update over the classes probability, fusing new observations into the global belief for the semantic labels. However, this scheme of updating becomes slow for a large number of classes since the belief for all labels needs to updated.

In our approach we choose to approximate the probability over the classes with only the argmax probability. Hence, a new observation will consist of only the argmax label and its probability instead of the full distribution. This enables us to use a fast integration scheme whose runtime is independent of the number of classes. We observe that in practice this approximation works well.

We define the best class $L$ and its corresponding probability $P^{*}$ using:

[TABLE]

We perform a visibility check prior to updating the global semantic texture using individual segmentation results. Inspired by shadow mapping techniques in computer graphics, we first render a depth map $D$ from the current camera view. In order to ensure that every texel is checked for visibility, we obtain for each texel $x$ with UV coordinates $\mathbf{u}_{x}$ the 3D point $\mathbf{p}_{x}$ from the vertices of the corresponding mesh face by barycentric interpolation. The point $\mathbf{p}_{x}$ is then projected into the current view, and discarded if the depth $d_{x}$ is larger than the stored value within the depth map $D(\pi(g_{F}(\mathbf{p}_{x})))$, as it lies behind the visible part of the mesh. To indicate visibility, we use a per texel indicator variable $r_{x}\in\left\{0,1\right\}$:

[TABLE]

All remaining texels $(r_{x}>0)$ are fused with the current segmentation result by increasing the probability of the obtained classes:

[TABLE]

Additionally, we weigh the fused probability by the faces distance from the camera under the assumption that pixels are more difficult to recognize from farther away, due to the low resolution of semantic segmentation.

[TABLE]

where $d_{x}$ denotes the depth of the current texel, and $d_{min}$ and $d_{max}$ are thresholds for the distance which define a linear fall-off for the weight. In our experiments we set them to $30\text{\,}\mathrm{m}$ and $100\text{\,}\mathrm{m}$, respectively.

5.4 Color Integration

In addition to the semantics, we also fuse the raw images into a global color texture. The fusion is carried out by a weighted running average:

[TABLE]

The weight $w_{x}$ takes the distance, the radial intensity fall-off within an image, and the viewing angle into account:

[TABLE]

Here, $w_{dist}$ is the inverse distance from the texel to the camera, which promotes frames that are spatially closer to the mesh, improving the resolution of the fused colors. The viewing angle $\theta_{x}$ between reprojection of the texel and the principal axis of the camera is used to account for the radial decrease in intensity by following the $\cos^{4}$ law (Goldman and Chen, 2005). The third term $w_{view}$ increases the weight for texels that are imaged by the camera originating at $\mathbf{o}_{w}$ from a frontal perspective, further improving the quality of the fused texture.

We chose different update schemes for color and semantics as their behavior is radically different. Firstly, the semantic segmentation is trained to be robust to illumination changes, hence the vignetting term is unnecessary. Secondly, it is not clear that the angle to the surface is a good indicator for confidence in semantic segmentation. In our experiments, we observed that the predictor learns to some extent the relative angle of surfaces with respect to camera view, thus weighting based on relative angle may be adversarial. For example during sudden camera movements tilting toward the ground, the semantic segmentation decreases in accuracy as the view is unfamiliar to the predictor. Thirdly, the distance weight assumes that the accuracy of the semantics is more confident for closer surfaces. However, this is not accurate for large semantic entities like buildings for which the accuracy decreases as we go closer, due to large untextured areas, and increases as we take a step back and observe the bigger picture.

5.5 Sparse Semantic Volume

The semantic 3D texture $S$ contains for each texel the probability distribution over all the classes. However, for reasonable sized resolutions and number of classes, this volume can occupy more memory than is typically available in modern GPUs, rendering this process infeasible. For a texture with 8.192$\times$8.192 pixels and the $66$ classes of the Mapillary dataset, we would need to allocate a volume of $16.5\text{\,}\mathrm{GB}$ (assuming we store each element as a floating point number of $4$ bytes). This problem will only become worse as we add more class labels or increase texture size. In order to overcome this issue, we propose to store the semantics into a sparse 3D texture in which we allocate and deallocate dynamically the memory, ensuring bounded memory usage.

In the first step, we divide our global semantic volume into pages of size 128$\times$128$\times$1. Each page333Page size was chosen based on common supported values for multiple computers used during development. stores the probability for only one class and can be either allocated in GPU memory or not. The volume starts initially with all pages in a deallocated state. Hence, it occupies no space on the GPU.

When fusing the semantic probability from the current frame into $S$, the corresponding pages that will be affected are computed and targeted for committing on the CPU. This ensures that we only add the parts that are actually relevant. After each frame, we also check for pages that have low probability and deallocate them from memory. The probability for a texel is computed as:

[TABLE]

If any texel inside a page is above a certain threshold, we will keep the corresponding page in memory, otherwise we target it for decommitting. This scheme of committing and decommitting portions of the memory can be seen as intrinsically tracking the modes of the distribution over the classes, ignoring parts with negligible probability.

Other schemes for memory reduction can be employed like quantization of the semantic 3D texture in which the stored probability is represented with a lower bit depth (reducing it to 2 bytes or even a mere 1 byte). However this approach is not scalable to bigger datasets with more classes and is prone to rounding errors in the case of very low bit depth. For this reason we deem that taking advantage of the sparsity in the semantic volume is a more appropriate method to deal with the memory issue.

5.6 Label Propagation

The fusion of semantic information from various view points into a global representation opens up possibilities to enforce temporal and spatial consistency of the semantic predictions by propagating the labels. The key insight is that if the majority of observations of the texture element predicts the correct class, the fused information $S^{*}$ will be confident enough ($p_{x_{l}}\geq p_{min}$) in order to be used as ground truth. Hence, we can reproject the mesh into any camera frame, propagate the label $\widetilde{L}(\mathbf{u}_{F})$ and retrain the semantic segmentation in a semi-supervised fashion to minimize discrepancy between image predictions $L$ and mesh label $S^{*}$. Reprojecting the semantics into a camera frame is performed as follows:

[TABLE]

The result consists of the image $\widetilde{L}(\mathbf{u}_{F})$ which we denote as pseudo ground truth. This semantic labeling, together with the corresponding RGB view $I$ will be used to retrain the predictor.

The retraining ensures that the semantic segmentation will segment objects and surfaces more consistent as belonging to a certain class, regardless of different or extreme view points or even illumination changes. Furthermore, the label propagation and retraining stages can be applied iteratively in an Expectation Maximization scheme, e.g. for a certain number of iterations, or until all camera frames reach a consensus. This process is illustrated in Fig. 3. The obvious caveat are wrong predictions used for retraining since bootstrapping this has a self-reinforcing character. We have seen this behavior only in some rare cases where the initial single-frame predictions were already incorrect, e.g. the table in the bottom row of Fig. 11.

Due to the significant number of camera frames contained in a large-scale dataset, we perform a conservative frame selection in order to choose only a subset of frames on which to reproject the semantics for retraining. The frame selection is based on an inconsistency coefficient, which rates frames higher the more instantaneous semantic segmentations deviates from mesh semantics.

The inconsistency coefficient $\gamma$ is calculated as:

[TABLE]

Given this coefficient for each frame, we select a restricted percentage of frames with the highest coefficient (in our experiments we choose $5\text{\,}\mathrm{\char 37\relax}$ of the frames for NYU and $15\text{\,}\mathrm{\char 37\relax}$ for the courtyard dataset) to be used for retraining. The intuition is that there is more information to gain by retraining on inconsistent frames as opposed to the ones which are already correct. Moreover, we also restrict the selected views to be at least 10 frames apart from one another to avoid adding redundant views that are too similar. In order to prevent forgetting during retraining, we add the original training set (in our case all the images from the NYU or Mapillary dataset, respectively) to the new views.

Additionally, we experiment with another type of view selection in which we select for retraining the ones with the lowest rather than highest inconsistency coefficient. The intuition behind this alternative scheme is that by reinforcing good frames (or the ones that are close to being good), the other frames that are ”close” to them will also be improved. Therefore, performing the label propagation iteratively will eventually ”lift” the less consistent frames to become better by reinforcing the ones that are already good or close to being good. An illustration of this process is depicted in Fig. 9. We ignore for this selection type the frames which have a too high consistency level as we saw that in the general case they provide too little new information. We rather focus on frames that are quite consistent but not fully. Hence, frames with more than $98\text{\,}\mathrm{\char 37\relax}$ of consistent pixels are ignored. From the remaining set we select the same percentages as mentioned earlier.

6 Implementation

Our pipeline consists of three modules, the mesh generator, the semantic texture integrator and the segmentation retraining. The mesh generator module is fully implemented in C**++** and integrated into ROS (Quigley et al., 2009) for ease of interaction with other ROS packages. The texturer was also developed in C**++** with the addition of OpenGL for rendering and semantic integration using GLSL compute shaders.

We will describe in detail the optimization choices made for semantic integration as they are the main focus of this work. The segmentation map is initially precalculated from the predictor and stored to disk. An asynchronous module reads the RGB images and the corresponding segmentation maps and stores them in ringbuffers ready to be processed by the texturing module. The texturing module receives the images and transfers them to the GPU using double buffered Pixel Buffer Objects (PBO) in a method commonly known as ping ponging. This ensures that the transfer can be done on the GPU side using Direct Memory Access (DMA), freeing the CPU to do other tasks in the meantime. The semantic integration is performed fully on the GPU through efficient compute shaders.

In order to deal with the sparsity of our semantic 3D texture we make use of the GL_ARB_sparse_texture extension from OpenGL which provides functionality for committing and decommitting from sparse (partially resident) textures. However, the committing and decommitting of pages can only be performed from the CPU side, which requires synchronization and communication between CPU and GPU. We use two buffers for this communication, one for signaling to the CPU which pages require committing and one for confirmation to the GPU that they were committed. These buffers are updated asynchronously and are also double buffered to prevent stalling the pipeline.

While double buffering allows maximum usage of the available resources, it also implies a delay of one frame between the CPU-GPU communication which in our case does not pose a problem due to the high frame rate at which the camera images arrive.

7 Experiments

All tests were performed on a Intel Core i7-940 $2.93\text{\,}\mathrm{GHz}$ CPU with an NVIDIA Titan GPU.

7.1 NYUv2 Dataset

For comparison against SemanticFusion (McCormac et al., 2017) we utilize the NYUv2 dataset (Silberman et al., 2012) and use $108$ out of all sequences where ElasticFusion did not exhibit significant drift. For fairness comparability, we use the final surfel map for meshing and the segmentation module of Eigen and Fergus (2015) used within SemanticFusion that is trained on the $13$ NYU classes. Furthermore, we store the semantics for Intersection-over-Union (IoU) calculation after the scene is completed and fused semantics are static.

The implementation of SemanticFusion provides two CNNs pretrained on the NYUv2 dataset, one that receives RGB only and another that receives RGB-D data from the Kinect. While the original work of SemanticFusion evaluates their approach using the RGB-D-CNN ( including scene depth as an additional feature map ) we use for our evaluation their RGB-CNN since we want our method to work well even in outdoor scenarios where dense depth may not be obtainable.

The network is retrained using both methods for view selection (worse or best frames) with a learning rate of ${10}^{-6}$. The model is saved after each epoch and training is stopped when the model begins to overfit or the IoU for the epoch starts to decrease.

For retraining with the worse frames we add from each NYU scene $5\text{\,}\mathrm{\char 37\relax}$ of the frames with the highest inconsistency coefficient. This percentage is chosen such that the amount of pseudo ground truth frames is comparable to the $795$ originally used for training. The retraining then uses both the original training set and our pseudo ground truth. In the case of retraining with the best frames we choose the $5\text{\,}\mathrm{\char 37\relax}$ frames with the lowest inconsistency coefficient, ignoring however those that have too few inconsistent pixels (in our case we choose those that have at least $2\text{\,}\mathrm{\char 37\relax}$ of the pixels labeled as inconsistent).

7.2 Courtyard Dataset

The courtyard dataset (Droeschel and Behnke, 2018) was captured using a DJI Matrice 600, with a horizontally attached Velodyne VLP-16 laser scanner. The lidar has $16$ horizontal scan lines and a vertical field-of-view of $30\text{\,}\mathrm{\SIUnitSymbolDegree}$ with a maximum range of $100\text{\,}\mathrm{m}$. The color images were captured at $10\text{\,}\mathrm{Hz}$ using two synchronized global shutter Point Grey Blackfly-S U3-51S5C-C color cameras, with a resolution of 2448$\times$2048 pixels. The MAV poses for this dataset were provided by Droeschel and Behnke (2018). The camera poses were calculated from the provided extrinsics and the continuous-time trajectory under consideration of an additional $40\text{\,}\mathrm{ms}$ time offset. The two cameras are mounted outward pointing on the left and right side of the copter to improve visual coverage. In total $13\,458$ frames were captured during the experiment. We densely annotated $48$ images spread throughout the area to conduct accuracy experiments.

RefineNet with ResNeXt-101 (Xie et al., 2017) was trained on the Mapillary dataset for $10$ epochs with a learning rate of ${10}^{-5}$ and a batch size of $1$. The final IoU achieved is $0.4546$ placing the result on 3rd position on the Mapillary leaderbord444https://eval-vistas.mapillary.com/featured-challenges/1/leaderboard/1. The retraining with pseudo ground truth has to be done with a larger batch size of $16$ to account for the decreased signal-to-noise-ratio introduced by the pseudo ground truth. We performed five epochs of further retraining. The retrained RefineNet achieves $0.4487$ IoU on the Mapillary dataset. The slight reduction in accuracy is explained by the fact that the neural network is forced to learn from a new dataset which is different from the Mapillary one in which it is evaluated.

7.3 Accuracy Evaluation

We execute the two variants of Label Propagation for three iterations on the NYUv2 dataset. We observe that retraining on the worse frames yields a higher IoU hence we prefer this option for all further experiments. Furthermore, the highest increase in IoU is experienced after the first iteration, while subsequent ones yield a noticeably less improvement. We hypothesize that a random selection strategy would be placed somewhere in between both variants since some with high and some with low inconsistency coefficients would be chosen.

We computed the IoU for different configurations on the NYUv2 dataset, including single-frame predictions and Semantic Fusion. Label propagation was performed using our approach to retrain the predictor. We denote in Tab. 1 the use of the retrained semantic segmentation as with LP. Tab. 1 shows that our method outperforms single-frame as well as SemanticFusion. Using label propagation further improves the IoU. A visual comparison is provided in Fig. 11 for four different scenes. Already SemanticFusion improves single-frame predictions e.g. on the TV (yellow, first row), the window (blue, third row) and wall (gray, last row), but the result is noisy and partially inconsistent. We attribute this mostly to surfels on different scales that are not correctly fused. In comparison, our mesh is more consistent, for example on the bath tub (second row), but smoother around the edges. Yet, the bed (third row) is still mostly classified as a sofa. Through our label propagation and subsequent retraining, we were able to correct the classification. In the last row, we show a failure case in which the Label Propagation decreases the accuracy as the table (green) gets segmented as furniture. This decrease in accuracy is due to the fact that most single-frame predictions are wrongly labeling the object and establishing consistency through LP reinforces this wrong labeling. Further complete reconstructed scenes from NYUv2 are visualized in Fig. 12.

We also conduct accuracy experiments on the courtyard dataset for which we densely labeled $48$ frames around the scene. For fairness we labeled sky as background due to missing representation within the mesh. Fig. 13 shows that retraining using label propagation greatly improves the accuracy for most classes. However, an interesting observation from this experiment is that the single-frame predictions have on average higher accuracy than the fused semantics from the mesh. This is due to the fact that both the camera poses and the mesh are imperfect, hence fusing the information from various points of view may lead to discrepancies. This limitation is further reinforced by the fact that the classes which experience a higher drop in accuracy from the fusing process are those which are spatially small (lane-markings, poles, and street lights), while broader classes like building and vegetation remain largely unaffected by errors from the scene reconstruction. For this reason we conduct further experiments to evaluate the impact of misalignments in the following Sec. 7.4. Nevertheless, we can conclude that label propagation grants a net improvement in the semantic accuracy, increasing the mean IoU for single-frame prediction by $7\text{\,}\mathrm{\char 37\relax}$ and for the fused information by $3\text{\,}\mathrm{\char 37\relax}$. Fig. 14 shows a visual comparison of the semantics using various view points from the courtyard. The copters landing gear and rotor arm visible within camera images are masked out prior to evaluation. A partial failure case is shown in the first row. The thin lane-markings are actually degraded through fusion and LP. We trace this back to inaccurate manual extrinsic and temporal calibration, since the corresponding single-frames continuously contained the lane-markings. Still, we observe improvements after LP on the container next to the service station. The second view was captured from behind the same service station. Insufficiency in the meshing process created only the top of the pole (front, left), which is correctly classified, but not connected to the ground plane reducing the overall IoU compared towards single-frame predictions. Further improvements through LP are especially visible in the last two rows. The left window is classified as a sign prior to retraining and a large portion of the sidewalk was incorrect. Also the building in the background is improved. The rooftop (third row) presents a unique novel view that is largely misclassified in the single-frame. Our mesh-based fusion improves the result as expected and allows successful retraining.

7.4 Registration Robustness

Mapping with known poses always raises the question of how robust the system is regarding misalignment. For this we perform experiments on the synthetic Synthia dataset (Ros et al., 2016) which provides ground truth poses, depth and semantics. We add random noise to the poses in order to observe the effect on the accuracy of the semantic map. We chose the seq_4_summer scene, due to the low number of dynamic objects. We aggregated the depth images and meshed the resulting point cloud (see Fig. 15). Synthia provides images from eight cameras arranged in groups of four to create an omnidirectional view-cone. For simplicity, we choose for the reconstruction only the front-facing camera of the left group. In order to analyze the behavior of the semantic map under incorrect poses or incorrect calibration between depth and color camera, the IoU is calculated for increasing amounts of noise on the translational ($\leq$0.5\text{,}\mathrm{m}) as well as rotational ($\leq$5\text{\,}\mathrm{\SIUnitSymbolDegree}) part of the camera poses. The IoU with increasing portion of noise is visualized per class in Fig. 16 with invisible or dynamic classes being disregarded. We choose to retain the cars as most of them were parked, and hence do not pose a problem for the reconstruction. As expected, the IoU decreases faster for smaller object classes, like poles, lights, and signs, than for buildings or the road. In conclusion, as the robotics community moves towards larger and bigger datasets with more semantic classes, the detail of the semantic maps will heavily depend on correct sensor poses.

7.5 Runtime Performance

We evaluate the runtime performance of our meshing and texturing modules separately, as they are performed sequentially with no overlap. Fig. 17 shows the resulting meshes after Poisson reconstruction for our simplified cloud, and the naïvely aggregated full point set recorded by the Velodyne scanner. It can be observed that the reconstruction quality does not suffer while the runtime and memory consumption is significantly decreased (see Tab. 2).

The runtime of the semantic integration on the courtyard dataset is summarized in Fig. 18. We achieve real-time performance with an average texturing time of $27.1\text{\,}\mathrm{ms}$ per frame using a $8$K texture. Decommitting the sparse volume is, however, a demanding functionality, and causes the average time per frame to increase to $90.1\text{\,}\mathrm{ms}$. Nevertheless, the semantic integration achieves $38.6\text{\,}\mathrm{ms}$ per frame for a smaller texture resolution of $4$K.

7.6 Memory Consumption

Memory usage of the texturing system is also evaluated with and without decommitting of pages of the sparse texture. The results for the courtyard dataset are summarized in Fig. 19. We also analyze the relation between the decommitting threshold (the probability below which the pages in the sparse texture are deallocated) and the Intersection-over-Union (IoU) in Fig. 20. We evaluate this measure on the NYU dataset due to the presence of more labeled images than in the courtyard dataset which allows for a more accurate evaluation. We observe that while low values of the threshold greatly reduces memory usage, higher values cause the IoU to degrade as more valuable information from the semantic texture is disregarded. However the decrease is still minor ($\leq$0.6\text{,}\mathrm{\char 37\relax}$$), as we restrain from decommitting pages that contain the argmax class. For further experiments, we chose a threshold value of $0.1$.

7.7 Texture Resolution and Semantic Accuracy

We evaluate the impact of the semantic texture resolution and the accuracy of the semantic map. We perform the evaluation on the courtyard dataset as it spans a larger area than the NYU dataset and therefore the impact of the texture size becomes more noticeable. Semantic texture integration is performed for a series of texture resolutions ranging from $512$ to $12\,288$ pixels and IoU is evaluated for each one. We observe that the IoU steadily increased ans becomes stable at around a resolution of $4$k.

7.8 Distance Weighting and Semantic Accuracy

During semantic integration the only weighting applied while projecting from the 2D segmentation into the 3D scene is based on a linear fall-off between $d_{min}$ and $d_{max}$. The impact of the weighting is evaluated on the courtyard dataset as it presents larger variability in terms of distance. Three different values for the distance thresholds are evaluated and compared to no weighting (full confidence in the semantic information regardless of distance). The results are gathered in Tab. 3. We observe that having no distance weighting results in the lowest IoU while the highest one was achieved by a linear fall-off between $0\text{\,}\mathrm{m}$ and $100\text{\,}\mathrm{m}$. Small variations in the thresholds have little impact unless the $d_{max}$ is severely restricted (for example to only $30\text{\,}\mathrm{m}$) at which point distant parts of the scene are ignored and thus severely affecting the IoU.

8 Limitations

In the previous sections we have seen the impact of incorrect poses for semantic mapping as well as inadequate geometric meshes reduce the accuracy especially for small and thin classes. Another limitation arises from the Expectation Maximization strategy itself. The current belief is reinforced and thus not able to correct the estimate in all cases. Currently, dynamic objects are completely disregarded in our approach, but often present in collected data. This introduces artifacts in the reconstruction as well as the semantic map and reduces the accuracy for moving classes like pedestrians or cars. Furthermore, retraining from such sequences will bias the semantic segmentation towards static classes. Hence, incorporating object tracking could alleviate this problem. In terms of implementation the sparsity of the probability volume is greatly influenced by the quality of the UV parametrization. If areas of the mesh that are spatially close also lie nearby in the parametric space and are from the same class then they cover a page in GPU memory more efficiently. However, in the extreme case where each triangle is mapped to independent texture coordinates, the chance for decommitting reduces significantly. Luckily, most man-made environments are generally planar and their parametrization can be easily performed. Despite this, the limitation is an important one and it rises the question of a possibly semantic-aware parametrization in which the parametric area is influenced by the class, e.g. assigning lower resolution for vegetation and buildings and higher for cars and pedestrians.

9 Conclusion

We presented a novel semantic mapping system that uses textured meshes to store the semantic information and allows to couple semantic and geometric representation at independent resolution improving scalability and accuracy even for large datasets. The mesh-based representation allows to enforce spatial and temporal consistency over multiple observations as well as enabling semi-supervised retraining from novel view points by propagation of labels in an iterative manner. Quantitative and qualitative results on the NYUv2 dataset demonstrate the benefits of our approach compared to the state of the art method SemanticFusion.

Acknowledgements.

We would like to thank David Droeschel for his effort in providing accurate poses for the courtyard dataset. This work was supported by grant BE 2556/7 of the German Research Foundation (DFG).