Fast and automatic detection of airports from remote sensing images is useful for many military and civilian applications. In this paper, a fast automatic detection method is proposed to detect airports from remote sensing images based on convolutional neural networks using the Faster R-CNN algorithm. This method first applies a convolutional neural network to generate candidate airport regions. Based on the features extracted from these proposals, it then uses another convolutional neural network to perform airport detection. By taking the typical elongated linear geometric shape of airports into consideration, some specific improvements to the method are proposed. These approaches successfully improve the quality of positive samples and achieve a better accuracy in the final detection results. Experimental results on an airport dataset, Landsat 8 images, and a Gaofen-1 satellite scene demonstrate the effectiveness and efficiency of the proposed method.

With the increasing sizes of digital elevation models (DEMs), there is a growing need to design parallel schemes for existing sequential algorithms that identify and fill depressions in raster DEMs. The Priority-Flood algorithm is the fastest sequential algorithm in the literature for depression identification and filling of raster DEMs, but it has had no parallel implementation since it was proposed approximately a decade ago. A parallel Priority-Flood algorithm based on the fastest sequential variant is proposed in this study. The algorithm partitions a DEM into stripes, processes each stripe using the sequential variant in many rounds, and progressively identifies more slope cells that are misidentified as depression cells in previous rounds. Both Open Multi-Processing (OpenMP)- and Message Passing Interface (MPI)-based implementations are presented. The speed-up ratios of the OpenMP-based implementation over the sequential algorithm are greater than four for all tested DEMs with eight computing threads. The mean speed-up ratio of our MPI-based implementation is greater than eight over TauDEM, which is a widely used MPI-based library for hydrologic information extraction. The speed-up ratios of our MPI-based implementation generally become larger with more computing nodes. This study shows that the Priority-Flood algorithm can be implemented in parallel, which makes it an ideal algorithm for depression identification and filling on both single computers and computer clusters.

The spatio-temporal distribution of biocrusts can be used to monitor regional water resources in desert ecosystems. However, a lack of biocrust products from remotely sensed images with fine spatial resolution (FSR) limits scientific research in this area. To address this issue, we establish an estimation model for biocrusts (EMBC) in three steps for FSR images and map the large-scale fractional biocrust coverage ( FBC ) in deserts using Sentinel-2 images with a spatial resolution of 10 m. Firstly, we develop a fraction biocrust cover index ( FBCI ) based on radiative transfer theory. Next, a multi-angle calculation equation involving FBCI is established and the parameters for a pixel dichotomy model are solved by an inverse method using a linear kernel-driven model. Finally, this pixel dichotomy model with FBCI is used to calculate FBC . We validate the model using field measurements and compare the validation results with those estimated by a random forest model and a backpropagation neural network model. This comparison demonstrates that the value of FBC estimated by EMBC is highly consistent with field measurements (root mean square error (RMSE) = 0.0774, systematic deviation = -4.05%). Furthermore, the values of FBC estimated with EMBC and the two other models show a high level of consistency in terms of spatial distribution (RMSE < 0.0998). We conclude that our EMBC can accurately estimate FBC in a desert and is an important technique for monitoring drought in an arid environment.

Planes are essential features to describe the shapes of buildings. The segmentation of a plane is significant when reconstructing a building in three dimensions. However, there is a concern about the accuracy in segmenting plane from point cloud data. The objective of this paper was to develop an effective segmentation algorithm for building planes that combines the region growing algorithm with the distance algorithm based on boundary points. The method was tested on point cloud data from a cottage and pantry as scanned using a Faro Focus 3D laser range scanner and Matterport Camera, respectively. A coarse extraction of the building plane was obtained from the region growing algorithm. The coplanar points where two planes intersect were obtained from the distance algorithm. The building plane’s optimal segmentation was then obtained by combining the coarse extraction plane points and the corresponding coplanar points. The results show that the proposed method successfully segmented the plane points of the cottage and pantry. The optimal distance thresholds using the proposed method from the uncoarse extraction plane points to each plane boundary point of cottage and pantry were 0.025 m and 0.030 m, respectively. The highest correct rate and the highest error rate of the cottage’s (pantry’s) plane segmentations using the proposed method under the optimal distance threshold were 99.93% and 2.30% (98.55% and 2.44%), respectively. The F1 score value of the cottage’s and pantry’s plane segmentations using the proposed method under the optimal distance threshold reached 97.56% and 95.75%, respectively. This method can segment different objects on the same plane, while the random sample consensus (RANSAC) algorithm causes the plane to become over-segmented. The proposed method can also extract the coplanar points at the intersection of two planes, which cannot be separated using the region growing algorithm. Although the RANSAC-RG method combining the RANSAC algorithm and the region growing algorithm can optimize the segmentation results of the RANSAC (region growing) algorithm and has little difference in segmentation effect (especially for cottage data) with the proposed method, the method still loses coplanar points at some intersection of the two planes.

The separation of leaf and wood points is an essential preprocessing step for extracting many of the parameters of a tree from terrestrial laser scanning data. The multi-scale method and the optimal scale method are two of the most widely used separation methods. In this study, we extend the optimal scale method to the multi-optimal-scale method, adaptively selecting multiple optimal scales for each point in the tree point cloud to increase the distinctiveness of extracted geometric features. Compared with the optimal scale method, our method achieves higher separation accuracy. Compared with the multi-scale method, our method achieves more stable separation accuracy with a limited number of optimal scales. The running time of our method is greatly reduced when the optimization strategy is applied.