Junhao Guo

Convolutional neural network (CNN) is quite popular in computer vision, especially in image classification with excellent performance. However, limited by the convolution kernels, CNN-based classifiers are hard to extract global feature from the original image, while exact object locations in the environment are included in the global feature. One popular way to improve global feature extraction performance is to use graph neural network (GNN) which can aggregate global information through the connection relationship of different nodes. In this work, a novel end-to-end graph neural network architecture is proposed, in which local and global-attention feature are used simultaneously to achieve more accurate predictions. In this architecture, a CNN block is designed to learn local feature and graph convolutional neural network (GCN) is used to learn global feature. Global-attention feature for final prediction is down-sampled from global feature by the proposed global multi-head self-attention pooling (GMSAPool) based on self-attention mechanism, which reconstructs the input graph by introducing virtual node and automatically assigns different weights to each node to obtain a more representative global-attention feature. In addition, the proposed architecture can be trained without converting images to graphs in advance, and the computational burden can also be reduced. This approach is demonstrated on three open datasets (Agricultural Disease, Caltech256 and CIFAR-100) to validate the effectiveness. The determined experimental results showed that: (1) The proposed model achieve 84.46%, 77.80%, and 83.33% on the Macro-F1 in three datasets respectively, improving over the best baselines; (2) Global-attention feature that is more conducive to the final prediction is extracted by GMSAPool from numerous nodes, in which Macro-P,Macro-R and Macro-F1 are respectively improved 3.655%,1.12%,2.715% on average.

In this paper, the graph based condition for the controllability of game based control system is presented when the control of regulator is not zero. A control framework which can describe realism well expressed as the game based control system (GBCS), was obtained in 2019, which, unfortunately, is not graph theoretically verifiable, and the regulator control input is assumed to be zero. However, based on a new established notion, strategy matrix, we propose a graph theory condition to judge the controllability of GBCS, instead of using algebraic conditions for complex mathematical calculations. More specifically, to tackle these issues, one needs to study the expression of Nash equilibrium actions when regulators control is not zero first. Based on this expression, the general formula of game controllability matrix is obtained, which provides theoretical support for studying the essential influence of topology on game based control system. The general formula is always affected by the specific matrix strategy matrix, composed of Nash equilibrium actions, and the matrix can not only be obtained by matrix calculation, but also can be directly written through the topology, which is the specific influence of the topology on the GBCS. Finally, we obtain the result of judging the controllability of the system directly according to the topological structure, and put forward the conjecture that there is no limitation of equivalent partition in GBCS. Arguably, this is a surprising conjecture on the equivalent partition of graphs, because only the limitation of equivalent partition in fivenode graphs has been solved so far