Point cloud segmentation is the foundation of 3D environmental perception for modern intelligent systems. To solve this problem and image segmentation, conditional random fields (CRFs) are usually formulated as discrete models in label space to encourage label consistency, which is actually a kind of postprocessing. In this paper, we reconsider the CRF in feature space for point cloud segmentation because it can capture the structure of features well to improve the representation ability of features rather than simply smoothing. Therefore, we first model the point cloud features with a continuous quadratic energy model and formulate its solution process as a message-passing graph convolution, by which it can be easily integrated into a deep network. We theoretically demonstrate that the message passing in the graph convolution is equivalent to the mean-field approximation of a continuous CRF model. Furthermore, we build an encoder-decoder network based on the proposed continuous CRF graph convolution (CRFConv), in which the CRFConv embedded in the decoding layers can restore the details of high-level features that were lost in the encoding stage to enhance the location ability of the network, thereby benefiting segmentation. Analogous to the CRFConv, we show that the classical discrete CRF can also work collaboratively with the proposed network via another graph convolution to further improve the segmentation results. Experiments on various point cloud benchmarks demonstrate the effectiveness and robustness of the proposed method. Compared with the state-of-the-art methods, the proposed method can also achieve competitive segmentation performance.
翻译:点云分解是现代智能系统3D环境感知的基础。 为了解决这个问题和图像分解, 有条件随机字段通常在标签空间中作为独立模型制定, 以鼓励标签的一致性, 这实际上是一种后处理。 在本文中, 我们重新考虑点云分解功能的特性空间中的通用报告格式, 因为它可以捕捉特征结构, 以提高特征的体现能力, 而不是简单地平滑。 因此, 我们首先用连续四级能源模型来模拟点云特征, 并将其解决方案进程发展成一种信息通路图组合, 从而很容易将其整合到深网络中。 我们理论上证明, 图形组合传递的信息相当于连续的通用报告格式模型的平均值近似近似。 此外, 我们根据拟议的连续的通用报告格式图解调(CRF Conv) 构建了一个编码- 网络。 在分解调层中嵌入的通用报告格式Conv可以恢复拟议的高层次特征的细节, 用于加强网络定位能力, 从而有利于网络的分流化。 我们从理论上显示, 离质的变换方法, 也显示, 通过合作性变现方法, 我们以不同的格式显示, 新的变换方法可以进一步显示, 。