With the continuous advancement of deep learning technology, researchers have made further progress in the hyperspectral image (HSI) classification domain. We propose a double-branch multi-scale residual network (DBMSRN) framework for HSI classification to improve classification accuracy and reduce the number of required training samples. The DBMSRN consists of two branches designed to extract spectral and spatial features from the HSI. Thus, to obtain more comprehensive feature information, we extracted additional local and global features at different scales by expanding the network width. Moreover, we also increased the network depth to capture deeper feature information. Based on this concept, we devise spectral multi-scale residuals and spatial multi-scale residuals within a double-branch architecture. Additionally, skip connections are employed to augment the context information of the network. We demonstrate that the proposed framework effectively enhances classification accuracy in scenarios with limited training samples through experimental analysis. The proposed framework achieves an overall accuracy of 98.67%, 98.09%, and 96.76% on the Pavia University (PU), Kennedy Space Center (KSC), and Indian Pines (IP) datasets, respectively, surpassing the classification accuracy of existing advanced frameworks under identical conditions.

In the field of hyperspectral image classification, deep learning technology, especially convolutional neural networks, has achieved remarkable progress. However, convolutional neural network models encounter challenges in hyperspectral image classification due to limitations in their receptive fields. Conversely, the global modeling capability of Transformers has garnered attention in hyperspectral image classification. Nevertheless, the high computational cost and inadequate local feature extraction hinder its widespread application. In this study, we propose a novel fusion model of convolutional neural networks and Transformers to enhance performance in hyperspectral image classification, namely the dual-branch multi-granularity convolutional cross-substitution Transformer (DMCCT). The proposed model adopts a dual-branch structure to separately extract spatial and spectral features, thereby mitigating mutual interference and information loss between spectral and spatial data during feature extraction. Moreover, a multi-granularity embedding module is introduced to facilitate multi-scale and multi-level local feature extraction for spatial and spectral information. In particular, the improved convolutional cross-substitution Transformer module effectively integrates convolution and Transformer, reducing the complexity of attention operations and enhancing the accuracy of hyperspectral image classification tasks. Subsequently, the proposed method is evaluated against existing approaches using three classical datasets, namely Pavia University, Kennedy Space Center, and Indian Pines. Experimental results demonstrate the efficacy of the proposed method, achieving significant classification results on these datasets with overall classification accuracies of 98.57%, 97.96%, and 96.59%, respectively. These results establish the superiority of the proposed method in the context of hyperspectral image classification under similar experimental conditions.

Filtering from airborne LiDAR datasets in urban area is one important process during the building of digital and smart cities. However, the existing filters encounter poor filtering performance and heavy computational burden when processing large-scale and complicated urban environments. To tackle this issue, a self-adaptive filtering method based on object primitive global energy minimization is proposed in this paper. In this paper, mode points were first acquired for generating the mode graph. The mode points were the cluster centers of the LiDAR data obtained in a mean shift algorithm. The graph constructed with mode points was named “mode graph” in this paper. By defining the energy function based on the mode graph, the filtering process is transformed to iterative global energy minimization. In each iteration, the graph cuts technique was adopted to achieve global energy minimization. Meanwhile, the probability of each point belonging to the ground was updated, which would lead to a new refined ground surface using the points whose probabilities were greater than 0.5. This process was iterated until two successive fitted ground surfaces were determined to be close enough. Four urban samples with different urban environments were adopted for verifying the effectiveness of the filter developed in this paper. Experimental results indicate that the developed filter obtained the best filtering performance. Both the total error and the Kappa coefficient are superior to those of the other three classical filtering methods.