A landslide is a kind of geological disaster with high frequency, great destructiveness, and wide distribution today. The occurrence of landslide disasters bring huge losses of life and property. In disaster relief operations, timely and reliable intervention measures are very important to prevent the recurrence of landslides or secondary disasters. However, traditional landslide identification methods are mainly based on visual interpretation and on-site investigation, which are time-consuming and inefficient. They cannot meet the time requirements in disaster relief operations. Therefore, to solve this problem, developing an automatic identification method for landslides is very important. This paper proposes such a method. We combined deep learning with landslide extraction from remote sensing images, used a semantic segmentation model to complete the automatic identification process of landslides and used the evaluation indicators in the semantic segmentation task (mean IoU [mIoU], recall, and precision) to measure the performance of the model. We selected three classic semantic segmentation models (U-Net, DeepLabv3+, PSPNet), tried to use different backbone networks for them and finally arrived at the most suitable model for landslide recognition. According to the experimental results, the best recognition accuracy of PSPNet is with the classification network ResNet50 as the backbone network. The mIoU is 91.18%, which represents high accuracy; Through this experiment, we demonstrated the feasibility and effectiveness of deep learning methods in landslide identification.

In the study of spatiotemporal geographical phenomena, the space–time interpolation method is widely applied, and the demands for computing speed and accuracy are increasing. For nonprofessional modelers, utilizing the space–time interpolation method quickly is a challenge. To solve this problem, the classical ordinary kriging algorithm was selected and expanded to a spatiotemporal kriging algorithm. Using the OpenCL framework to integrate central processing unit (CPU) and graphic processing unit (GPU) computing resources, a parallel spatiotemporal kriging algorithm was implemented, and three experiments were conducted in this work to verify the results. The results indicated the following: (1) when the size of the prediction point dataset is consistent, the performance of the method is robust with the increasing size of the observation point dataset; (2) the acceleration effect of the parallel method increases with an increased number of predicted points. Compared with the original sequential program, the implementation of the improved parallel framework showed a 3.23 speedup, which obviously shortens the interpolation time; (3) when cross-validating the temperature data in the Beijing Tianjin Hebei region, the space–time acceleration model provides a better fit than traditional pure space interpolation.

Industrial Internet of Things has been widely used to facilitate disaster monitoring applications, such as liquid leakage and toxic gas detection. Since disasters are usually harmful to the environment, detecting accurate boundary regions for continuous objects in an energy‐efficient and timely fashion is a long‐standing research challenge. This article proposes a novel mechanism for continuous object boundary region detection in a fog computing environment, where sensing holes may exist in the deployed network region. Leveraging sensory data that have been gathered, interpolation algorithms have been applied to estimate sensory data at certain geographical locations, in order to estimate a more accurate boundary line. To examine whether estimated sensory data reflect that fact, mobile sensors are adopted to traverse these locations for gathering their sensory data, and the boundary region is calibrated accordingly. Experimental evaluation shows that this technique can generate a precise object boundary region with certain time constraints, and the network lifetime can be prolonged significantly.

Unmanned aerial vehicles (UAVs) have wide application prospects in disaster search and rescue, ecological monitoring and environmental inspection tasks, where target search is a key link to realize autonomous task execution. UAVs often face challenges related to limited onboard computational resources and inefficient environmental coverage when used for target search. To address these issues, this paper proposes an autonomous search method for UAVs based on combined lightweight target detection and coverage path planning. In this method, the target search task was decomposed into two core parts: target recognition and path planning. Firstly, in terms of target recognition, the YOLOv8n model was subjected to channel pruning and INT8 quantization to reduce its computational complexity, while HSV space data augmentation was incorporated to enhance recognition robustness in complex environments. Secondly, path planning was formulated as a dual-layer task comprising “spatial coverage + target confirmation.” A grid-based search environment model was constructed, and a coverage path planning strategy was put forward that integrated breadth-first search (BFS) with local greedy optimization to achieve efficient traversal of predefined search areas. Simultaneously, the A* algorithm was employed for path backtracking to cover omitted regions. Finally, a simulation platform for UAV target search was built to validate the recognition performance and search efficiency of the proposed method. The experimental results demonstrated that the proposed method significantly improved the UAV target search efficiency and reduced the path redundancy while ensuring the recognition accuracy, thereby offering an effective solution for autonomous UAV search on resource-constrained embedded platforms.