ABSTRACT The vigorous development of Internet information technology has brought a lot of convenience and fun to people's lives. However, in the modern information world, the problem of information security has always existed. Given the prevalence of information security problems and their consequences, enterprises often invest in information security technologies to strengthen their information systems. However, the security vulnerabilities of information systems cannot be eliminated, so the choice of investment strategies by enterprises is of great significance. Based on the evolutionary game method, this study analyses, from a microscopic perspective, the investment strategy selection process of enterprises when there are security vulnerabilities in information system in the context of the complementarity of information assets between enterprises, and simulates the impact of enterprises' initial investment intention and potential losses as well as breach probabilities and cost differentials on the evolutionary outcomes. The research shows that an enterprise is more willing to choose an investment strategy that minimises the sum of investment costs and expected losses. The higher the enterprise's initial high investment intention or potential losses, the more likely it is to choose a high investment strategy, whilst its partner enterprise is less likely to choose a high investment strategy. In addition, when security investments effectively reduce breach probabilities, enterprises are more inclined to adopt high‐investment strategies, whilst higher hacker operational costs can help alleviate enterprises' security investment pressure.

The fusion of hyperspectral and multispectral images involves integrating high spectral resolution hyperspectral image (HSI) and high spatial resolution multispectral image (MSI) to generate a HSI with high spatial and spectral resolution (HR-HSI). Existing HSI-MSI fusion methods primarily focus on information fusion within the spatial domain; however, few solutions have explored the employment of frequency analysis to enhance spatial resolution, limiting their capability for global perception. In this paper, we propose an efficient and novel paradigm for HSI-MSI fusion through the cross-frequency enhanced spatial-spectral fusion network, named CESFusion, exploring the complementary fusion of information between the spatial and frequency domains. Specifically, we first present the cross-frequency domain fusion module (CFFM) to perform global analysis through the Fourier transform and effectively integrate and enhance the frequency domain information from both HSI and MSI. Subsequently, we propose the spectral modeling module (SpeMM) based on state space model (SMM) to capture long-range spectral dependencies with linear complexity, and integrate it with the spatial residual block-based module (SRM) for joint spatial-spectral feature extraction. Finally, to enable sufficient interaction between the spatial and frequency domains, we adopt the cross-domain interaction module (CDIM), capturing and integrating complementary information from both domains. Moreover, a frequency-based loss function is purposely designed to further improve the restoration of global information. Extensive experiments conducted on both synthetic and real datasets demonstrate the superiority of our CESFusion, as evidenced by both quantitative and qualitative evaluation results.

Effective discrepancy representation of anomalies plays a crucial role in visual anomaly detection. Recent advances build upon reverse distillation paradigm that boost the teacher–student model’s discrimination capability on anomalies; however, they are still susceptible to the size variation of unpredictable anomalies. To generalize the anomaly size variation, we propose a new algorithm cross-scale denoising reverse distillation (CDRD), which integrates cross-scale denoising with reverse distillation to exchange multiscale perception and enhance the fine-grained representation of features. Specifically, we introduce a cross-scale anomalous signal suppression procedure in the teacher network to facilitate the interaction of information across different scales, thereby enabling the student network to learn more robust normal data representations. In the knowledge transfer process, a fusion compression module acts as an intermediate transmitter of information, aiming to obtain a compact embedding while abandoning anomaly perturbations. Moreover, we construct a detail supplement module in the student network to prevent the loss of key information in the deconvolution process of the decoder. Experiments on well-known datasets demonstrate that our CDRD brings significant improvements over the next best competitor.

Hyperspectral image and Multispectral image (HSI-MSI) fusion aims to fuse a registered high-resolution multi-spectral image (HR-MSI) with a low-resolution hyperspectral image (LR-HSI) to generate a spatially enhanced HSI with high spectral resolution. Current fusion methods often make insufficient utilization of spatial and spectral prior information, including spatial self-similarity and inter-spectral correlations, resulting in a degradation in image fidelity. Therefore, we propose a novel HSI-MSI fusion network, called DA-LGNet, designed to learn spatial-spectral priors with a dual-attention mechanism for feature enhancement and utilize the advantages of the large kernel attention for global and local feature representation. Specifically, the large kernel attention module (LKAM) can efficiently extract and integrate long-range dependencies and detailed textual information. The dual-attention enhancement module (DAEM) incorporates the position attention mechanism with the channel attention mechanism, flexibly capturing spatial and spectral prior information, which are crucial for restoring high-resolution HSI (HR-HSI). Extensive experiments on two datasets demonstrate that our DA-LGNet importantly outper-forms other state-of-the-art methods.

The fusion of a low spatial resolution hyperspectral image (LR-HSI) with a high spatial resolution multispectral image (HR-MSI) aims to synthesize a high-resolution hyperspectral image (HR-HSI), enabling a broader range of applications for hyperspectral images (HSIs). However, existing fusion methods struggle to capture both long-range dependencies and fine-grained spatial features, resulting in block artifacts and spatial distortions in the reconstructed HR-HSIs. Therefore, we introduce MLKAF-Net, a multiscale HSI-MSI fusion method, which effectively formulates cross-modality fused features in both spatial and spectral domains. MLKAF-Net mainly consists of three modules: the multiscale large kernel attention module (MLKAM), the spatial information aggregation module (SIAM), and the spectral attention module (SPAM). Specifically, the MLKAM incorporates a multiscale mechanism into the large kernel decomposition, adaptively capturing both long-range dependencies and local granular information. We develop the SIAM to establish the spatial quality of the reconstructed HR-HSIs by aggregating abundant spatial information. The SPAM introduces the channel attention to effectively mitigate spectral distortion through preserving beneficial spectral information. Extensive experiments demonstrate that our MLKAF-Net importantly enhances the fusion performance compared to state-of-the-art methods.

This work studies the multi-weather restoration problem. In real-life scenarios, rain and haze, two often co-occurring common weather phenomena, can greatly degrade the clarity and quality of the scene images, leading to a performance drop in the visual applications, such as autonomous driving. However, jointly removing the rain and haze in scene images is ill-posed and challenging, where the existence of haze and rain and the change of atmosphere light, can both degrade the scene information. Current methods focus on the contamination removal part, thus ignoring the restoration of the scene information affected by the change of atmospheric light. We propose a novel deep neural network, named Asymmetric Dual-decoder U-Net (ADU-Net), to address the aforementioned challenge. The ADU-Net produces both the contamination residual and the scene residual to efficiently remove the contamination while preserving the fidelity of the scene information. Extensive experiments show our work outperforms the existing state-of-the-art methods by a considerable margin in both synthetic data and real-world data benchmarks, including RainCityscapes, BID Rain, and SPA-Data. For instance, we improve the state-of-the-art PSNR value by 2.26/4.57 on the RainCityscapes/SPA-Data, respectively. Codes will be made available freely to the research community.

Financial enterprises generate profits based on economic development. More importantly, a healthy market is difficult to achieve due to their susceptibility to the parasitic credit card fraud transactions that accompany economic growth, unless an effective anti-counterfeiting technology is developed to alleviate the issue. To solve the problem, we propose a gradient-boosting decision tree based anti-fraud protection with blockchain Technology, referred to as GBDT-APBT, which treats anti-fraud transaction model as the accumulation of the classfiers' weakness and builds up a classifiers' to judge whether the transaction is fraudulent. Each user's private data is trained offline at the local blockchain node, then the trained model is directly uploaded to the cloud, and the final consensus model is obtained by voting. Due to incorporating blockchain technology, GBDT-APBT demonstrates decentralisation, openness, autonomy, anonymity, and immutability, showing its ability to satisfying the demand for an effective and beneficial anti-counterfeiting system, with high performance and effectiveness in detecting fraud information. Experiments show that compared with other methods, GBDT-APBT offers a promising approach to the security of credit card transactions with reference to the detection accuracy.

In a long-term large-scenario application, the multi-agent collaborative SLAM is expected to improve the robustness and efficiency of executing tasks for mobile agents. In this paper, a multi-agent collaborative visual-inertial SLAM system is proposed based on a centralized client-server (CS) architecture, where the clients run on smart mobiles. In general, multi-agent collaborative SLAM relies on robust and precise experience sharing and efficient communication among agents. The experience sharing requires the place recognition with a high recall and accuracy, the precise estimation of transformation between looping frames, and the map fusion with globally consistency. To this end, we devise an enhanced geometric verification, a re-projection optimization based on the error-aware weighting strategy, and a strategy of flexible fusion to meet these requirements. In addition, the multi-agent collaborative SLAM needs to exchange abundant information, which requires the efficient communication. Therefore, we design a CS collaborative loop detection mechanism which is more robust to network transmission. We perform extensive experiments on the EuRoc dataset and in real environments. Experimental results show that the proposed system achieves better results than state-of-the-art methods. Furthermore, we demonstrate the stability of the proposed collaborative SLAM in real environments with a bandwidth of 7.55Mbps.

Global localization in a prior map is an important field in virtual and augmented reality systems, but it is always a challenge to conduct point cloud based localization in the large-scale scene prior map. A large-scale prior map usually means huge amount of calculation for point cloud processing, which leads to the long time required for global localization. To deal with this problem, we propose a fast point cloud global localization method based on point clouds segmentation and learning-based descriptor. On the one hand, cylindrical filtering, ground-point removal and point cloud segmentation are adopted to eliminate a large number of useless points and retain points with rich structures, which improves the efficiency of point cloud registration. On the other hand, reliable 3D point cloud descriptor, two-phase search strategy for place recognition and geometric consistency verification are used to ensure the localization accuracy. Experiments prove that the proposed method achieves good localization effect on both KITTI and MVSEC datasets. Under the condition of ensuring the high localization accuracy, the time for point clouds to complete the global localization is greatly reduced.

Obtaining 3-D data by LIDAR from unmanned aerial vehicles (UAVs) is vital for the field of remote sensing; however, the highly dynamic movement of UAVs and narrow viewpoint of LIDAR pose a great challenge to the self-localization for UAVs based on solely LIDAR sensor. To this end, we propose a robust simultaneous localization and mapping (SLAM) system, which combines the image data obtained by vision sensor and point clouds obtained by LIDAR. In the front-end of the proposed system, the more stable line and plane features are extracted from point clouds through clustering. Then the relative pose between two consecutive frames is computed by the least squares iterative closest point algorithm. Afterward, a novel direct odometry algorithm is developed by combining the image frames and sparse point clouds, where the relative pose is used as a prior. In the back-end, the pose estimation is refined and the 3-D map with texture information is built at a lower frequency. Extensive experiments show that our method can achieve robust and highly precise localization and mapping for UAVs.

In this letter, we present a subspace-based nonlocal low-rank tensor approximation framework (SNLRTA) for hyperspectral image (HSI) restoration. The proposed method consists of a subspace learning method to achieve an accurate subspace characterization of HSI and a nonlocal low-rank tensor approximation to take spatial nonlocal self-similarity into consideration. Specifically, the HSI first exploits residual statistics on median filtered image to estimate a robust subspace. Laplacian scale mixture (LSM) modeling is then investigated to model tensor coefficients from overlapping cubes in low-rank subspace. Both the hidden scale parameters and the sparse coefficients therein are adaptively shrink, characterizing the sparsity of similar patches. Meanwhile, the$\ell _{1}$data fidelity facilitates the implicit detection of outliers after median filtering. Substantiated by extensive experimental results, the proposed method outperforms several state-of-the-art approaches on mixed noise removal, qualitatively and quantitatively.

In this letter, we present a hyperspectral image (HSI) mixed-noise removal method named Moreau-enhanced total variation (TV) regularized local low-rank matrix recovery (LLRMTV). The rank-fixed matrix recovery is first adopted to separate the low-rank clean HSI patches from the sparse noise. Then, a Moreau-enhanced TV regularized image reconstruction strategy is utilized to ensure the piecewise smoothness of the reconstructed image from the low-rank patches. The proposed Moreau-enhanced TV restoration method involves a nonconvex penalty designed to maintain the convexity of the objective function. Moreover, the proposed model is integrated into an augmented Lagrange multiplier (ALM) algorithm to produce final results, leading to a complete HSI restoration framework. Examples of restoration illustrate the improvement over the typical TV regularization.

Big data annotation plays an important role in Artificial Intelligence model training. The proliferation of data annotation tasks has brought the issue of security of the big data delivery. This work identifies the security framework associated with encryption and compression procedures that support data delivery safety. In this paper, we propose an agile framework that caters to various types of data under RESTful web services. All the procedures are automatically operated by the server without human intervention. This work assists the company delivers the tagged data products to users with a high-security level avoiding the risk of information disclosure.

This paper studies the joint assignment of time slots and frequency channels in tree-based wireless sensor networks for data collection applications. Our proposed approach is based on dynamic programming and is resilient to link errors. Extensive simulations are conducted and the results show the superior performance of our approach over peer methods. In addition, our evaluation reveals the impacts of implementation-specific factors, such as link reliability, deployment area, and transmission power, making our results valuable for real-world deployments.

Industrial wireless sensor network design requires efficient channel usages and timeslot assignment. In this paper, we describe an integrated channel-timeslot allocation algorithm based on a routing-tree coloring scheme. According to a strict routing-tree definition and corresponding resource allocation principles, the algorithm performs in two phases. In the first phase, a traditional mesh sensor network is mapped to a routing tree and each node is colored algorithmically. In the second phase, timeslots are assigned on the colored routing tree according to principles of timeslot allocation. The total number of timeslots necessary by this algorithm for a generic sensor network is theoretically analyzed and the algorithm performance is also evaluated by simulations. The algorithm is compatible with all three latest industrial wireless network standards, WIA-PA, WirelessHART, and ISA 100.11a.