10205775
Kernel-based Global Folley-Sammon Discriminate Analysis
Kernel trick is a useful method dealing with the nonlinearity of patterns ' distribution, and widely used for non-linear pattern classification problem. Recently, many kernel-based Fisher discriminate methods were proposed, the features extracted by those methods are statistically uncorrelated, usually ineffectively when used in so called "small sample problem "(SSS), which exists in most FR tasks. To overcome this shortcoming, in this paper we present Kernel-based Global Folley-Sammon Discriminate Analysis (KGFS), it can be realized in three steps: firstly by combing kernel function, map data onto an implicit high-dimensional feature space, secondly construct orthogonal feature space there, finally calculate iterative global orthogonal discriminate vectors. Experiments have been done on ORL dataset. In terms of classification error rate performance, proposed kernel based method KGFS has a better performance than other three commonly used kernel-based methods, such as GDA, MGDAandKDDA.
7090731
Anomaly Intrusion Detection Methods for Peer-to-Peer System
Peer-to-peer systems and applications are the hotspot of research of network applications. As peer-to-peer system has no central system and is deployed on an open network, new concerns regarding security have been raised. As an additional security measure, the intrusion detection system would help determine whether unauthorized users are attempting to access, have already accessed, or have compromised the network Intrusion detection, as the second line of defense, is an indispensable tool for highly survivable networks. In this paper two anomaly intrusion detection methods are proposed for peer-to-peer system. The main characters of the methods are that they can detect intrusion in real-time without any expert knowledge and attack signatures. One method uses hidden Markov model to check reflector DoS attacks, another based on adaptive resonance theory, which can learn the normal behavior with unsupervised method. The experimental P2P system is built on FreePastry 1.401 and JDK 1.5.0. The results have indicated that the methods can find DoS attacks immediately and find new intruders with low false alarm rate.
35160170
RBF Neural Network Based Shape Control of Hyper-redundant Manipulator with Constrained End-Effector
Hyper-redundant manipulator has more degrees of freedom than the least necessary to perform a given task, thus it has the features of overcoming conventional industrial robot’s limitation to carry out a designated difficult task. When the manipulator carries out the missions such as brushing or writing on a surface, drilling or inspection in a hole, the end-effector of the manipulator usually has both position and orientation requirement. Effective control of the hyper-redundant manipulator with such constrained end-effector is difficult for its redundancy. In this paper, a novel approach based on RBF neural network has been proposed to kinematically control the hyper-redundant manipulator. This technique, using variable regular polygon and RBF neural networks models, is completely capable of solving the control problem of a planar hyper-redundant manipulator with any number of links following any desired direction and path. With the shape transformation of variable regular polygon, the manipulator’s configuration changes accordingly and moves actively to perform the tasks. Compared with other methods to our knowledge, this technique has such superiorities as fewer control parameters and higher precision. Simulations have demonstrated that this control technique is available and effective.
39558628
Combined adaptive beamforming with space-time block coding for multi-antenna communications
Aiming at the multi-antenna communication systems, a downlink transmit scheme combining adaptive beamforming (ABF) with space-time block coding (STBC) is first presented, which utilizes the maximization of the output mean signal-to-noise ratio (SNR) and the minimization of the symbol error rate (SER) upper bound of the three widely used modulations as the design criteria. Then, based on the moment generating function (MGF) and the Gauss-Chebyshev integration, a simple and accurate numerical method is presented to analyze the SER performance of the system with the new transmit scheme under the three commonly used modulations. Finally, computer simulation results demonstrate the effectiveness and superiority of the proposed strategy.
17592710
Full-Space LDA With Evolutionary Selection for Face Recognition
Linear discriminant analysis (LDA) is a popular feature extraction technique for face recognition. However, it often suffers from the small sample size problem when dealing with the high dimensional face data. Some approaches have been proposed to overcome this problem, but they usually utilize all eigenvectors of null or range subspaces of within-class scatter matrix (Sw). However, experimental results testified that not all the eigenvectors in the full space of S w are positive to the classification performance, some of which might be negative. As far as we know, there have been no effective ways to determine which eigenvectors should be adopted. This paper proposes a new method EDA+Full-space LDA, which takes full advantage of the discriminative information of the null and range subspaces of Sw by selecting an optimal subset of eigenvectors. An estimation of distribution algorithm (EDA) is used to pursuit a subset of eigenvectors with significant discriminative information in full space of Sw middot EDA+Full-space LDA is tested on ORL face image database. Experimental results show that our method outperforms other LDA methods
6883051
Studies on lateral rolling locomotion of a snake robot
A reconfigurable modular snake robot has been developed, which can not only move on a plane but aIso achieve some f-dimensional motions while reconfigured. Control equations of 3-dimensional locomotion were established by the composition of two bending motions in mutual orthogonal plane. Three types of lateral rolling locomotion, flapping, linear rolling and curved rolling, were achieved by controlling the amplitudes and the number of two waves in the two bending motions. Using the three types of locomotion the snake robot can realize net lateral translation, alternation of its contact base and rolling over some obstacles. The lateral rolling locomotion obtains its driving force through the interaction with the environment. The rolling shape and its direction depend on the transferring direction and phase difference of the two waves respectively.
37867009
Spatial Clustering with Obstacles Constraints Using Ant Colony and Particle Swarm Optimization
Spatial clustering is an important research topic in Spatial Data Mining (SDM). This paper proposes an Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use improved ACO to obtain the shortest obstructed distance, which is an effective method for arbitrary shape obstacles, and then we develop a novel PKSCOC based on PSO and K-Medoids to cluster spatial data with obstacles. The PKSCOC algorithm can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints and practicalities of spatial clustering. The experimental results demonstrate the effectiveness and efficiency of the proposed method, which performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).