Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Iwamura, Masakazu"'
Driver fatigue detection is increasingly recognized as critical for enhancing road safety. This study introduces a method for detecting driver fatigue using the SEED-VIG dataset, a well-established benchmark in EEG-based vigilance analysis. By employ
Externí odkaz:
http://arxiv.org/abs/2408.13929
Emotions are crucial in human life, influencing perceptions, relationships, behaviour, and choices. Emotion recognition using Electroencephalography (EEG) in the Brain-Computer Interface (BCI) domain presents significant challenges, particularly the
Externí odkaz:
http://arxiv.org/abs/2401.16878
Autor:
Maruyama, Mizuki, Ghose, Shuvozit, Inoue, Katsufumi, Roy, Partha Pratim, Iwamura, Masakazu, Yoshioka, Michifumi
In recent years, Word-level Sign Language Recognition (WSLR) research has gained popularity in the computer vision community, and thus various approaches have been proposed. Among these approaches, the method using I3D network achieves the highest re
Externí odkaz:
http://arxiv.org/abs/2106.15989
Autor:
Islam, Md. Rabiul, Sakamoto, Shuji, Yamada, Yoshihiro, Vargo, Andrew, Iwata, Motoi, Iwamura, Masakazu, Kise, Koichi
Reading analysis can give important information about a user's confidence and habits and can be used to construct feedback to improve a user's reading behavior. A lack of labeled data inhibits the effective application of fully-supervised Deep Learni
Externí odkaz:
http://arxiv.org/abs/2012.03598
In this paper, an end-to-end neural embedding system based on triplet loss and residual learning has been proposed for speech emotion recognition. The proposed system learns the embeddings from the emotional information of the speech utterances. The
Externí odkaz:
http://arxiv.org/abs/2010.06200
This paper proposes the first object counting method for omnidirectional images. Because conventional object counting methods cannot handle the distortion of omnidirectional images, we propose to process them using stereographic projection, which ena
Externí odkaz:
http://arxiv.org/abs/2008.12511
We propose a new finding $k$-minima algorithm and prove that its query complexity is $\mathcal{O}(\sqrt{kN})$, where $N$ is the number of data indices. Though the complexity is equivalent to that of an existing method, the proposed is simpler. The ma
Externí odkaz:
http://arxiv.org/abs/1907.03315
A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Pr\=usis and Vihrovs (SODA'19) showed how to construct faster quantum algorithms for the Traveling Salesman Problem and a few other NP-hard problems by combining in a novel way quantum sea
Externí odkaz:
http://arxiv.org/abs/1904.03581
Autor:
Iwamura, Masakazu
This article introduces publicly available datasets in scene text detection and recognition. The information is as of 2017.
Externí odkaz:
http://arxiv.org/abs/1812.05219
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.