scholarly journals Mapping Discrete Emotions in the Dimensional Space: An Acoustic Approach

Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 2950
Author(s):  
Marián Trnka ◽  
Sakhia Darjaa ◽  
Marian Ritomský ◽  
Róbert Sabo ◽  
Milan Rusko ◽  
...  
Keyword(s):  
Dimensional Space ◽  
Speech Sound ◽  
Semantic Content ◽  
Training Data ◽  
Support Vector ◽  
Circumplex Model ◽  
Practical Applications ◽  
Additional Information ◽  
Unseen Data ◽  
Data Clusters

A frequently used procedure to examine the relationship between categorical and dimensional descriptions of emotions is to ask subjects to place verbal expressions representing emotions in a continuous multidimensional emotional space. This work chooses a different approach. It aims at creating a system predicting the values of Activation and Valence (AV) directly from the sound of emotional speech utterances without the use of its semantic content or any other additional information. The system uses X-vectors to represent sound characteristics of the utterance and Support Vector Regressor for the estimation the AV values. The system is trained on a pool of three publicly available databases with dimensional annotation of emotions. The quality of regression is evaluated on the test sets of the same databases. Mapping of categorical emotions to the dimensional space is tested on another pool of eight categorically annotated databases. The aim of the work was to test whether in each unseen database the predicted values of Valence and Activation will place emotion-tagged utterances in the AV space in accordance with expectations based on Russell’s circumplex model of affective space. Due to the great variability of speech data, clusters of emotions create overlapping clouds. Their average location can be represented by centroids. A hypothesis on the position of these centroids is formulated and evaluated. The system’s ability to separate the emotions is evaluated by measuring the distance of the centroids. It can be concluded that the system works as expected and the positions of the clusters follow the hypothesized rules. Although the variance in individual measurements is still very high and the overlap of emotion clusters is large, it can be stated that the AV coordinates predicted by the system lead to an observable separation of the emotions in accordance with the hypothesis. Knowledge from training databases can therefore be used to predict AV coordinates of unseen data of various origins. This could be used to detect high levels of stress or depression. With the appearance of more dimensionally annotated training data, the systems predicting emotional dimensions from speech sound will become more robust and usable in practical applications in call-centers, avatars, robots, information-providing systems, security applications, and the like.

Keyboard Characters Recognition with Support Vector Machine

2013 ◽  
Vol 336-338 ◽  
pp. 2283-2287
Author(s):  
Xin Wen Gao ◽  
Xing Jian Guan ◽  
Ben Bo Guan
Keyword(s):  
Support Vector Machine ◽  
Feature Extraction ◽  
Dimensional Space ◽  
Training Data ◽  
Support Vector ◽  
Inspection System ◽  
Higher Dimensional ◽  
Key Technologies ◽  
Recognition Function ◽  
The Difference

This paper proposed a method to detect the defects of keyboard characters. The work, which is a part of the keyboard inspection system, integrates two key technologies to realize the recognition function. First, Feature extraction is applied to select the best properties of the keyboard characters to distinguish the difference and six features are chosen. Second, we integrate support vector machine (SVM) into the classification method and the radial basis kernel function is used to map the training data into higher dimensional space to facilitate the classification. We get a satisfied result in the classification finally which demonstrate the proposed approach is effective.

Classifying Lithofacies from Textural Features in Whole Core CT-Scan Images

2021 ◽  
pp. 1-17
Author(s):  
Kurdistan Chawshin ◽  
Carl F. Berg ◽  
Damiano Varagnolo ◽  
Andres Gonzalez ◽  
Zoya Heidari ◽  
...  
Keyword(s):  
Principal Component ◽  
Ct Images ◽  
Nondestructive Method ◽  
Training Data ◽  
Support Vector ◽  
Svm Classifier ◽  
Statistical Features ◽  
Data Set ◽  
Unseen Data ◽  
Core Description

Summary X-ray computerized tomography (CT) is a nondestructive method of providing information about the internal composition and structure of whole core reservoir samples. In this study we propose a method to classify lithology. The novelty of this method is that it uses statistical and textural information extracted from whole core CT images in a supervised learning environment. In the proposed approaches, first-order statistical features and textural grey-levelco-occurrence matrix (GLCM) features are extracted from whole core CT images. Here, two workflows are considered. In the first workflow, the extracted features are used to train a support vector machine (SVM) to classify lithofacies. In the second workflow, a principal component analysis (PCA) step is added before training with two purposes: first, to eliminate collinearity among the features and second, to investigate the amount of information needed to differentiate the analyzed images. Before extracting the statistical features, the images are preprocessed and decomposed using Haar mother wavelet decomposition schemes to enhance the texture and to acquire a set of detail images that are then used to compute the statistical features. The training data set includes lithological information obtained from core description. The approach is validated using the trained SVM and hybrid (PCA + SVM) classifiers to predict lithofacies in a set of unseen data. The obtained results show that the SVM classifier can predict some of the lithofacies with high accuracy (up to 91% recall), but it misclassifies, to some extent, similar lithofacies with similar grain size, texture, and transport properties. The SVM classifier captures the heterogeneity in the whole core CT images more accurately compared with the core description, indicating that the CT images provide additional high-resolution information not observed by manual core description. Further, the obtained prediction results add information on the similarity of the lithofacies classes. The prediction results using the hybrid classifier are worse than the SVM classifier, indicating that low-power components may contain information that is required to differentiate among various lithofacies.

scholarly journals Recurrent Kernel Machines: Computing with Infinite Echo State Networks

2012 ◽  
Vol 24 (1) ◽  
pp. 104-133 ◽  
Author(s):  
Michiel Hermans ◽  
Benjamin Schrauwen
Keyword(s):  
Neural Networks ◽  
Recurrent Neural Networks ◽  
Input Data ◽  
Dimensional Space ◽  
Theoretical Research ◽  
High Dimensional ◽  
Support Vector ◽  
Practical Applications ◽  
Echo State Networks ◽  
Vector Machines

Echo state networks (ESNs) are large, random recurrent neural networks with a single trained linear readout layer. Despite the untrained nature of the recurrent weights, they are capable of performing universal computations on temporal input data, which makes them interesting for both theoretical research and practical applications. The key to their success lies in the fact that the network computes a broad set of nonlinear, spatiotemporal mappings of the input data, on which linear regression or classification can easily be performed. One could consider the reservoir as a spatiotemporal kernel, in which the mapping to a high-dimensional space is computed explicitly. In this letter, we build on this idea and extend the concept of ESNs to infinite-sized recurrent neural networks, which can be considered recursive kernels that subsequently can be used to create recursive support vector machines. We present the theoretical framework, provide several practical examples of recursive kernels, and apply them to typical temporal tasks.

An improved one-class support vector machine classifier for outlier detection

2014 ◽  
Vol 229 (3) ◽  
pp. 580-588 ◽  
Author(s):  
Wenjuan An ◽  
Mangui Liang ◽  
He Liu
Keyword(s):  
Outlier Detection ◽  
Support Vector Machine Classifier ◽  
Dimensional Space ◽  
Classification Problem ◽  
Training Data ◽  
Support Vector ◽  
Svm Classifier ◽  
Higher Dimensional ◽  
Real World Datasets ◽  
One Class Classification

Outlier detection, as a type of one-class classification problem, is one of important research topics in data mining and machine learning. Its task is to identify sample points markedly deviating from the normal data. A reliable outlier detector needs to build a model which encloses the normal data tightly. In this paper, an improved one-class SVM (OC-SVM) classifier is proposed for outlier detection problems. We name this method OC-SVM with minimum within-class scatter (OC-WCSSVM), which exploits the inner-class structure of the training set via minimizing the within-class scatter of the training data. This can construct a more accurate hyperplane for outlier detection, such that the margin between the training data and the origin in a higher dimensional space is as large as possible, while at the same time the decision boundary around the normal data is as tight as possible. Experimental results on a synthetic dataset and 10 real-world datasets demonstrate that our proposed OC-WCSSVM algorithm is effective and superior to the compared algorithms.

scholarly journals A Neural Basis for the Implementation of Deep Learning and Arti cial Intelligence

2018 ◽  
Vol 7 (4.36) ◽  
pp. 444 ◽  
Author(s):  
Alan F. Smeaton ◽  
. .
Keyword(s):  
Machine Learning ◽  
Deep Learning ◽  
Training Data ◽  
Computer Architectures ◽  
Support Vector ◽  
Neural Basis ◽  
Mathematical Basis ◽  
Unseen Data ◽  
Vector Machines ◽  
Conventional Computer

One of the mathematical cornerstones of modern data ana-lytics is machine learning whereby we automatically learn subtle patterns which may be hidden in training data, we associate those patterns with outcomes and we apply these patterns to new and unseen data and make predictions about as yet unseen outcomes. This form of data analytics al-lows us to bring value to the huge volumes of data that is collected from people, from the environment, from commerce, from online activities, from scienti c experiments, from many other sources. The mathematical basis for this form of machine learning has led to tools like Support Vector Machines which have shown moderate e ectiveness and good e ciency in their implementation. Recently, however, these have been usurped by the emergence of deep learning based on convolutional neural networks. In this presentation we will examine the basis for why such deep net-works are remarkably successful and accurate, their similarity to ways in which the human brain is organised, and the challenges of implementing such deep networks on conventional computer architectures.  

scholarly journals Matrix sketching for supervised classification with imbalanced classes

2021 ◽  
Author(s):  
Roberta Falcone ◽  
Laura Anderlucci ◽  
Angela Montanari
Keyword(s):  
Supervised Classification ◽  
Dimensional Space ◽  
Real Data ◽  
Support Vector ◽  
Compression Technique ◽  
Linear Discriminant ◽  
Practical Applications ◽  
Under Sampling ◽  
Matrix Sketching ◽  
Imbalanced Classes

AbstractThe presence of imbalanced classes is more and more common in practical applications and it is known to heavily compromise the learning process. In this paper we propose a new method aimed at addressing this issue in binary supervised classification. Re-balancing the class sizes has turned out to be a fruitful strategy to overcome this problem. Our proposal performs re-balancing through matrix sketching. Matrix sketching is a recently developed data compression technique that is characterized by the property of preserving most of the linear information that is present in the data. Such property is guaranteed by the Johnson-Lindenstrauss’ Lemma (1984) and allows to embed an n-dimensional space into a reduced one without distorting, within an $$\epsilon $$ ϵ -size interval, the distances between any pair of points. We propose to use matrix sketching as an alternative to the standard re-balancing strategies that are based on random under-sampling the majority class or random over-sampling the minority one. We assess the properties of our method when combined with linear discriminant analysis (LDA), classification trees (C4.5) and Support Vector Machines (SVM) on simulated and real data. Results show that sketching can represent a sound alternative to the most widely used rebalancing methods.

Local and Regional Hour-Ahead Forecasts of Solar Irradiance with Training Data Selection and Support Vector Regression

2016 ◽  
Vol 136 (12) ◽  
pp. 898-907 ◽  
Author(s):  
Joao Gari da Silva Fonseca Junior ◽  
Hideaki Ohtake ◽  
Takashi Oozeki ◽  
Kazuhiko Ogimoto
Keyword(s):  
Support Vector Regression ◽  
Solar Irradiance ◽  
Training Data ◽  
Data Selection ◽  
Support Vector ◽  
Training Data Selection

Semi-supervised Multi-task Network For Image Aesthetic Assessment

2020 ◽  
Vol 2020 (8) ◽  
pp. 188-1-188-7
Author(s):  
Xiaoyu Xiang ◽  
Yang Cheng ◽  
Jianhang Chen ◽  
Qian Lin ◽  
Jan Allebach
Keyword(s):  
Neural Network ◽  
Semantic Content ◽  
Training Data ◽  
Score Distribution ◽  
Generalization Ability ◽  
Subjective Preference ◽  
Ranking Tasks

Image aesthetic assessment has always been regarded as a challenging task because of the variability of subjective preference. Besides, the assessment of a photo is also related to its style, semantic content, etc. Conventionally, the estimations of aesthetic score and style for an image are treated as separate problems. In this paper, we explore the inter-relatedness between the aesthetics and image style, and design a neural network that can jointly categorize image by styles and give an aesthetic score distribution. To this end, we propose a multi-task network (MTNet) with an aesthetic column serving as a score predictor and a style column serving as a style classifier. The angular-softmax loss is applied in training primary style classifiers to maximize the margin among classes in single-label training data; the semi-supervised method is applied to improve the network’s generalization ability iteratively. We combine the regression loss and classification loss in training aesthetic score. Experiments on the AVA dataset show the superiority of our network in both image attributes classification and aesthetic ranking tasks.

An Analog Circuit Fault Diagnosis Approach Based on Wavelet-based fractal analysis and Multiple Kernel SVM

2020 ◽  
Vol 13 ◽  
Author(s):  
Jianfeng Jiang
Keyword(s):  
Fault Diagnosis ◽  
Fractal Analysis ◽  
Analog Circuit ◽  
Training Data ◽  
Support Vector ◽  
Pass Filter ◽  
Multiple Kernel ◽  
Testing Data ◽  
Circuit Fault Diagnosis ◽  
Diagnosis Approach

Objective: In order to diagnose the analog circuit fault correctly, an analog circuit fault diagnosis approach on basis of wavelet-based fractal analysis and multiple kernel support vector machine (MKSVM) is presented in the paper. Methods: Time responses of the circuit under different faults are measured, and then wavelet-based fractal analysis is used to process the collected time responses for the purpose of generating features for the signals. Kernel principal component analysis (KPCA) is applied to reduce the features’ dimensionality. Afterwards, features are divided into training data and testing data. MKSVM with its multiple parameters optimized by chaos particle swarm optimization (CPSO) algorithm is utilized to construct an analog circuit fault diagnosis model based on the testing data. Results: The proposed analog diagnosis approach is revealed by a four opamp biquad high-pass filter fault diagnosis simulation. Conclusion: The approach outperforms other commonly used methods in the comparisons.

scholarly journals Automated Ventricular System Segmentation in Paediatric Patients Treated for Hydrocephalus Using Deep Learning Methods

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Michał Klimont ◽  
Mateusz Flieger ◽  
Jacek Rzeszutek ◽  
Joanna Stachera ◽  
Aleksandra Zakrzewska ◽  
...  
Keyword(s):  
Neural Network ◽  
Data Augmentation ◽  
Ct Images ◽  
Policy Transfer ◽  
Training Data ◽  
Intraobserver Variability ◽  
Practical Applications ◽  
Brain Scans ◽  
Rate Policy ◽  
Ct Brain

Hydrocephalus is a common neurological condition that can have traumatic ramifications and can be lethal without treatment. Nowadays, during therapy radiologists have to spend a vast amount of time assessing the volume of cerebrospinal fluid (CSF) by manual segmentation on Computed Tomography (CT) images. Further, some of the segmentations are prone to radiologist bias and high intraobserver variability. To improve this, researchers are exploring methods to automate the process, which would enable faster and more unbiased results. In this study, we propose the application of U-Net convolutional neural network in order to automatically segment CT brain scans for location of CSF. U-Net is a neural network that has proven to be successful for various interdisciplinary segmentation tasks. We optimised training using state of the art methods, including “1cycle” learning rate policy, transfer learning, generalized dice loss function, mixed float precision, self-attention, and data augmentation. Even though the study was performed using a limited amount of data (80 CT images), our experiment has shown near human-level performance. We managed to achieve a 0.917 mean dice score with 0.0352 standard deviation on cross validation across the training data and a 0.9506 mean dice score on a separate test set. To our knowledge, these results are better than any known method for CSF segmentation in hydrocephalic patients, and thus, it is promising for potential practical applications.

Sign in / Sign up

Export Citation Format

Share Document