9853981
Face recognition: A study in information fusion using fuzzy integral
We study two approaches to fuzzy information fusion for face recognition involving aggregation of local and global face information and a wavelet decomposition approach. The former is concerned with a fuzzy information fusion involving both feature-based (e.g., eye, nose, and mouth) and template-based (global face) approaches to face recognition. The latter is associated with fuzzy information fusion based on four subimages (that is approximation, horizontal, vertical, and diagonal detailed images) using wavelet decomposition method. Making use of these two approaches, we design classifiers based on the well-known fisherface method. We demonstrate that the proposed method comes with better performance when compared with other template-based techniques and shows substantial insensitivity to large variation in light direction and facial expression. The fusion of the individual classifiers is realized by means of the Choquet fuzzy integral. The experimental results produced for FERET face database with 600 frontal face images corresponding to 200 subjects quantifies the performance of the classifier and contrast it with some other approaches existing in the literature.
19471846
Fuzzy clustering with a knowledge-based guidance
Fuzzy clustering becomes a broadly accepted synonym of fundamental endeavors aimed at finding structures in multidimensional data. In essence, these methods operate in unsupervised mode. This means that they act upon data while being directed by some predefined objective function (criterion) for which they "discover" a structure (clusters) that yields a minimal value of this criterion. In this study, we discuss an issue of exploiting and effectively incorporating auxiliary problem dependent hints being available as a part of the domain knowledge associated with the pattern recognition problem at hand. As such hints are usually expressed by experts/data analysts at the level of clusters (information granules) rather than individual data (patterns), we refer to them as knowledge-based indicators and allude to a set of them as a knowledge-based guidance available to fuzzy clustering. The proposed paradigm shift in which fuzzy clustering incorporates this type of knowledge-based supervision is discussed and contrasted with the "pure" (that is data-driven) version of fuzzy clustering. Several fundamental categories of the guidance mechanisms are introduced and discussed, namely partial supervision, proximity-based guidance and uncertainty driven knowledge hints. The details on how the guidance machinery translates into updates of the partition matrices are presented. We also present a number of practical scenarios in which the role of knowledge hints becomes evident and highly justifiable. This concerns Web exploration, exploitation of labeled patterns, issues of incomplete feature spaces, and constraints of typicality of patterns, to name a few representative applications.
2982088
Fuzzy Aggregation Method Using Fisherface and Wavelet Decomposition for Face Recognition
31716066
The genetic development of ordinal sums
Abstract The aim of this study is to develop an operational model of an ordinal sum of triangular norms. The essence of this construct lies in the use of different t-norms (and/or t-conorms) defined over disjoint subintervals of the unit interval. The result of such aggregation is a highly versatile logic operator that can be easily adapted to the existing experimental evidence. We propose a genetic optimisation environment (Genetic Algorithms, GAs, in particular) to construct ordinal sums and show how the GA mechanism helps optimize subintervals and to allocate individual local t-norms. The application of the genetically designed ordinal sums is shown in case of Zimmermann–Zysno logic operator data. We also demonstrate the use of the ordinal sum to the construction of neuro-fuzzy systems; in this case we quantify the performance of ordinal sums to “standard” logic operators used in such models.
41324764
Rule-based multi-FNN identification with the aid of evolutionary fuzzy granulation
Abstract In this paper, we introduce a category of Multi-Fuzzy-Neural Networks (Multi-FNNs) models, analyze the underlying architectures and propose a comprehensive identification framework. The proposed Multi-FNNs are based on a concept of fuzzy rule-based FNNs that use H ard C - M eans (HCM) clustering and evolutionary fuzzy granulation and exploit linear inference being treated as a generic inference mechanism of approximate reasoning. By this nature, this FNN model is geared toward capturing relationships between information granules–fuzzy sets. The form of the information granules themselves (in particular their distribution and a type of membership functions) becomes an important design feature of the FNN model that contributes to its structural and parametric optimization. The genetically guided global optimization is then augmented by more refined gradient-based learning mechanisms such as a standard back-propagation. The HCM algorithm, whose role is to carry out preprocessing of the experimental data, is utilized to determine the structure of Multi-FNNs. The detailed parameters of the Multi-FNN (such as apexes of membership functions, learning rates, and momentum coefficients) are adjusted using genetic algorithms. The proposed aggregate performance index helps achieve a sound balance between approximation and generalization (predictive) abilities of the model. To evaluate an effectiveness of the introduced model, several numeric data sets are experimented with. Those include a time-series data of gas furnace, NOx emission process of gas turbine power plant and some synthetic data.
20379804
Hybrid Fuzzy Polynomial Neural Networks
We propose a hybrid architecture based on a combination of fuzzy systems and polynomial neural networks. The resulting Hybrid Fuzzy Polynomial Neural Networks (HFPNN) dwells on the ideas of fuzzy rule-based computing and polynomial neural networks. The structure of the network comprises of fuzzy polynomial neurons (FPNs) forming the nodes of the first (input) layer of the HFPNN and polynomial neurons (PNs) that are located in the consecutive layers of the network. In the FPN (that forms a fuzzy inference system), the generic rules assume the form "if A then y = P(x)" where A is a fuzzy relation in the condition space while P(x) is a polynomial standing in the conclusion part of the rule. The conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as constant, linear, quadratic, and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership functions are considered. Each PN of the network realizes a polynomial type of partial description (PD) of the mapping between input and out variables. HFPNN is a flexible neural architecture whose structure is based on the Group Method of Data Handling (GMDH) and developed through learning. In particular, the number of layers of the PNN is not fixed in advance but is generated in a dynamic way. The experimental part of the study involves two representative numerical examples such as chaotic time series and Box-Jenkins gas furnace data.
22511023
Fuzzy clustering with partial supervision
Presented here is a problem of fuzzy clustering with partial supervision, i.e., unsupervised learning completed in the presence of some labeled patterns. The classification information is incorporated additively as a part of an objective function utilized in the standard FUZZY ISODATA. The algorithms proposed in the paper embrace two specific learning scenarios of complete and incomplete class assignment of the labeled patterns. Numerical examples including both synthetic and real-world data arising in the realm of software engineering are also provided.
5269666
Conditional Fuzzy C-Means
A Fuzzy C-Means-based clustering method guided by an auxiliary (conditional) variable is introduced. The method reveals a structure within a family of patterns by considering their vicinity in a feature space along with the similarity of the values assumed by a certain conditional variable. The usefulness of the algorithm is exemplified in the problems of data mining.