Infrared and visible image fusion is currently an important research direction in the field of multimodal image fusion, which aims to utilize the complementary information between infrared images and visible images to generate a new image containing richer information. In recent years, many deep learning-based methods for infrared and visible image fusion have emerged. However, most of these approaches ignore the importance of semantic information in image fusion, resulting in the generation of fused images that do not perform well enough in human visual perception and advanced visual tasks. To address this problem, we propose a semantic prior knowledge-driven infrared and visible image fusion method. The method utilizes a pre-trained semantic segmentation model to acquire semantic information of infrared and visible images, and drives the fusion process of infrared and visible images through semantic feature perception module and semantic feature embedding module. Meanwhile, we divide the fused image into each category block and consider them as components, and utilize the regional semantic adversarial loss to enhance the adversarial network generation ability in different regions, thus improving the quality of the fused image. Through extensive experiments on widely used datasets, the results show that our approach outperforms current leading algorithms in both human eye visualization and advanced visual tasks. The source code is available at https://github.com/tianzhiya/SPDFusion.

To improve the ability of the sine cosine algorithm (SCA) in the exploitation process, an improved symmetric SCA with adaptive probability selection (SSCA-APS), is proposed. The search process of this algorithm is divided into early and late stages. In the early stage, the operators of the traditional SCA algorithm continue to be used. In the late stage, three improvements were applied. Firstly, the symmetric sine and cosine operators are proposed. The adaptive probability selection strategy is adopted to integrate original sine and cosine operators and symmetric sine and cosine operators for dynamically adjusting the step size of the search range. Furthermore, to prevent the population from falling into local optimization, Gaussian perturbation is used to mutate the globally optimal individuals of the current generation. In addition, the information of two randomly selected individuals and the globally optimal individual is integrated by quadratic interpolation to maintain population diversity and produce a new individual. 23 test functions were used to verify the performance of the proposed algorithm. The simulation results indicate that the performance of the SSCA-APS algorithm has competitiveness when it is compared with classical SCA and some state-of-the-art SCA variants.

In a vehicular ad hoc network (VANET), roadside units (RSUs) are installed at roadside and intersections to process vehicle‐to‐infrastructure communication, collect and analyse intelligent vehicle traffic data, send information to vehicles, and achieve early warning of safe driving of vehicles. Owning to the high cost of implementing and maintaining RSUs, it is of vital importance to determine where and how many RSUs to deploy. Optimal RSU deployment requires both a small number of RSUs and the maximum coverage of vehicle running process, which constitutes a conflicting multiobjective problem. Nevertheless, existing works do not explicitly utilize multiobjective algorithm to solve the RSU deployment problem. Therefore, a multiobjective differential evolution approach is proposed in this work to solve the problem. Firstly, to conquer the complexity of urban road RSU deployment, the static model is established. Secondly, in the proposed multiobjective differential evolution with discrete elitist guide (MODE‐deg), the sigmoid function is applied to discrete individual values. Finally, elitist individuals are selected based on crowding distance ranking and nondominated ranking to generate new individuals, which further improve the convergence speed and population performance. Experimental results show that MODE‐deg can generate the optimal nondominant solution set with good convergence and diversity, in contrast to other multiobjective evolutionary algorithms in five test functions of ZDT.

The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has received attention from researchers in recent years. This paper presents a new multiobjective algorithm based on decomposition and the cloud model called multiobjective decomposition evolutionary algorithm based on Cloud Particle Differential Evolution (MOEA/D-CPDE). In the proposed method, the best solution found so far acts as a seed in each generation and evolves two individuals by cloud generator. A new individual is produced by updating the current individual with the position vector difference of these two individuals. The performance of the proposed algorithm is carried on 16 well-known multi-objective problems. The experimental results indicate that MOEA/D-CPDE is competitive.