Multikernel Graph Structure Learning for Multispectral Point Cloud Classification

Abstract

Multispectral point cloud, with spatial and multiple-band spectral information, provides the data basis for finer land cover 3-D classification. However, spectral information is not well utilized by traditional methods of point cloud classification. Benefiting from the excellent performance of graph neural networks on non-Euclidean data, it is well suited to the joint use of spatial and spectral information from multispectral point clouds to achieve better classification performance. However, existing graph-based methods for point cloud classification rely on manual experience to construct input graph and cannot adapt to the complexity of remote sensing scenes. In this article, we propose a novel multikernel graph structure learning (MKGSL) framework for multispectral point cloud classification. Specifically, we explore the high-dimensional feature distribution properties of multispectral point clouds in Hilbert space through the use of kernel method. An innovative multiple-kernel learning mechanism is embedded into our network, which allows to obtain better mappings adaptively. Simultaneously, a series of prior constraints designed based on land cover distribution characteristics are imposed on the network training process, which leads the learned graph of the multispectral point cloud to facilitate better classification. Our method is dedicated to adaptively constructing task-oriented graph structures to improve the performance of multispectral point cloud classification. Experimental comparisons demonstrate that the proposed MKGSL performs better than several state-of-the-art methods on two real multispectral point cloud datasets.

Keywords

• Graph structure learning
• multiple kernel learning
• multispectral LiDAR data
• point cloud classification
• prior constraint