| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–20] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Carlos Martin-Isla; Maryam Asadi-Aghbolaghi; Polyxeni Gkontra; Victor M. Campello; Sergio Escalera; Karim Lekadir | ||||
| Title | Stacked BCDU-net with semantic CMR synthesis: application to Myocardial Pathology Segmentation challenge | Type | Conference Article | ||
| Year | 2020 | Publication | MYOPS challenge and workshop | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
Address  |
Virtual; October 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | MICCAIW | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ MAG2020 | Serial | 3518 | ||
| Permanent link to this record | |||||
| Author | Mariona Caros; Maite Garolera; Petia Radeva; Xavier Giro | ||||
| Title | Automatic Reminiscence Therapy for Dementia | Type | Conference Article | ||
| Year | 2020 | Publication | 10th ACM International Conference on Multimedia Retrieval | Abbreviated Journal | |
| Volume | Issue | Pages | 383-387 | ||
| Keywords | |||||
| Abstract | With people living longer than ever, the number of cases with dementia such as Alzheimer's disease increases steadily. It affects more than 46 million people worldwide, and it is estimated that in 2050 more than 100 million will be affected. While there are not effective treatments for these terminal diseases, therapies such as reminiscence, that stimulate memories from the past are recommended. Currently, reminiscence therapy takes place in care homes and is guided by a therapist or a carer. In this work, we present an AI-based solution to automatize the reminiscence therapy, which consists in a dialogue system that uses photos as input to generate questions. We run a usability case study with patients diagnosed of mild cognitive impairment that shows they found the system very entertaining and challenging. Overall, this paper presents how reminiscence therapy can be automatized by using machine learning, and deployed to smartphones and laptops, making the therapy more accessible to every person affected by dementia. | ||||
| Address |
Virtual; October 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICRM | ||
| Notes | Approved | no | |||
| Call Number | Admin @ si @ CGR2020 | Serial | 3529 | ||
| Permanent link to this record | |||||
| Author | Jose Elias Yauri; Aura Hernandez-Sabate; Pau Folch; Debora Gil | ||||
| Title | Mental Workload Detection Based on EEG Analysis | Type | Conference Article | ||
| Year | 2021 | Publication | Artificial Intelligent Research and Development. Proceedings 23rd International Conference of the Catalan Association for Artificial Intelligence. | Abbreviated Journal | |
| Volume | 339 | Issue | Pages | 268-277 | |
| Keywords | Cognitive states; Mental workload; EEG analysis; Neural Networks. | ||||
| Abstract | The study of mental workload becomes essential for human work efficiency, health conditions and to avoid accidents, since workload compromises both performance and awareness. Although workload has been widely studied using several physiological measures, minimising the sensor network as much as possible remains both a challenge and a requirement.
Electroencephalogram (EEG) signals have shown a high correlation to specific cognitive and mental states like workload. However, there is not enough evidence in the literature to validate how well models generalize in case of new subjects performing tasks of a workload similar to the ones included during model’s training. In this paper we propose a binary neural network to classify EEG features across different mental workloads. Two workloads, low and medium, are induced using two variants of the N-Back Test. The proposed model was validated in a dataset collected from 16 subjects and shown a high level of generalization capability: model reported an average recall of 81.81% in a leave-one-out subject evaluation. |
||||
| Address |
Virtual; October 20-22 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CCIA | ||
| Notes | IAM; 600.139; 600.118; 600.145 | Approved | no | ||
| Call Number | Admin @ si @ | Serial | 3723 | ||
| Permanent link to this record | |||||
| Author | Shiqi Yang; Yaxing Wang; Kai Wang; Shangling Jui; Joost Van de Weijer | ||||
| Title | Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation | Type | Conference Article | ||
| Year | 2022 | Publication | 36th Conference on Neural Information Processing Systems | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | We propose a simple but effective source-free domain adaptation (SFDA) method.
Treating SFDA as an unsupervised clustering problem and following the intuition that local neighbors in feature space should have more similar predictions than other features, we propose to optimize an objective of prediction consistency. This objective encourages local neighborhood features in feature space to have similar predictions while features farther away in feature space have dissimilar predictions, leading to efficient feature clustering and cluster assignment simultaneously. For efficient training, we seek to optimize an upper-bound of the objective resulting in two simple terms. Furthermore, we relate popular existing methods in domain adaptation, source-free domain adaptation and contrastive learning via the perspective of discriminability and diversity. The experimental results prove the superiority of our method, and our method can be adopted as a simple but strong baseline for future research in SFDA. Our method can be also adapted to source-free open-set and partial-set DA which further shows the generalization ability of our method. |
||||
| Address |
Virtual; November 2022 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | NEURIPS | ||
| Notes | LAMP; 600.147 | Approved | no | ||
| Call Number | Admin @ si @ YWW2022a | Serial | 3792 | ||
| Permanent link to this record | |||||
| Author | Graham D. Finlayson; Javier Vazquez; Fufu Fang | ||||
| Title | The Discrete Cosine Maximum Ignorance Assumption | Type | Conference Article | ||
| Year | 2021 | Publication | 29th Color and Imaging Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 13-18 | ||
| Keywords | |||||
| Abstract | the performance of colour correction algorithms are dependent on the reflectance sets used. Sometimes, when the testing reflectance set is changed the ranking of colour correction algorithms also changes. To remove dependence on dataset we can
make assumptions about the set of all possible reflectances. In the Maximum Ignorance with Positivity (MIP) assumption we assume that all reflectances with per wavelength values between 0 and 1 are equally likely. A weakness in the MIP is that it fails to take into account the correlation of reflectance functions between wavelengths (many of the assumed reflectances are, in reality, not possible). In this paper, we take the view that the maximum ignorance assumption has merit but, hitherto it has been calculated with respect to the wrong coordinate basis. Here, we propose the Discrete Cosine Maximum Ignorance assumption (DCMI), where all reflectances that have coordinates between max and min bounds in the Discrete Cosine Basis coordinate system are equally likely. Here, the correlation between wavelengths is encoded and this results in the set of all plausible reflectances ’looking like’ typical reflectances that occur in nature. This said the DCMI model is also a superset of all measured reflectance sets. Experiments show that, in colour correction, adopting the DCMI results in similar colour correction performance as using a particular reflectance set. |
||||
| Address |
Virtual; November 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CIC | ||
| Notes | CIC | Approved | no | ||
| Call Number | FVF2021 | Serial | 3596 | ||
| Permanent link to this record | |||||
| Author | Pau Torras; Arnau Baro; Lei Kang; Alicia Fornes | ||||
| Title | On the Integration of Language Models into Sequence to Sequence Architectures for Handwritten Music Recognition | Type | Conference Article | ||
| Year | 2021 | Publication | International Society for Music Information Retrieval Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 690-696 | ||
| Keywords | |||||
| Abstract | Despite the latest advances in Deep Learning, the recognition of handwritten music scores is still a challenging endeavour. Even though the recent Sequence to Sequence(Seq2Seq) architectures have demonstrated its capacity to reliably recognise handwritten text, their performance is still far from satisfactory when applied to historical handwritten scores. Indeed, the ambiguous nature of handwriting, the non-standard musical notation employed by composers of the time and the decaying state of old paper make these scores remarkably difficult to read, sometimes even by trained humans. Thus, in this work we explore the incorporation of language models into a Seq2Seq-based architecture to try to improve transcriptions where the aforementioned unclear writing produces statistically unsound mistakes, which as far as we know, has never been attempted for this field of research on this architecture. After studying various Language Model integration techniques, the experimental evaluation on historical handwritten music scores shows a significant improvement over the state of the art, showing that this is a promising research direction for dealing with such difficult manuscripts. | ||||
| Address |
Virtual; November 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ISMIR | ||
| Notes | DAG; 600.140; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ TBK2021 | Serial | 3616 | ||
| Permanent link to this record | |||||
| Author | Yi Xiao; Felipe Codevilla; Christopher Pal; Antonio Lopez | ||||
| Title | Action-Based Representation Learning for Autonomous Driving | Type | Conference Article | ||
| Year | 2020 | Publication | Conference on Robot Learning | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Human drivers produce a vast amount of data which could, in principle, be used to improve autonomous driving systems. Unfortunately, seemingly straightforward approaches for creating end-to-end driving models that map sensor data directly into driving actions are problematic in terms of interpretability, and typically have significant difficulty dealing with spurious correlations. Alternatively, we propose to use this kind of action-based driving data for learning representations. Our experiments show that an affordance-based driving model pre-trained with this approach can leverage a relatively small amount of weakly annotated imagery and outperform pure end-to-end driving models, while being more interpretable. Further, we demonstrate how this strategy outperforms previous methods based on learning inverse dynamics models as well as other methods based on heavy human supervision (ImageNet). | ||||
| Address |
virtual; November 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CORL | ||
| Notes | ADAS; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ XCP2020 | Serial | 3487 | ||
| Permanent link to this record | |||||
| Author | Albert Clapes; Julio C. S. Jacques Junior; Carla Morral; Sergio Escalera | ||||
| Title | ChaLearn LAP 2020 Challenge on Identity-preserved Human Detection: Dataset and Results | Type | Conference Article | ||
| Year | 2020 | Publication | 15th IEEE International Conference on Automatic Face and Gesture Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 801-808 | ||
| Keywords | |||||
| Abstract | This paper summarizes the ChaLearn Looking at People 2020 Challenge on Identity-preserved Human Detection (IPHD). For the purpose, we released a large novel dataset containing more than 112K pairs of spatiotemporally aligned depth and thermal frames (and 175K instances of humans) sampled from 780 sequences. The sequences contain hundreds of non-identifiable people appearing in a mix of in-the-wild and scripted scenarios recorded in public and private places. The competition was divided into three tracks depending on the modalities exploited for the detection: (1) depth, (2) thermal, and (3) depth-thermal fusion. Color was also captured but only used to facilitate the groundtruth annotation. Still the temporal synchronization of three sensory devices is challenging, so bad temporal matches across modalities can occur. Hence, the labels provided should considered “weak”, although test frames were carefully selected to minimize this effect and ensure the fairest comparison of the participants’ results. Despite this added difficulty, the results got by the participants demonstrate current fully-supervised methods can deal with that and achieve outstanding detection performance when measured in terms of AP@0.50. | ||||
| Address |
Virtual; November 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | FG | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ CJM2020 | Serial | 3501 | ||
| Permanent link to this record | |||||
| Author | Ciprian Corneanu; Meysam Madadi; Sergio Escalera; Aleix Martinez | ||||
| Title | Explainable Early Stopping for Action Unit Recognition | Type | Conference Article | ||
| Year | 2020 | Publication | Faces and Gestures in E-health and welfare workshop | Abbreviated Journal | |
| Volume | Issue | Pages | 693-699 | ||
| Keywords | |||||
| Abstract | A common technique to avoid overfitting when training deep neural networks (DNN) is to monitor the performance in a dedicated validation data partition and to stop
training as soon as it saturates. This only focuses on what the model does, while completely ignoring what happens inside it. In this work, we open the “black-box” of DNN in order to perform early stopping. We propose to use a novel theoretical framework that analyses meso-scale patterns in the topology of the functional graph of a network while it trains. Based on it, we decide when it transitions from learning towards overfitting in a more explainable way. We exemplify the benefits of this approach on a state-of-the art custom DNN that jointly learns local representations and label structure employing an ensemble of dedicated subnetworks. We show that it is practically equivalent in performance to early stopping with patience, the standard early stopping algorithm in the literature. This proves beneficial for AU recognition performance and provides new insights into how learning of AUs occurs in DNNs. |
||||
| Address |
Virtual; November 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | FGW | ||
| Notes | HUPBA; | Approved | no | ||
| Call Number | Admin @ si @ CME2020 | Serial | 3514 | ||
| Permanent link to this record | |||||
| Author | Anna Esposito; Terry Amorese; Nelson Maldonato; Alessandro Vinciarelli; Maria Ines Torres; Sergio Escalera; Gennaro Cordasco | ||||
| Title | Seniors’ ability to decode differently aged facial emotional expressions | Type | Conference Article | ||
| Year | 2020 | Publication | Faces and Gestures in E-health and welfare workshop | Abbreviated Journal | |
| Volume | Issue | Pages | 716-722 | ||
| Keywords | |||||
| Abstract | |||||
| Address |
Virtual; November 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | FGW | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ EAM2020 | Serial | 3515 | ||
| Permanent link to this record | |||||
| Author | Anna Esposito; Italia Cirillo; Antonietta Esposito; Leopoldina Fortunati; Gian Luca Foresti; Sergio Escalera; Nikolaos Bourbakis | ||||
| Title | Impairments in decoding facial and vocal emotional expressions in high functioning autistic adults and adolescents | Type | Conference Article | ||
| Year | 2020 | Publication | Faces and Gestures in E-health and welfare workshop | Abbreviated Journal | |
| Volume | Issue | Pages | 667-674 | ||
| Keywords | |||||
| Abstract | |||||
| Address |
Virtual; November 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | FGW | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ ECE2020 | Serial | 3516 | ||
| Permanent link to this record | |||||
| Author | Josep Famadas; Meysam Madadi; Cristina Palmero; Sergio Escalera | ||||
| Title | Generative Video Face Reenactment by AUs and Gaze Regularization | Type | Conference Article | ||
| Year | 2020 | Publication | 15th IEEE International Conference on Automatic Face and Gesture Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 444-451 | ||
| Keywords | |||||
| Abstract | In this work, we propose an encoder-decoder-like architecture to perform face reenactment in image sequences. Our goal is to transfer the training subject identity to a given test subject. We regularize face reenactment by facial action unit intensity and 3D gaze vector regression. This way, we enforce the network to transfer subtle facial expressions and eye dynamics, providing a more lifelike result. The proposed encoder-decoder receives as input the previous sequence frame stacked to the current frame image of facial landmarks. Thus, the generated frames benefit from appearance and geometry, while keeping temporal coherence for the generated sequence. At test stage, a new target subject with the facial performance of the source subject and the appearance of the training subject is reenacted. Principal component analysis is applied to project the test subject geometry to the closest training subject geometry before reenactment. Evaluation of our proposal shows faster convergence, and more accurate and realistic results in comparison to other architectures without action units and gaze regularization. | ||||
| Address |
Virtual; November 2020 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | FG | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ FMP2020 | Serial | 3517 | ||
| Permanent link to this record | |||||
| Author | Saiping Zhang; Luis Herranz; Marta Mrak; Marc Gorriz Blanch; Shuai Wan; Fuzheng Yang | ||||
| Title | DCNGAN: A Deformable Convolution-Based GAN with QP Adaptation for Perceptual Quality Enhancement of Compressed Video | Type | Conference Article | ||
| Year | 2022 | Publication | 47th International Conference on Acoustics, Speech, and Signal Processing | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | In this paper, we propose a deformable convolution-based generative adversarial network (DCNGAN) for perceptual quality enhancement of compressed videos. DCNGAN is also adaptive to the quantization parameters (QPs). Compared with optical flows, deformable convolutions are more effective and efficient to align frames. Deformable convolutions can operate on multiple frames, thus leveraging more temporal information, which is beneficial for enhancing the perceptual quality of compressed videos. Instead of aligning frames in a pairwise manner, the deformable convolution can process multiple frames simultaneously, which leads to lower computational complexity. Experimental results demonstrate that the proposed DCNGAN outperforms other state-of-the-art compressed video quality enhancement algorithms. | ||||
| Address |
Virtual; May 2022 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICASSP | ||
| Notes | MACO; 600.161; 601.379 | Approved | no | ||
| Call Number | Admin @ si @ ZHM2022a | Serial | 3765 | ||
| Permanent link to this record | |||||
| Author | Bartlomiej Twardowski; Pawel Zawistowski; Szymon Zaborowski | ||||
| Title | Metric Learning for Session-Based Recommendations | Type | Conference Article | ||
| Year | 2021 | Publication | 43rd edition of the annual BCS-IRSG European Conference on Information Retrieval | Abbreviated Journal | |
| Volume | 12656 | Issue | Pages | 650-665 | |
| Keywords | Session-based recommendations; Deep metric learning; Learning to rank | ||||
| Abstract | Session-based recommenders, used for making predictions out of users’ uninterrupted sequences of actions, are attractive for many applications. Here, for this task we propose using metric learning, where a common embedding space for sessions and items is created, and distance measures dissimilarity between the provided sequence of users’ events and the next action. We discuss and compare metric learning approaches to commonly used learning-to-rank methods, where some synergies exist. We propose a simple architecture for problem analysis and demonstrate that neither extensively big nor deep architectures are necessary in order to outperform existing methods. The experimental results against strong baselines on four datasets are provided with an ablation study. | ||||
| Address |
Virtual; March 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ECIR | ||
| Notes | LAMP; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ TZZ2021 | Serial | 3586 | ||
| Permanent link to this record | |||||
| Author | Ruben Tito; Minesh Mathew; C.V. Jawahar; Ernest Valveny; Dimosthenis Karatzas | ||||
| Title | ICDAR 2021 Competition on Document Visual Question Answering | Type | Conference Article | ||
| Year | 2021 | Publication | 16th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 635-649 | ||
| Keywords | |||||
| Abstract | In this report we present results of the ICDAR 2021 edition of the Document Visual Question Challenges. This edition complements the previous tasks on Single Document VQA and Document Collection VQA with a newly introduced on Infographics VQA. Infographics VQA is based on a new dataset of more than 5, 000 infographics images and 30, 000 question-answer pairs. The winner methods have scored 0.6120 ANLS in Infographics VQA task, 0.7743 ANLSL in Document Collection VQA task and 0.8705 ANLS in Single Document VQA. We present a summary of the datasets used for each task, description of each of the submitted methods and the results and analysis of their performance. A summary of the progress made on Single Document VQA since the first edition of the DocVQA 2020 challenge is also presented. | ||||
| Address |
VIRTUAL; Lausanne; Suissa; September 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ TMJ2021 | Serial | 3624 | ||
| Permanent link to this record | |||||