Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

6341,2671,9012,534 · Jun 202019922001200920172026
48 results for Valence and Arousal

Project uses GANs to recognize facial expressions and emotions from-the-wild with dual model approach.

problem Facial expression and emotion recognition in real-world scenarios.
method Created a dual GAN model architecture for Action Units and Valence Arousal annotations.
result Dual GAN model achieved better results than single model for emotion recognition.

Aff-Wild database expands facial expression recognition to real-world conditions.

problem Lack of spontaneous facial expression databases in real-world conditions.
method Collects spontaneous facial expressions from YouTube, annotates with valence and arousal, uses deep learning techniques.
result Developed an end-to-end DNN model achieving 0.555 CCC for valence and 0.499 CCC for arousal.

We consider the task of multimodal music mood prediction based on the audio signal and the lyrics of a track. We reproduce the implementation of traditional feature engineering based approaches and propose a new model based on deep learning. We compare the performance of both approaches on a database containing 18,000 …

2018-09-19abs ↗pdf ↗

New model recognizes emotions with missing modalities, improving accuracy.

problem Handling missing modalities in emotion recognition.
method Transformer-based architecture with cross-attention and self-attention mechanisms.
result Improvement of 37% in predicting arousal values and 30% in valence values compared to baseline.

In this research, an emotion recognition system is developed based on valence/arousal model using electroencephalography (EEG) signals. EEG signals are decomposed into the gamma, beta, alpha and theta frequency bands using discrete wavelet transform (DWT), and spectral features are extracted from each frequency band. P…

2019-03-18abs ↗pdf ↗

Project extends emotion recognition database and trains neural networks for categorical and dimensional emotions.

problem Understanding and recognizing emotions for human-computer interaction, safety, and medical research.
method Training CNN + RNN models with emotion category and valence/arousal representations, comparing three model types.
result Categorical emotion recognition performance improves with combined model training.

This short paper describes our solution to the 2018 IEEE World Congress on Computational Intelligence One-Minute Gradual-Emotional Behavior Challenge, whose goal was to estimate continuous arousal and valence values from short videos. We designed four base regression models using visual and audio features, and then use…

2018-04-30abs ↗pdf ↗

In this paper we propose a fusion approach to continuous emotion recognition that combines visual and auditory modalities in their representation spaces to predict the arousal and valence levels. The proposed approach employs a pre-trained convolution neural network and transfer learning to extract features from video …

2019-06-25abs ↗pdf ↗

This paper describes audEERING's submissions as well as additional evaluations for the One-Minute-Gradual (OMG) emotion recognition challenge. We provide the results for audio and video processing on subject (in)dependent evaluations. On the provided Development set, we achieved 0.343 Concordance Correlation Coefficien…

2018-05-03abs ↗pdf ↗

First ABAW 2020 Competition analyzes affective behavior tasks.

problem Automatic analysis of valence-arousal, basic expressions, and action units in real-world scenarios.
method Provided Aff-Wild2 database, described Challenges, evaluation metrics, and top-performing systems.
result Demonstrated the feasibility of automatic affective behavior analysis in real-world settings.

Model improves emotion recognition using multiple physiological signals.

problem Single physiological signal is insufficient for accurate emotion recognition.
method Fused multiple modal physiological signals (EEG, EMG, EOG) for emotion classification.
result Best classification accuracy of 94.42% on arousal and 94.02% on valence in two-class tasks.

Study uses simulation-based inference to decode brain activity from synthetic stimuli.

problem Reversing the process of brain activity emulation to recover stimuli or their properties.
method Pairing brain emulator with LLMs to learn a probabilistic mapping from brain maps to stimulus parameters.
result LLMs can serve as controllable stimulus generators and parameters can be recovered from brain maps.

Sleep arousals transition the depth of sleep to a more superficial stage. The occurrence of such events is often considered as a protective mechanism to alert the body of harmful stimuli. Thus, accurate sleep arousal detection can lead to an enhanced understanding of the underlying causes and influencing the assessment…

2019-03-01abs ↗pdf ↗

Generative model combines multi-dimensional annotations for more accurate ground truth estimation.

problem Inaccurate ground truth estimation from naive annotators' multi-dimensional annotations.
method Proposes a joint multi-dimensional model for global and time-series annotation fusion using Expectation-Maximization algorithm.
result More accurate ground truth estimates through joint modeling of multiple dimensions.

Time-continuous dimensional descriptions of emotions (e.g., arousal, valence) allow researchers to characterize short-time changes and to capture long-term trends in emotion expression. However, continuous emotion labels are generally not synchronized with the input speech signal due to delays caused by reaction-time, …

2019-07-05abs ↗pdf ↗

This research improves EEG-based MI-BCI systems to be more resilient to emotional arousal.

problem Lack of robustness in EEG-based MI-BCI systems due to emotional arousal.
method Subjects were exposed to VR environments to induce high and low arousal states. Machine learning models were trained on proxy subjects instead of arousal states. MI models were trained for each subject.
result MI-BCI systems are made more resilient to emotional perturbations.

We study triangulations T\cal T defined on a closed disc XX satisfying the following condition: In the interior of XX, the valence of all vertices of T\cal T except one of them (the irregular vertex) is 66. By using a flat singular Riemannian metric adapted to T\cal T, we prove a uniqueness theorem when the valen…

2018-02-16abs ↗pdf ↗

We discuss the existence of Killing tensors for certain (physically motivated) stationary and axially symmetric vacuum space-times. We show nonexistence of a nontrivial Killing tensor for a Tomimatsu-Sato metric (up to valence 7), for a C-metric (up to valence 9) and for a Zipoy-Voorhees metric (up to valence 11). The …

2016-02-29abs ↗pdf ↗

Objective: The aim of this study is to develop an automated classification algorithm for polysomnography (PSG) recordings to detect non-apneic and non-hypopneic arousals. Our particular focus is on detecting the respiratory effort-related arousals (RERAs) which are very subtle respiratory events that do not meet the cr…

2019-09-06abs ↗pdf ↗

The study counts triangulations of a projective plane with specific vertex valencies.

problem Counting triangulations of a projective plane with unique vertex valencies.
method Analyzes the growth of triangulations with no more than n triangles, using complex mathematical functions and series.
result The number of triangulations grows as C·n^2 + O(n^3/2) with C ≈ 0.2087432125056015.

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1 vertices. The number of valence 1 vertices of the trees is called the girth of the kno…

2005-08-29abs ↗pdf ↗

Deep transfer learning boosts single-EEG arousal detection accuracy.

problem Challenges in machine learning due to channel mismatch across different EEG datasets.
method Transfer learning strategy to adapt a multivariate model to single-channel EEG data.
result Fine-tuned model achieves similar performance to baseline model and significantly outperforms a single-channel model.

Music FaderNets learns high-level musical qualities from low-level attributes.

problem Learning high-level musical qualities from limited data and subjective labels.
method Model low-level attributes through feature disentanglement and latent regularization; infer high-level features from low-level representations using GM-VAEs.
result Model successfully learns intrinsic relationships between high-level features and low-level attributes with minimal labeled data.

The valence of a function ff at a point ww is the number of distinct, finite solutions to f(z)=wf(z) = w. Let ff be a complex-valued harmonic function in an open set RCR \subseteq \mathbb{C}. Let SS denote the critical set of ff and C(f)C(f) the global cluster set of ff. We show that f(S)C(f)f(S) \cup C(f) partitions the com…

2004-01-26abs ↗pdf ↗

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

2011-08-20abs ↗pdf ↗

Automatic understanding of human affect using visual signals is a problem that has attracted significant interest over the past 20 years. However, human emotional states are quite complex. To appraise such states displayed in real-world settings, we need expressive emotional descriptors that are capable of capturing an…

2018-11-11abs ↗pdf ↗

It is well known that surface groups admit free and proper actions on finite products of infinite valence trees. In this note, we address the question of whether there can be a free and proper action on a finite product of bounded valence trees. We provide some obstructions and an arithmetic criterion for existence. Th…

2016-05-17abs ↗pdf ↗

An embedding of a graph into R3\mathbb{R}^3 is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding ff of a graph GG into R3\mathbb{R}^3 is free, if π1(R3f(G))π_1(\mathbb{R}^3-f(G)) is a free group. It was known that for any complete graph its linear embedding is always free.…

2014-09-24abs ↗pdf ↗

Automated prediction of valence, one key feature of a person's emotional state, from individuals' personal narratives may provide crucial information for mental healthcare (e.g. early diagnosis of mental diseases, supervision of disease course, etc.). In the Interspeech 2018 ComParE Self-Assessed Affect challenge, the …

2019-05-09abs ↗pdf ↗