Privacy-preserving image generation is particularly crucial in fields like healthcare, where data are both sensitive and limited. However, effective privacy preservation often compromises the visual quality and utilit...
详细信息
This article proposes a Q-learning (QL)-based algorithm for global consensus of saturated discrete-time multiagent systems (DTMASs) via output feedback. According to the low-gain feedback (LGF) theory, control inputs ...
详细信息
This article proposes a Q-learning (QL)-based algorithm for global consensus of saturated discrete-time multiagent systems (DTMASs) via output feedback. According to the low-gain feedback (LGF) theory, control inputs of the saturated DTMASs can avoid the saturation by utilizing the control policies with LGF matrices, which were computed from the modified algebraic Riccati equation (MARE) by requiring the information of system dynamics in most previous works. However, in this article, we first find the lower bound on the real part of Laplacian matrices' nonzero eigenvalues of directed network topologies. Then, we define a test control input and propose a Q-function to derive a QL Bellman equation, which plays an essential part of the QL algorithm. Subsequently, different from the previous works, the output-feedback gain (OFG) matrix of this article can be obtained by limited iterations of the QL algorithm without requiring the information of agent dynamics and network topologies of the saturated DTMASs. Furthermore, the saturated DTMASs can achieve global consensus rather than the semiglobal consensus of the previous results. Finally, the effectiveness of the QL algorithm is confirmed via two simulations.
The published stability criteria for impulsive neural networks are scale-free on time line, which is only appropriate for discrete or continuous ones. The issue of global exponential stability for impulsive delayed ne...
详细信息
The published stability criteria for impulsive neural networks are scale-free on time line, which is only appropriate for discrete or continuous ones. The issue of global exponential stability for impulsive delayed neural networks on time scales is analyzed by employing the convex combination method in this article. Several algebraic and linear matrix inequality conditions are proved by constructing impulse-dependent Lyapunov functionals and using timescale inequality techniques. Unlike the published works, impulsive control strategies can be designed by utilizing our theoretical results to stabilize delayed neural networks on time scales if they are unstable before introducing impulses. Sufficient criteria for global exponential stability in this article are derived based on the timescale theory, and they are applicable to discrete-time impulsive neural networks, their continuous-time analogues, and neural networks whose states are discrete at one time and continuous at another time. Four numerical examples are offered to demonstrate the effectiveness and superiority of our new theoretical results in the end.
This paper discusses the H∞ consensus problem of leader-follower multi-agent systems. The controller for each agent is crafted to utilize comprehensive information from all connected agents, while an innovative event...
详细信息
High-precision semantic segmentation methods require global information and more detailed local features. It is difficult for ordinary convolutional neural networks to efficiently use this information. In response to ...
详细信息
High-precision semantic segmentation methods require global information and more detailed local features. It is difficult for ordinary convolutional neural networks to efficiently use this information. In response to the above issues, this paper uses the attention to scale method and proposes a novel attention model for semantic segmentation, which aggregates multi-scale and context features to refine prediction. Specifically, the skeleton convolutional neural network framework takes in multiple different scales inputs, by which means the CNN can get representations in different scales. The proposed attention model will handle the features from different scale streams respectively and integrate them. Then location attention branch of the model learns to softly weight the multi-scale features at each pixel location. Moreover, we add an recalibrating branch, parallel to where location attention comes out, to recalibrate the score map per class. We achieve quite competitive results on PASCAL VOC 2012 and ADE20K datasets, which surpass baseline and related works.
In this paper, we make the first research effort to address the RGB-Thermal (RGB-T) crowd counting problem with decision-level late fusion manner. Being different from the existing pixel-level or feature-level fusion ...
详细信息
Large-scale multiobjective optimization problems (LSMOPs) exist widely in real-world applications. The large number of decision variables in LSMOP leads to a tremendous high-dimensional search space, which is still ch...
详细信息
Emotion recognition is a critical component of affective computing. Training accurate machine learning models for emotion recognition typically requires a large amount of labeled data. Due to the subtleness and comple...
详细信息
Electroencephalogram (EEG)-based seizure subtype classification enhances clinical diagnosis efficiency. Source-free semi-supervised domain adaptation (SF-SSDA), which transfers a pre-trained model to a new dataset wit...
详细信息
The goal of this work is to develop a task-agnostic feature upsampling operator for dense prediction where the operator is required to facilitate not only region-sensitive tasks like semantic segmentation but also det...
详细信息
暂无评论