Optimal Local Basis: A Reinforcement Learning Approach for Face Recognition

This paper presents a novel learning approach for Face Recognition by introducing Optimal Local Basis. Optimal local bases are a set of basis derived by reinforcement learning to represent the face space locally. The reinforcement signal is designed to be correlated to the recognition accuracy. The optimal local bases are derived then by finding the most discriminant features for different parts of the face space, which represents either different individuals or different expressions, orientations, poses, illuminations, and other variants of the same individual. Therefore, unlike most of the existing approaches that solve the recognition problem by using a single basis for all individuals, our proposed method benefits from local information by incorporating different bases for its decision. We also introduce a novel classification scheme that uses reinforcement signal to build a similarity measure in a non-metric space. Experiments on AR, PIE, ORL and YALE databases indicate that the proposed method facilitates robust face recognition under pose, illumination and expression variations. The performance of our method is compared with that of Eigenface, Fisherface, Subclass Discriminant Analysis, and Random Subspace LDA methods as well.     

Estimation of skew angle in text-image analysis bySLIDE: Subspace-based line detection

A new signal processing method is developed for estimating the skew angle in text document images. Detection of the skew angle is an important step in text processing tasks such as optical character recognition (OCR) and computerized filing. Based on a recently introduced multiline-fitting algorithm, the proposed method reformulates the skew detection problem into a special parameter-estimation framework such that a signal structure similar to the one in the field of sensor array processing is obtained. In this framework, straight lines in an image are modeled as wavefronts of propagating planar waves. Certain measurements are defined in this virtual propagation environment such that the large amount of coherency that exists between the locations of the pixels on parallel lines is exploited to enhance a subspace in the space spanned by the measurements. The well-studied techniques of sensor array processing (e.g., the ESPRIT algorithm) are then exploited to produce a closed form and high-resolution estimate for the skew angle.     

To Schedule or to Execute: Decision Support and Performance Implications

This paper addresses a fundamental trade-off in dynamic scheduling between the cost of scheduling and the quality of the resulting schedules. The time allocated to scheduling must be controlled explicitly, in order to obtain good-quality schedules in reasonable times. As task constraints are relaxed, the algorithms proposed in this paper increase scheduling complexity to optimize longer and obtain high-quality schedules. When task constraints are tightened, the algorithms adjust scheduling complexity to reduce the adverse effect of long scheduling times on the schedule quality. We show that taking into account the scheduling time is crucial for honoring the deadlines of scheduled tasks. We investigate the performance of our algorithms in two scheduling models: one that allows idle-time intervals to exist in the schedule and another that does not. The model with idle-time intervals has important implications for dynamic scheduling which are discussed in the paper. Experimental evaluation of the proposed algorithms shows that our algorithms outperform other candidate algorithms in several parameter configurations.     

A decision system using fuzzy cognitive map and multi-group data envelopment analysis to estimate hospitals’ outputs level

Due to its vital role in healthcare system, performance evaluation of hospitals is indispensable. In addition, hospitals try to achieve desired and efficient conditions by careful planning based on their present facilities. Several studies have been conducted on hospital evaluation, but nearly none of them has taken into consideration the difference in the nature of performance in respect of hospitals’ managerial construction, funding, and type of services provided by them. Furthermore, hospitals’ outputs have not been estimated in respect of cause and effect relationships between inputs and outputs for achieving efficient conditions. In the present study, first, a new approach for hospital evaluation is presented according to the differences in the nature of their performances while categorized in groups. Then, optimal outputs for each hospital in its own group are dealt with using results obtained from multi-group data envelopment analysis and the method of fuzzy cognitive map. The activation Hebbian learning (AHL) algorithm is adapted to the concept of efficiency and is conducted to estimate the outputs of inefficient hospitals. In the present study, 27 hospitals located in the provincial capitals in northwest of Iran are categorized in four groups including general governmental hospitals, specialty governmental hospitals, private hospitals, and social security hospitals. Afterward, optimal outputs are estimated for the inefficient hospitals by using the proposed modified AHL algorithm. The results indicate that when the hospitals have been evaluated in groups, efficiency scores of hospitals have changed. Also, given the cause and effect relationships between inputs and outputs in each group can help to decision and policy makers to estimate the optimal outputs that have caused inefficient hospitals become efficient.

     

The Nash Equilibrium Point of Dynamic Games Using Evolutionary Algorithms in Linear Dynamics and Quadratic System

In this paper, examining some games, we show that classical techniques are not always effective for games with not many stages and players and it can’t be claimed that these techniques of solution always obtain the optimal and actual Nash equilibrium point. For solving these problems, two evolutionary algorithms are then presented based on the population to solve general dynamic games. The first algorithm is based on the genetic algorithm and we use genetic algorithms to model the players' learning process in several models and evaluate them in terms of their convergence to the Nash Equilibrium. in the second algorithm, a Particle Swarm Intelligence Optimization (PSO) technique is presented to accelerate solutions’ convergence. It is claimed that both techniques can find the actual Nash equilibrium point of the game keeping the problem’s generality and without imposing any limitation on it and without being caught by the local Nash equilibrium point. The results clearly show the benefits of the proposed approach in terms of both the quality of solutions and efficiency.     

Attention control with reinforcement learning for face recognition under partial occlusion

In this paper a new method for handling occlusion in face recognition is presented. In this method the faces are partitioned into blocks and a sequential recognition structure is developed. Then, a spatial attention control strategy over the blocks is learned using reinforcement learning. The outcome of this learning is a sorted list of blocks according to their average importance in the face recognition task. In the recall mode, the sorted blocks are employed sequentially until a confident decision is made. Obtained results of various experiments on the AR face database demonstrate the superior performance of proposed method as compared with that of the holistic approach in the recognition of occluded faces.     

Genetic-based random key generator (GRKG): a new method for generating more-random keys for one-time pad cryptosystem

In this paper, a new algorithm for generating more-randomized keys for symmetrical cipher one-time pad (OTP) according to the linear congruential (LCG) method based on the idea of genetic algorithm is proposed. The method, genetic-based random key generator, is proposed for generating keys for the OTP method with a high degree of key randomness; this adds more strength to the OTP method against breaking this cryptosystem. This algorithm is composed of two parts. Initially, the first population is being generated by LCG method, and then, genetic operators for generating the next populations are being used. Generating random keys with the presented method requires seven-parameter key that increases the security of communication between the transceivers.     

Evolving Takagi–Sugeno fuzzy model based on switching to neighboring models

In this paper, we propose a new online identification approach for evolving Takagi–Sugeno (TS) fuzzy models. Here, for a TS model, a certain number of models as neighboring models are defined and then the TS model switches to one of them at each stage of evolving. We define neighboring models for an in-progress (current) TS model as its fairly evolved versions, which are different with it just in two fuzzy rules. To generate neighboring models for the current model, we apply specially designed split and merge operations. By each split operation, a fuzzy rule is replaced with two rules; while by each merge operation, two fuzzy rules combine to one rule. Among neighboring models, the one with the minimum sum of squared errors – on certain time intervals – replaces the current model.To reduce the computational load of the proposed evolving TS model, straightforward relations between outputs of neighboring models and that of current model are established. Also, to reduce the number of rules, we define and use first-order TS fuzzy models whose generated local linear models can be localized in flexible fuzzy subspaces. To demonstrate the improved performance of the proposed identification approach, the efficiency of the evolving TS model is studied in prediction of monthly sunspot number and forecast of daily electrical power consumption. The prediction and modeling results are compared with that of some important existing evolving fuzzy systems.     

Petrophysical data prediction from seismic attributes using committee fuzzy inference system

This study presents an intelligent model based on fuzzy systems for making a quantitative formulation between seismic attributes and petrophysical data. The proposed methodology comprises two major steps. Firstly, the petrophysical data, including water saturation (S_w) and porosity, are predicted from seismic attributes using various fuzzy inference systems (FISs), including Sugeno (SFIS), Mamdani (MFIS) and Larsen (LFIS). Secondly, a committee fuzzy inference system (CFIS) is constructed using a hybrid genetic algorithms-pattern search (GA-PS) technique. The inputs of the CFIS model are the outputs and averages of the FIS petrophysical data. The methodology is illustrated using 3D seismic and petrophysical data of 11 wells of an Iranian offshore oil field in the Persian Gulf. The performance of the CFIS model is compared with a probabilistic neural network (PNN). The results show that the CFIS method performed better than neural network, the best individual fuzzy model and a simple averaging method.