Weighted Fisher Discriminant Analysis in the Input and Feature Spaces

Fisher Discriminant Analysis (FDA) is a subspace learning method which minimizes and maximizes the intra- and inter-class scatters of data, respectively. Although, in FDA, all the pairs of classes are treated the same way, some classes are closer than the others. Weighted FDA assigns weights to the pairs of classes to address this shortcoming of FDA. In this paper, we propose a cosine-weighted FDA as well as an automatically weighted FDA in which weights are found automatically. We also propose a weighted FDA in the feature space to establish a weighted kernel FDA for both existing and newly proposed weights. Our experiments on the ORL face recognition dataset show the effectiveness of the proposed weighting schemes.Comment: Accepted (to appear) in International Conference on Image Analysis and Recognition (ICIAR) 2020, Springe

Learning midlevel image features for natural scene and texture classification

This paper deals with coding of natural scenes in order to extract semantic information. We present a new scheme to project natural scenes onto a basis in which each dimension encodes statistically independent information. Basis extraction is performed by independent component analysis (ICA) applied to image patches culled from natural scenes. The study of the resulting coding units (coding filters) extracted from well-chosen categories of images shows that they adapt and respond selectively to discriminant features in natural scenes. Given this basis, we define global and local image signatures relying on the maximal activity of filters on the input image. Locally, the construction of the signature takes into account the spatial distribution of the maximal responses within the image. We propose a criterion to reduce the size of the space of representation for faster computation. The proposed approach is tested in the context of texture classification (111 classes), as well as natural scenes classification (11 categories, 2037 images). Using a common protocol, the other commonly used descriptors have at most 47.7% accuracy on average while our method obtains performances of up to 63.8%. We show that this advantage does not depend on the size of the signature and demonstrate the efficiency of the proposed criterion to select ICA filters and reduce the dimensio

Incorporating Rich Features into Deep Knowledge Tracing

The desire to follow student learning within intelligent tutoring systems in near real time has led to the development of several models anticipating the correctness of the next item as students work through an assignment. Such models have in- cluded Bayesian Knowledge Tracing (BKT), Performance Factors Analysis (PFA), and more recently with developments in Deep Learning, Deep Knowledge Tracing (DKT). The DKT model, based on the use of a recurrent neural network, exhibited promising results in paper [PBH+15]. Thus far, however, the model has only considered the knowledge components of the problems and correctness as input, neglecting the breadth of other features col- lected by computer-based learning platforms. This work seeks to improve upon the DKT model by incorporating more features at the problem-level and student-level. With this higher dimensional input, an adaption to the original DKT model struc- ture is also proposed, incorporating an Autoencoder network layer to convert the input into a low dimensional feature vector to reduce both the resource requirement and time needed to train. Experimental results show that our adapted DKT model, which includes more combinations of features, can effectively improve accuracy

Hyperspectral Dimensionality Reduction via Sequential Parametric Projection Pursuits for Automated Invasive Species Target Recognition

This thesis investigates the use of sequential parametric projection pursuits (SPPP) for hyperspectral dimensionality reduction and invasive species target recognition. The SPPP method is implemented in a top-down fashion, where hyperspectral bands are used to form an increasing number of smaller groups, with each group being projected onto a subspace of dimensionality one. Both supervised and unsupervised potential projections are investigated for their use in the SPPP method. Fisher?s linear discriminant analysis (LDA) is used as a potential supervised projection. Average, Gaussian-weighted average, and principal component analysis (PCA) are used as potential unsupervised projections. The Bhattacharyya distance is used as the SPPP performance index. The performance of the SPPP method is compared to two other currently used dimensionality reduction techniques, namely best spectral band selection (BSBS) and best wavelet coefficient selection (BWCS). The SPPP dimensionality reduction method is combined with a nearest mean classifier to form an automated target recognition (ATR) system. The ATR system is tested on two invasive species hyperspectral datasets: a terrestrial case study of Cogongrass versus Johnsongrass and an aquatic case study of Waterhyacinth versus American Lotus. For both case studies, the SPPP approach either outperforms or performs on par with the BSBS and BWCS methods in terms of classification accuracy; however, the SPPP approach requires significantly less computational time. For the Cogongrass and Waterhyacinth applications, the SPPP method results in overall classification accuracy in the mid to upper 90?s