Traditional methods for landslide survey, whether field investigation or human remote sensing-based interpretation approaches, all require considerable labour costs and expert knowledge. Deep learning-based detection methods have significantly improved the speed of landslide recognition, but their accuracy still has much room for improvement. In our work, we propose SA-MFNet to achieve pixelwise landslide detection based on multisource data fusion analysis. On the one hand, we achieve improved feature extraction by utilizing an attention mechanism. On the other hand, based on raw sensing data and labeled results obtained from several regions, we propose a landslide detection model based on the fusion of multisource data, including digital elevation model (DEM), geological mapping data, river distribution data and other data related to earth observation information. We enhance the performance of the developed method via fusion analysis with features extracted from remote optical sensing images, thus achieving precise pixelwise landslide terrain classification and positioning. Experimental results demonstrate that the model proposed in this article is superior to the existing common baselines and can provide technical support for automatic landslide identification with practical value.
Virtualization enables multiple guest operating systems run on a single physical platform. These virtual machines may host any types of application, including concurrent HPC programs. Traditionally, VMM schedulers have focused on fairly sharing the processor resources among domains, rarely consider VCPUs' behaviors. However, this can result in poor application performance to overcommitted domains if there are concurrent programs hosted in them. In this paper we review the properties of both Xen's Credit and SEDF schedulers, and show how these schedulers may seriously impact the performance of the communication-intensive and I/O-intensive concurrent applications in overcommitted domains. We discuss the origination of the problem theoretically, and confirm the derived conclusion on benchmarks. A novel approach, that dynamically scales the context switching-frequency by selecting variable time slices according to VCPUs` behaviors, is then proposed to improve the Credit scheduler more adaptive for concurrent applications. The experimental results show that this extended Credit scheduler can improve the performance of communication-intensive and I/O-intensive concurrent applications in overcommitted domains to the same magnitude as in undercommitted domains.
18 October 2024 in IEEE Transactions on Intelligent Transportation Systems
In the realm of video analytics, the significance of video anomaly detection cannot be ignored. Many video anomaly detection methods have been introduced in traffic scenarios, and they have achieved some promising results. However, there still exists a large room for improving the traffic anomaly detection performance. In this paper, we present an end-to-end approach, the Dual-Stream Anomaly Detection Network (DS-ADN), specialized for traffic anomaly detection. DS-ADN introduces optical flow data and utilizes inter-flow information interaction coupled with the Multi-Scale Attention Fusion Module (MSA-FM) to comprehensively merge RGB and optical flow data. It features an innovative depth-based prediction loss function that adapts to the vehicle’s regular shape and events at different distances under the surveillance camera. This adaptation occurs through block-wise average pooling and weighted allocation across varying depths. Considering the prevalent issues of datasets dedicated to traffic anomaly detection generally containing a single type of anomaly, this paper introduces the Traffic Surveillance Dataset (TSD) containing multiple anomalies for model validation. Extensive experiments on the TSD dataset highlight the better performance of our DS-ADN, manifesting an AUC gain of over 8.8% compared to other state-of-the-art models. Moreover, DS-ADN achieves competitive performance across three widely-used anomaly detection datasets that contain multiple anomalies, including UCSD Ped2, Avenue, and ShanghaiTech, demonstrating its generalization ability.
A set of distributed continual range query requests, each defining a geographical region of interest, needs to be periodically reevaluated to provide up to date answers. Processing these continual queries efficiently and incrementally becomes important for location based services and applications. In this paper, we propose an efficient incremental method for continuous range query characterized by mobility of objects which follow paths in an underlying spatial road network. We notice that both queries and moving objects can be attached to the road link for updating of query answers. By using Grid R*-tree which indexing spatial road network data, query requests and moving objects register themselves to corresponding road links according to query areas and moving object locations on the network. Also we analyzed the impacts to query answers caused by geometry relation of road link and query area and state of moving objects. Then we proposed an efficient update algorithm and corresponding memory data structures based on spatial and state classification which formed a safe region to avoid unnecessary updates. Finally a comprehensive experimental evaluation using real data has been conducted to demonstrate the efficiency and effectiveness of our algorithm.