Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.

In this paper, a multiple sliding surface (MSS) controller for a twin rotor multi-input-multioutput system (TRMS) with mismatched model uncertainties is proposed. The nonlinear terms in the model are regarded as model uncertainties, which do not satisfy the standard matching condition, and an MSS control technique is adopted to overcome them. In order to control the position of the TRMS, the system dynamics are pseudo-decomposed into horizontal and vertical subsystems, and two MSSs are separately designed for each subsystem. The stability of the TRMS with the proposed controller is guaranteed by the Lyapunov stability theory. Some simulation results are given to verify the proposed scheme, and the real time performances of the TRMS with the MSS controller show the effectiveness of the proposed controller.

Dealing with uncertainty is always a challenging problem. Intuitionistic fuzzy sets was presented to manage situations in which experts have some membership and non-membership value to assess an alternative. Hesitant fuzzy sets was used to handle such situations in which experts hesitate between several possible membership values to assess an alternative. In this paper, the concept of intuitionistic hesitant fuzzy set is introduced to provide computational basis to manage the situations in which experts assess an alternative in possible membership values and non-membership values. Distance measure is defined between any two intuitionistic hesitant fuzzy elements. Fuzzy technique for order preference by similarity to ideal solution is developed for intuitionistic hesitant fuzzy set to solve multi-criteria decision making problem in group decision environment. An example is given to illustrate this technique.

Although the fuzzy logic controller is superior to the proportional integral derivative (PID) controller in motor control, the gain tuning of the fuzzy logic controller is more complicated than that of the PID controller. Using mathematical analysis of the proportional derivative (PD) and fuzzy logic controller, this study proposed a design method of a fuzzy logic controller that has the same characteristics as the PD controller in the beginning. Then a design method of a fuzzy logic controller was proposed that has superior performance to the PD controller. This fuzzy logic controller was designed by changing the envelope of the input of the of the fuzzy logic controller to nonlinear, because the fuzzy logic controller has more degree of freedom to select the control gain than the PD controller. By designing the fuzzy logic controller using the proposed method, it simplified the design of fuzzy logic controller, and it simplified the comparison of these two controllers.

This paper presents the control of an inverted pendulum system using intelligent algorithms, such as fuzzy logic and neural networks, for advanced control education. The swing up balancing control of the inverted pendulum system was performed using fuzzy logic. Because the switching time from swing to standing motion is important for successful balancing, the fuzzy control method was employed to regulate the energy associated with the angular velocity required for the pendulum to be in an upright position. When the inverted pendulum arrived within a range of angles found experimentally, the control was switched from fuzzy to proportional-integral-derivative control to balance the inverted pendulum. When the pendulum was balancing, a joystick was used to command the desired position for the pendulum to follow. Experimental results demonstrated the performance of the two intelligent control methods.

Sequence tagging is the task of predicting frame-wise labels for a given input sequence and has important applications to diverse domains. Conventional methods such as maximum likelihood (ML) learning matches global features in empirical and model distributions, rather than local features, which directly translates into frame-wise prediction errors. Recent probabilistic sequence models such as conditional random fields (CRFs) have achieved great success in a variety of situations. In this paper, we introduce a novel discriminative CRF learning algorithm to minimize local feature mismatches. Unlike overall data fitting originating from global feature matching in ML learning, our approach reduces the total error over all frames in a sequence. We also provide an efficient gradient-based learning method via gradient forward-backward recursion, which requires the same computational complexity as ML learning. For several real-world sequence tagging problems, we empirically demonstrate that the proposed learning algorithm achieves significantly more accurate prediction performance than standard estimators.

In this paper, we investigate the properties of join and meet preserving maps in complete residuated lattice using Zhang`s the fuzzy complete lattice which is defined by join and meet on fuzzy posets. We define L-upper (resp. L-lower) approximation operators as a generalization of fuzzy rough sets in complete residuated lattices. Moreover, we investigate the relations between L-upper (resp. L-lower) approximation operators and L-fuzzy preorders. We study various L-fuzzy preorders on . They are considered as an important mathematical tool for algebraic structure of fuzzy contexts.

It presents the concepts of ordinary smooth interior and ordinary smooth closure of an ordinary subset and their structural properties. It also introduces the notion of ordinary smooth (open) preserving mapping and addresses some their properties. In addition, it develops the notions of ordinary smooth compactness, ordinary smooth almost compactness, and ordinary near compactness and discusses them in the general framework of ordinary smooth topological spaces.