To explore the airspace structure and safety performance of unmanned aerial vehicle (UAV) system based on spatial digital twins (DTs), the study introduces DTs technology, and combines convolutional neural network (CNN) algorithm with UAV autonomous network. The DTs system of UAV is constructed by using wireless communication technology, and its security performance is simulated. The results show that in the analysis of the system packet loss rate, it is found that with the increase of the acquisition points, the amount of transmitted data only increases slightly, but the packet loss rate does not change significantly. In the analysis of the network performance of the unmanned aircraft system, it is found that the node energy-based weighted clustering algorithm (EWCA) can be used to increase the life of the overall network and enhance its availability by rationally controlling the number of nodes and the number of switching between clusters. As the number of nodes increases, the minimum survival time of each clustering algorithm decreases linearly. When the number of nodes is less than 600, the growth rate of cluster head is higher; When the number of nodes is more than 600, the curve growth is relatively smooth. In the analysis of the probability of network safety interruption, it is found that using the model constructed, when the energy acquisition coefficient is close to 0.5, the energy conversion efficiency is higher, the signal-to-noise ratio is larger. Also, when the number of intermediate nodes is increased to 10, the UAV has the best network safety performance. Therefore, through the research, it is found that the UAV DTs system constructed can significantly improve the safety performance of the UAV during its airspace flight. It can provide experimental references for the widespread application of the UAV in the later period.

Three-dimensional (3D) building models play an important role in digital cities and have numerous potential applications in environmental studies. In recent years, the photogrammetric point clouds obtained by aerial oblique images have become a major source of data for 3D building reconstruction. Aiming at reconstructing a 3D building model at Level of Detail (LoD) 2 and even LoD3 with preferred geometry accuracy and affordable computation expense, in this paper, we propose a novel method for the efficient reconstruction of building models from the photogrammetric point clouds which combines the rule-based and the hypothesis-based method using a two-stage topological recovery process. Given the point clouds of a single building, planar primitives and their corresponding boundaries are extracted and regularized to obtain abstracted building counters. In the first stage, we take advantage of the regularity and adjacency of the building counters to recover parts of the topological relationships between different primitives. Three constraints, namely pairwise constraint, triplet constraint, and nearby constraint, are utilized to form an initial reconstruction with candidate faces in ambiguous areas. In the second stage, the topologies in ambiguous areas are removed and reconstructed by solving an integer linear optimization problem based on the initial constraints while considering data fitting degree. Experiments using real datasets reveal that compared with state-of-the-art methods, the proposed method can efficiently reconstruct 3D building models in seconds with the geometry accuracy in decimeter level.

Aerial laser scanning or photogrammetric point clouds are often noisy at building boundaries. In order to produce regularized polygons from such noisy point clouds, this study proposes a hierarchical regularization method for the boundary points. Beginning with detected planar structures from raw point clouds, two stages of regularization are employed. In the first stage, the boundary points of an individual plane are consolidated locally by shifting them along their refined normal vector to resist noise, and then grouped into piecewise smooth segments. In the second stage, global regularities among different segments from different planes are softly enforced through a labeling process, in which the same label represents parallel or orthogonal segments. This is formulated as a Markov random field and solved efficiently via graph cut. The performance of the proposed method is evaluated for extracting 2D footprints and 3D polygons of buildings in metropolitan area. The results reveal that the proposed method is superior to the state-of-art methods both qualitatively and quantitatively in compactness. The simplified polygons could fit the original boundary points with an average residuals of 0.2 m, and in the meantime reduce up to 90% complexities of the edges. The satisfactory performances of the proposed method show a promising potential for 3D reconstruction of polygonal models from noisy point clouds.

Change detection with remote sensing images (RSIs) plays an important role in the community of remote sensing applications. However, when change detection is conducted with hyperspectral remote sensing images (HRSIs), how to measure the change magnitude between bitemporal HRSIs becomes challenging due to the high dimension of HRSIs. In this article, a novel Distribution Distance based on Inconsistent Adaptive Region (D ² IAR) change detection approach is proposed to measure the change magnitude between bitemporal HRSIs for improving the performance of change detection with HRSIs. First, a band selection algorithm called optimal neighborhood reconstruction is employed to reduce the dimensions of HRSIs. Then, an adaptive region around each pixel is generated to explore the contextual feature around each pixel, and kernel density estimation is suggested to estimate the spectral distribution of the pixels within an adaptive region. A distribution distance is defined based on the adaptive region to measure the change magnitude between bitemporal HRSIs. Finally, the change magnitude between pairwise adaptive regions is measured by the proposed distance between the pairwise distributions. Experimental results based on four datasets and comparisons with eight methods indicated the feasibility and superiorities of the proposed D ² IAR-based change detection approach with HRSIs. The improvement rates are approximately 0.13%-24.04% for overall accuracy. The code and datasets can be available at: https://github.com/ImgSciGroup/2024-HSICD.

Nowadays, mobile laser scanning is widely used for understanding urban scenes, especially for extraction and recognition of pole-like street furniture, such as lampposts, traffic lights and traffic signs. However, the start-of-art methods may generate low segmentation accuracy in the overlapping scenes, and the object classification accuracy can be highly influenced by the large discrepancy in instance number of different objects in the same scene. To address these issues, we present a complete paradigm for pole-like street furniture segmentation and classification using mobile LiDAR (light detection and ranging) point cloud. First, we propose a 3D density-based segmentation algorithm which considers two different conditions including isolated furniture and connected furniture in overlapping scenes. After that, a vertical region grow algorithm is employed for component splitting and a new shape distribution estimation method is proposed to obtain more accurate global shape descriptors. For object classification, an integrated shape constraint based on the splitting result of pole-like street furniture (SplitISC) is introduced and integrated into a retrieval procedure. Two test datasets are used to verify the performance and effectiveness of the proposed method. The experimental results demonstrate that the proposed method can achieve better classification results from both sites than the existing shape distribution method.