Face recognition with image sets using manifold density divergence

In many automatic face recognition applications, a set of a person's face images is available rather than a single image. In this paper, we describe a novel method for face recognition using image sets. We propose a flexible, semi-parametric model for learning probability densities confined to highly non-linear but intrinsically low-dimensional manifolds. The model leads to a statistical formulation of the recognition problem in terms of minimizing the divergence between densities estimated on these manifolds. The proposed method is evaluated on a large data set, acquired in realistic imaging conditions with severe illumination variation. Our algorithm is shown to match the best and outperform other state-of-the-art algorithms in the literature, achieving 94% recognition rate on average.

Learning over sets using boosted manifold principal angles (BoMPA)

In this paper we address the problem of classifying vector sets. We motivate and introduce a novel method based on comparisons between corresponding vector subspaces. In particular, there are two main areas of novelty: (i) we extend the concept of principal angles between linear subspaces to manifolds with arbitrary nonlinearities; (ii) it is demonstrated how boosting can be used for application-optimal principal angle fusion. The strengths of the proposed method are empirically demonstrated on the task of automatic face recognition (AFR), in which it is shown to outperform state-of-the-art methods in the literature.

Learning aggregation weights from 3-tuple comparison sets

An important task in multiple-criteria decision making is how to learn the weights and parameters of an aggregation function from empirical data. We consider this in the context of quantifying ecological diversity, where such data is to be obtained as a set of pairwise comparisons specifying that one community should be considered more diverse than another. A problem that arises is how to collect a sufficient amount of data for reliable model determination without overloading individuals with the number of comparisons they need to make. After providing an algorithm for determining criteria weights and an overall ranking from such information, we then investigate the improvement in accuracy if ranked 3-tuples are supplied instead of pairs. We found that aggregation models could be determined accurately from significantly fewer 3-tuple comparisons than pairs. © 2013 IEEE.

Vector valued similarity measures for Atanassov's intuitionistic fuzzy sets

We present a new approach for defining similarity measures for Atanassov's intuitionistic fuzzy sets (AIFS), in which a similarity measure has two components indicating the similarity and hesitancy aspects. We justify that there are at least two facets of uncertainty of an AIFS, one of which is related to fuzziness while other is related to lack of knowledge or non-specificity. We propose a set of axioms and build families of similarity measures that avoid counterintuitive examples that are used to justify one similarity measure over another. We also investigate a relation to entropies of AIFS, and outline possible application of our method in decision making and image segmentation. © 2014 Elsevier Inc. All rights reserved.

Segmentation of gray scale image based on intuitionistic fuzzy sets constructed from several membership functions

Segmentation is the process of extraction of objects from an image. This paper proposes a new algorithm to construct intuitionistic fuzzy set (IFS) from multiple fuzzy sets as an application to image segmentation. Hesitation degree in IFS is formulated as the degree of ignorance (due to the lack of knowledge) to determine whether the chosen membership function is best for image segmentation. By minimizing entropy of IFS generated from various fuzzy sets, an image is thresholded. Experimental results are provided to show the effectiveness of the proposed method.

A study and a directory of energy consumption data sets of buildings

Energy consumption data are required to perform analysis, modelling, evaluation, and optimisation of energy usage in buildings. While a variety of energy consumption data sets have been examined and reported in the literature, there is a lack of a comprehensive categorisation and analysis of the available data sets. In this study, an overview of energy consumption data of buildings is provided. Three common strategies for generating energy consumption data, i.e., measurement, survey, and simulation, are described. A number of important characteristics pertaining to each strategy and the resulting data sets are discussed. In addition, a directory of energy consumption data sets of buildings is developed. The data sets are collected from either published papers or energy related organisations. The main contributions of this study include establishing a resource pertaining to energy consumption data sets and providing information related to the characteristics and availability of the respective data sets; therefore facilitating and promoting research activities in energy consumption data analysis.

On backwards and forwards reachable sets bounding for perturbed time-delay systems

Linear systems with interval time-varying delay and unknown-but-bounded disturbances are considered in this paper. We study the problem of finding outer bound of forwards reachable sets and inter bound of backwards reachable sets of the system. Firstly, two definitions on forwards and backwards reachable sets, where initial state vectors are not necessary to be equal to zero, are introduced. Then, by using the Lyapunov-Krasovskii method, two sufficient conditions for the existence of: (i) the smallest possible outer bound of forwards reachable sets; and (ii) the largest possible inter bound of backwards reachable sets, are derived. These conditions are presented in terms of linear matrix inequalities with two parameters need to tuned, which therefore can be efficiently solved by combining existing convex optimization algorithms with a two-dimensional search method to obtain optimal bounds. Lastly, the obtained results are illustrated by four numerical examples.