No abstract

This paper discusses the couple-group consensus problems for a class of heterogeneous multiagent networks including the following two cases: with communication and input time delays, respectively. Different from the related cooperative networks, two novel delayed group consensus protocols are designed based on the competitive relationship between the agents. Furthermore, we absolutely relax the in-degree balance and other restrictive preconditions which existed in the relevant works. Some sufficient algebraic criteria for the achievement of couple-group consensus and the upper bound of the input time delays are technically obtained via the frequency domain method and matrix theory, respectively. The results show that the achievement of the couple-group consensus depends on the second-order agents' in-degree and the control parameters of the systems, whereas it is independent of the communication time delays. Meanwhile, the upper bound of the input time delay is determined by the control parameters and the in-degree of the first-order agents. Finally, the validity of the proposed results is verified by several simulated examples.

No abstract

No abstract

This paper studied the simulation problems of facial aging with the computer visual processing software. According to comparing the most used facial pictures, this paper decided to take the face images from FE-NET database as the objects of modeling analysis. Considering the AAM, WT and other Facial Feature Extraction Algorithms, this took the AMM algorithm to extract and mark the facial feature, gray and match histogram. Actually, the high dimensionality of the extracted feature has a bad affection on efficiency and result in post processing, so this paper adopts the classical method PCA to process the facial feature set. This paper adopts a piecewise-linear algorithm to segment all facial images based on ages to four sections, and extract features of every section to make linear similarity compare. This paper simulates images and reverse simulation in every section, with good results.