There are always some “key” nodes in a big complex network, which can joint the most connected subgraphs. How to identify these nodes, finding a minimum set of nodes to attack for reducing the size of residual netwo...
There are always some “key” nodes in a big complex network, which can joint the most connected subgraphs. How to identify these nodes, finding a minimum set of nodes to attack for reducing the size of residual network's Largest Connected Component(LCC) to break up the original network, has become a research hotspot. Therefore, a method for determining the “key” nodes based on reinforcement learning framework and supervised learning model is proposed. This algorithm can not only utilize the dynamic exploration ability of reinforcement learning to collect a rich training dataset, but also take advantage of the characteristics that supervised learning is adaptive and has strong generalization ability to possess high efficiency and strong robustness. In order to further improve the algorithm's performance, $\epsilon$ -greedy mechanism is used to explore more network states. The experiment results show that given the same fraction of removed nodes, our algorithm can make the residual LCC smaller in various networks which is superior to the state-of-the-art algorithms in terms of effectiveness and generalization.
Deep perception of the unmanned surface vehicle's surroundings is an inaccessible part of its fully autonomous navigation mission. The existing methods, whether based on traditional stereo matching or deep learnin...
Deep perception of the unmanned surface vehicle's surroundings is an inaccessible part of its fully autonomous navigation mission. The existing methods, whether based on traditional stereo matching or deep learning, do not fully consider the characteristics of water environment, resulting in severe error depths in weak textures (sky, calm lake) and water reflections regions, that increases the risk of running aground or collision. What is worse that there is not a public dataset for depth estimation in the water environment. Therefore, this work proposes a self-supervised model for depth estimation named Water Depth Perception Network (WDNet) to address these problems. The decoder of this network has a wider receptive field and can effectively handle the depth error in the weak texture region. Besides, the WDNet is trained with a novel and effective loss function which assist the network to reduce errors in sky and water region, and some indexes are proposed to evaluate the model's performances in sky and water region. Finally, our proposed WDNet achieves a 0.1056 absolute relative error in ranging, the average number of error pixels in the sky area drops from 15803.87 to 580.91, which only accounted for 0.29% of the image, and the error in water region drops from 51.04 to 6.75, all of them are superior to the performance of baseline model.
The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this chal...
The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this challenging issue, this work develops a Koopman model predict control (Koopman- MPC) framework for the piezoelectric actuator. Specifically, the Koopman operator theory is adapted for modeling the piezoelectric actuator dynamics. A simple yet powerful linear model spanned in a high-dimensional space is thus constructed to characterize the hysteresis dynamics. Subsequently, upon the established Koopman model, an MPC scheme is put forward for tracking control of piezoelectric actuators. Therein, by sustained optimizing a cost function containing future outputs and control increments, the control input is obtained. Moreover, extensive tracking simulations are carried out on a simulated piezoelectric actuator for verifying the feasibility and effectiveness of the Koopman- Mpc scheme.
This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization algorithm. First, this paper uses the ways of multi-objective optimization to model the USV path planning problem...
This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization algorithm. First, this paper uses the ways of multi-objective optimization to model the USV path planning problem. An improved ant colony algorithm named ACO-SA is put forward afterwards to effectively solve the problem. The algorithm is a combination of ACO algorithm(ant colony algorithm) and SA algorithm(simulated annealing algorithm), which has three improments: change the initial distribution of pheromone to guide the search when the algorithm has just started running; change the heuristic function and state transition probability taking three factors into consideration; change the pheromone update rule and make the ants compete for the right to update pheromone by simulated annealing algorithm, and update the best solution by the same algorithm. Finally, simulation experiment and field experiment are conducted to check the validity of ACO-SA algorithm.
Addressing the weak generalization capability and suboptimal prediction performance of single mechanistic and data-driven models, this paper proposes a transformer fault detection method based on the fusion of mechani...
详细信息
X-ray security check is a prevalent placement measure that plays a vital role in ensuring public safety. However, detecting prohibited items poses a complex challenge due to their variable sizes within X-ray images. I...
详细信息
ISBN:
(数字)9798350376548
ISBN:
(纸本)9798350376555
X-ray security check is a prevalent placement measure that plays a vital role in ensuring public safety. However, detecting prohibited items poses a complex challenge due to their variable sizes within X-ray images. In this study, we tackle this issue by curating a novel dataset through the integration of open-source data and introducing a Multiscale Feature Fusion Module. This module facilitates robust detection by amalgamating features across different scales. Extensive experiments verified that the superiority of our method compared to existing methods on the prohibited items test set constructed in this paper demonstrates extremely well the practical effectiveness of our proposed method.
As a vital technology in the field of image processing, numerous visible and infrared fusion methods have emerged with the aim of generating a single image containing salient targets and abundant details. However, owi...
详细信息
ISBN:
(数字)9798350349399
ISBN:
(纸本)9798350349405
As a vital technology in the field of image processing, numerous visible and infrared fusion methods have emerged with the aim of generating a single image containing salient targets and abundant details. However, owing to the influence of target motion or camera shake, source images may suffer from motion blur, resulting in blurred edges and unrecognizable objects. To address this issue, this paper bridges the gap between deblurring and fusion tasks and proposes a joint motion deblurring and fusion network for visible and infrared image (MDbFusion). On the one hand, we innovatively merge motion deblurring task into network design, which effectively ensures the capacity of MDbFusion to process images in the extreme condition. On the other hand, an Adaptive Weight Module (AWM) is designed to calculate contribution between visible and infrared features, which solves the channel contrast between two tasks, greatly reducing the complexity of network. Extensive experiments demonstrate that the MDb-Fusion outperforms state-of-the-art (SOTA) fusion algorithms in terms of preserving texture details and quantitative metrics. Furthermore, we also compare with a two-step fusion strategy that first deblurring then fusion, both with SOTA methods. The results reveal superiority of our framework in coupling and reciprocity between two tasks.
Aeromagnetic surveys, renowned for their operational flexibility and high efficiency, serve as a crucial technique for measuring the geomagnetic field. However, aeromagnetic surveys are easily affected by magnetic int...
ISBN:
(数字)9798350352627
ISBN:
(纸本)9798350352634
Aeromagnetic surveys, renowned for their operational flexibility and high efficiency, serve as a crucial technique for measuring the geomagnetic field. However, aeromagnetic surveys are easily affected by magnetic interference from navigation platforms, making the compensation of aeromagnetic interference a crucial step in the measurement process. To address the inadequate consideration of nonlinear magnetic field interference in traditional compensation algorithms, this paper introduces an aeromagnetic compensation approach based on broad learning system. The broad learning system employs an incremental learning mechanism aimed at enhancing the precision of the network alongside the increase in nodes. With each expansion of the network node, computation is streamlined to calculating the pseudo-inverse of the expansion node, eliminating the necessity for retraining the entire network structure. Leveraging the nonlinear fitting characteristics of the broad learning system, this paper improves the accuracy of aeromagnetic interference compensation. Through UAV flight experiments, the broad learning system is compared with methodologies using particle swarm optimization (PSO) and BP neural network. Compared with PSO, training time was reduced by $21.3 \%$ and magnetic interference by $33.6 \%$. Compared with BP neural networks, training time was reduced by $34.9 \%$ and magnetic interference by $28.6 \%$. This paper provides references and ideas for the selection of aeromagnetic interference compensation algorithms.
In the conventional robust optimization(RO)context,the uncertainty is regarded as residing in a predetermined and fixed uncertainty *** many applications,however,uncertainties are affected by decisions,making the curr...
详细信息
In the conventional robust optimization(RO)context,the uncertainty is regarded as residing in a predetermined and fixed uncertainty *** many applications,however,uncertainties are affected by decisions,making the current RO framework *** paper investigates a class of two-stage RO problems that involve decision-dependent *** introduce a class of polyhedral uncertainty sets whose right-hand-side vector has a dependency on the here-and-now decisions and seek to derive the exact optimal wait-and-see decisions for the second-stage problem.A novel iterative algorithm based on the Benders dual decomposition is proposed where advanced optimality cuts and feasibility cuts are designed to incorporate the uncertainty-decision *** computational tractability,robust feasibility and optimality,and convergence performance of the proposed algorithm are guaranteed with theoretical *** motivating application examples that feature the decision-dependent uncertainties are ***,the proposed solution methodology is verified by conducting case studies on the pre-disaster highway investment problem.
This paper proposes a fog weather data augmentation method for the unmanned surface vessels (USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided ...
This paper proposes a fog weather data augmentation method for the unmanned surface vessels (USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided generation of the atmospheric scattering model in this paper. A Laplacian Pyramid Based Depth Residuals model is added to the generator which reduces the difficulty of generating fog images caused by the degradation of water surface image and improves the quality of generated images. Finally, fog images are generated from sunny weather images collected with HUST-12C by LPBDR-GAN model and experiments show that generated images are very close to real fog images.
暂无评论