| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–11] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Guillermo Torres; Debora Gil; Antoni Rosell; S. Mena; Carles Sanchez | ||||
| Title | Virtual Radiomics Biopsy for the Histological Diagnosis of Pulmonary Nodules – Intermediate Results of the RadioLung Project | Type | Journal Article | ||
| Year | 2023 | Publication | International Journal of Computer Assisted Radiology and Surgery | Abbreviated Journal | IJCARS |
Volume  |
Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| 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 | |||
| Notes | IAM | Approved | no | ||
| Call Number | Admin @ si @ TGM2023 | Serial | 3830 | ||
| Permanent link to this record | |||||
| Author | Asma Bensalah; Antonio Parziale; Giuseppe De Gregorio; Angelo Marcelli; Alicia Fornes; Josep Llados | ||||
| Title | I Can’t Believe It’s Not Better: In-air Movement for Alzheimer Handwriting Synthetic Generation | Type | Conference Article | ||
| Year | 2023 | Publication | 21st International Graphonomics Conference | Abbreviated Journal | |
| Volume |
Issue | Pages | 136–148 | ||
| Keywords | |||||
| Abstract | During recent years, there here has been a boom in terms of deep learning use for handwriting analysis and recognition. One main application for handwriting analysis is early detection and diagnosis in the health field. Unfortunately, most real case problems still suffer a scarcity of data, which makes difficult the use of deep learning-based models. To alleviate this problem, some works resort to synthetic data generation. Lately, more works are directed towards guided data synthetic generation, a generation that uses the domain and data knowledge to generate realistic data that can be useful to train deep learning models. In this work, we combine the domain knowledge about the Alzheimer’s disease for handwriting and use it for a more guided data generation. Concretely, we have explored the use of in-air movements for synthetic data generation. | ||||
| Address | Evora; Portugal; October 2023 | ||||
| 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 | IGS | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ BPG2023 | Serial | 3838 | ||
| Permanent link to this record | |||||
| Author | Simone Zini; Alex Gomez-Villa; Marco Buzzelli; Bartlomiej Twardowski; Andrew D. Bagdanov; Joost Van de Weijer | ||||
| Title | Planckian Jitter: countering the color-crippling effects of color jitter on self-supervised training | Type | Conference Article | ||
| Year | 2023 | Publication | 11th International Conference on Learning Representations | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | Several recent works on self-supervised learning are trained by mapping different augmentations of the same image to the same feature representation. The data augmentations used are of crucial importance to the quality of learned feature representations. In this paper, we analyze how the color jitter traditionally used in data augmentation negatively impacts the quality of the color features in learned feature representations. To address this problem, we propose a more realistic, physics-based color data augmentation – which we call Planckian Jitter – that creates realistic variations in chromaticity and produces a model robust to illumination changes that can be commonly observed in real life, while maintaining the ability to discriminate image content based on color information. Experiments confirm that such a representation is complementary to the representations learned with the currently-used color jitter augmentation and that a simple concatenation leads to significant performance gains on a wide range of downstream datasets. In addition, we present a color sensitivity analysis that documents the impact of different training methods on model neurons and shows that the performance of the learned features is robust with respect to illuminant variations. | ||||
| Address | 1 -5 May 2023, Kigali, Ruanda | ||||
| 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 | ICLR | ||
| Notes | LAMP; 600.147; 611.008; 5300006 | Approved | no | ||
| Call Number | Admin @ si @ ZGB2023 | Serial | 3820 | ||
| Permanent link to this record | |||||
| Author | German Barquero; Sergio Escalera; Cristina Palmero | ||||
| Title | BeLFusion: Latent Diffusion for Behavior-Driven Human Motion Prediction | Type | Conference Article | ||
| Year | 2023 | Publication | IEEE/CVF International Conference on Computer Vision (ICCV) Workshops | Abbreviated Journal | |
| Volume |
Issue | Pages | 2317-2327 | ||
| Keywords | |||||
| Abstract | Stochastic human motion prediction (HMP) has generally been tackled with generative adversarial networks and variational autoencoders. Most prior works aim at predicting highly diverse movements in terms of the skeleton joints’ dispersion. This has led to methods predicting fast and motion-divergent movements, which are often unrealistic and incoherent with past motion. Such methods also neglect contexts that need to anticipate diverse low-range behaviors, or actions, with subtle joint displacements. To address these issues, we present BeLFusion, a model that, for the first time, leverages latent diffusion models in HMP to sample from a latent space where behavior is disentangled from pose and motion. As a result, diversity is encouraged from a behavioral perspective. Thanks to our behavior
coupler’s ability to transfer sampled behavior to ongoing motion, BeLFusion’s predictions display a variety of behaviors that are significantly more realistic than the state of the art. To support it, we introduce two metrics, the Area of the Cumulative Motion Distribution, and the Average Pairwise Distance Error, which are correlated to our definition of realism according to a qualitative study with 126 participants. Finally, we prove BeLFusion’s generalization power in a new cross-dataset scenario for stochastic HMP. |
||||
| Address | 2-6 October 2023. Paris (France) | ||||
| 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 | ICCV | ||
| Notes | HUPBA; no menciona | Approved | no | ||
| Call Number | Admin @ si @ BEP2023 | Serial | 3829 | ||
| Permanent link to this record | |||||
| Author | Benjia Zhou; Zhigang Chen; Albert Clapes; Jun Wan; Yanyan Liang; Sergio Escalera; Zhen Lei; Du Zhang | ||||
| Title | Gloss-free Sign Language Translation: Improving from Visual-Language Pretraining | Type | Conference Article | ||
| Year | 2023 | Publication | IEEE/CVF International Conference on Computer Vision (ICCV) Workshops | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | Sign Language Translation (SLT) is a challenging task due to its cross-domain nature, involving the translation of visual-gestural language to text. Many previous methods employ an intermediate representation, i.e., gloss sequences, to facilitate SLT, thus transforming it into a two-stage task of sign language recognition (SLR) followed by sign language translation (SLT). However, the scarcity of gloss-annotated sign language data, combined with the information bottleneck in the mid-level gloss representation, has hindered the further development of the SLT task. To address this challenge, we propose a novel Gloss-Free SLT based on Visual-Language Pretraining (GFSLT-VLP), which improves SLT by inheriting language-oriented prior knowledge from pre-trained models, without any gloss annotation assistance. Our approach involves two stages: (i) integrating Contrastive Language-Image Pre-training (CLIP) with masked self-supervised learning to create pre-tasks that bridge the semantic gap between visual and textual representations and restore masked sentences, and (ii) constructing an end-to-end architecture with an encoder-decoder-like structure that inherits the parameters of the pre-trained Visual Encoder and Text Decoder from the first stage. The seamless combination of these novel designs forms a robust sign language representation and significantly improves gloss-free sign language translation. In particular, we have achieved unprecedented improvements in terms of BLEU-4 score on the PHOENIX14T dataset (>+5) and the CSL-Daily dataset (>+3) compared to state-of-the-art gloss-free SLT methods. Furthermore, our approach also achieves competitive results on the PHOENIX14T dataset when compared with most of the gloss-based methods. | ||||
| Address | Vancouver; Canada; June 2023 | ||||
| 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 | ICCVW | ||
| Notes | HUPBA; | Approved | no | ||
| Call Number | Admin @ si @ ZCC2023 | Serial | 3839 | ||
| Permanent link to this record | |||||
| Author | Matthias Eisenmann; Annika Reinke; Vivienn Weru; Minu D. Tizabi; Fabian Isensee; Tim J. Adler; Sharib Ali; Vincent Andrearczyk; Marc Aubreville; Ujjwal Baid; Spyridon Bakas; Niranjan Balu; Sophia Bano; Jorge Bernal; Sebastian Bodenstedt; Alessandro Casella; Veronika Cheplygina; Marie Daum; Marleen de Bruijne | ||||
| Title | Why Is the Winner the Best? | Type | Conference Article | ||
| Year | 2023 | Publication | Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume |
Issue | Pages | 19955-19966 | ||
| Keywords | |||||
| Abstract | International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multi-center study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and postprocessing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work. | ||||
| Address | Vancouver; Canada; June 2023 | ||||
| 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 | CVPR | ||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ ERW2023 | Serial | 3842 | ||
| Permanent link to this record | |||||
| Author | Eduardo Aguilar; Bogdan Raducanu; Petia Radeva; Joost Van de Weijer | ||||
| Title | Continual Evidential Deep Learning for Out-of-Distribution Detection | Type | Conference Article | ||
| Year | 2023 | Publication | IEEE/CVF International Conference on Computer Vision (ICCV) Workshops -Visual Continual Learning workshop | Abbreviated Journal | |
| Volume |
Issue | Pages | 3444-3454 | ||
| Keywords | |||||
| Abstract | Uncertainty-based deep learning models have attracted a great deal of interest for their ability to provide accurate and reliable predictions. Evidential deep learning stands out achieving remarkable performance in detecting out-of-distribution (OOD) data with a single deterministic neural network. Motivated by this fact, in this paper we propose the integration of an evidential deep learning method into a continual learning framework in order to perform simultaneously incremental object classification and OOD detection. Moreover, we analyze the ability of vacuity and dissonance to differentiate between in-distribution data belonging to old classes and OOD data. The proposed method, called CEDL, is evaluated on CIFAR-100 considering two settings consisting of 5 and 10 tasks, respectively. From the obtained results, we could appreciate that the proposed method, in addition to provide comparable results in object classification with respect to the baseline, largely outperforms OOD detection compared to several posthoc methods on three evaluation metrics: AUROC, AUPR and FPR95. | ||||
| Address | Paris; France; October 2023 | ||||
| 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 | ICCVW | ||
| Notes | LAMP; MILAB | Approved | no | ||
| Call Number | Admin @ si @ ARR2023 | Serial | 3841 | ||
| Permanent link to this record | |||||
| Author | Roberto Morales; Juan Quispe; Eduardo Aguilar | ||||
| Title | Exploring multi-food detection using deep learning-based algorithms | Type | Conference Article | ||
| Year | 2023 | Publication | 13th International Conference on Pattern Recognition Systems | Abbreviated Journal | |
| Volume |
Issue | Pages | 1-7 | ||
| Keywords | |||||
| Abstract | People are becoming increasingly concerned about their diet, whether for disease prevention, medical treatment or other purposes. In meals served in restaurants, schools or public canteens, it is not easy to identify the ingredients and/or the nutritional information they contain. Currently, technological solutions based on deep learning models have facilitated the recording and tracking of food consumed based on the recognition of the main dish present in an image. Considering that sometimes there may be multiple foods served on the same plate, food analysis should be treated as a multi-class object detection problem. EfficientDet and YOLOv5 are object detection algorithms that have demonstrated high mAP and real-time performance on general domain data. However, these models have not been evaluated and compared on public food datasets. Unlike general domain objects, foods have more challenging features inherent in their nature that increase the complexity of detection. In this work, we performed a performance evaluation of Efficient-Det and YOLOv5 on three public food datasets: UNIMIB2016, UECFood256 and ChileanFood64. From the results obtained, it can be seen that YOLOv5 provides a significant difference in terms of both mAP and response time compared to EfficientDet in all datasets. Furthermore, YOLOv5 outperforms the state-of-the-art on UECFood256, achieving an improvement of more than 4% in terms of mAP@.50 over the best reported. | ||||
| Address | Guayaquil; Ecuador; July 2023 | ||||
| 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 | ICPRS | ||
| Notes | MILAB | Approved | no | ||
| Call Number | Admin @ si @ MQA2023 | Serial | 3843 | ||
| Permanent link to this record | |||||
| Author | Mohamed Ali Souibgui; Pau Torras; Jialuo Chen; Alicia Fornes | ||||
| Title | An Evaluation of Handwritten Text Recognition Methods for Historical Ciphered Manuscripts | Type | Conference Article | ||
| Year | 2023 | Publication | 7th International Workshop on Historical Document Imaging and Processing | Abbreviated Journal | |
| Volume |
Issue | Pages | 7-12 | ||
| Keywords | |||||
| Abstract | This paper investigates the effectiveness of different deep learning HTR families, including LSTM, Seq2Seq, and transformer-based approaches with self-supervised pretraining, in recognizing ciphered manuscripts from different historical periods and cultures. The goal is to identify the most suitable method or training techniques for recognizing ciphered manuscripts and to provide insights into the challenges and opportunities in this field of research. We evaluate the performance of these models on several datasets of ciphered manuscripts and discuss their results. This study contributes to the development of more accurate and efficient methods for recognizing historical manuscripts for the preservation and dissemination of our cultural heritage. | ||||
| Address | |||||
| 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 | HIP | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ STC2023 | Serial | 3849 | ||
| Permanent link to this record | |||||
| Author | Marwa Dhiaf; Mohamed Ali Souibgui; Kai Wang; Yuyang Liu; Yousri Kessentini; Alicia Fornes; Ahmed Cheikh Rouhou | ||||
| Title | CSSL-MHTR: Continual Self-Supervised Learning for Scalable Multi-script Handwritten Text Recognition | Type | Miscellaneous | ||
| Year | 2023 | Publication | Arxiv | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | Self-supervised learning has recently emerged as a strong alternative in document analysis. These approaches are now capable of learning high-quality image representations and overcoming the limitations of supervised methods, which require a large amount of labeled data. However, these methods are unable to capture new knowledge in an incremental fashion, where data is presented to the model sequentially, which is closer to the realistic scenario. In this paper, we explore the potential of continual self-supervised learning to alleviate the catastrophic forgetting problem in handwritten text recognition, as an example of sequence recognition. Our method consists in adding intermediate layers called adapters for each task, and efficiently distilling knowledge from the previous model while learning the current task. Our proposed framework is efficient in both computation and memory complexity. To demonstrate its effectiveness, we evaluate our method by transferring the learned model to diverse text recognition downstream tasks, including Latin and non-Latin scripts. As far as we know, this is the first application of continual self-supervised learning for handwritten text recognition. We attain state-of-the-art performance on English, Italian and Russian scripts, whilst adding only a few parameters per task. The code and trained models will be publicly available. | ||||
| Address | |||||
| 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 | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DSW2023 | Serial | 3851 | ||
| Permanent link to this record | |||||
| Author | JW Xiao; CB Zhang; J. Feng; Xialei Liu; Joost Van de Weijer; MM Cheng | ||||
| Title | Endpoints Weight Fusion for Class Incremental Semantic Segmentation | Type | Conference Article | ||
| Year | 2023 | Publication | Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume |
Issue | Pages | 7204-7213 | ||
| Keywords | |||||
| Abstract | Class incremental semantic segmentation (CISS) focuses on alleviating catastrophic forgetting to improve discrimination. Previous work mainly exploit regularization (e.g., knowledge distillation) to maintain previous knowledge in the current model. However, distillation alone often yields limited gain to the model since only the representations of old and new models are restricted to be consistent. In this paper, we propose a simple yet effective method to obtain a model with strong memory of old knowledge, named Endpoints Weight Fusion (EWF). In our method, the model containing old knowledge is fused with the model retaining new knowledge in a dynamic fusion manner, strengthening the memory of old classes in ever-changing distributions. In addition, we analyze the relation between our fusion strategy and a popular moving average technique EMA, which reveals why our method is more suitable for class-incremental learning. To facilitate parameter fusion with closer distance in the parameter space, we use distillation to enhance the optimization process. Furthermore, we conduct experiments on two widely used datasets, achieving the state-of-the-art performance. | ||||
| Address | Vancouver; Canada; June 2023 | ||||
| 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 | CVPR | ||
| Notes | LAMP | Approved | no | ||
| Call Number | Admin @ si @ XZF2023 | Serial | 3854 | ||
| Permanent link to this record | |||||
| Author | Bonifaz Stuhr; Jurgen Brauer; Bernhard Schick; Jordi Gonzalez | ||||
| Title | Masked Discriminators for Content-Consistent Unpaired Image-to-Image Translation | Type | Miscellaneous | ||
| Year | 2023 | Publication | Arxiv | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | A common goal of unpaired image-to-image translation is to preserve content consistency between source images and translated images while mimicking the style of the target domain. Due to biases between the datasets of both domains, many methods suffer from inconsistencies caused by the translation process. Most approaches introduced to mitigate these inconsistencies do not constrain the discriminator, leading to an even more ill-posed training setup. Moreover, none of these approaches is designed for larger crop sizes. In this work, we show that masking the inputs of a global discriminator for both domains with a content-based mask is sufficient to reduce content inconsistencies significantly. However, this strategy leads to artifacts that can be traced back to the masking process. To reduce these artifacts, we introduce a local discriminator that operates on pairs of small crops selected with a similarity sampling strategy. Furthermore, we apply this sampling strategy to sample global input crops from the source and target dataset. In addition, we propose feature-attentive denormalization to selectively incorporate content-based statistics into the generator stream. In our experiments, we show that our method achieves state-of-the-art performance in photorealistic sim-to-real translation and weather translation and also performs well in day-to-night translation. Additionally, we propose the cKVD metric, which builds on the sKVD metric and enables the examination of translation quality at the class or category level. | ||||
| Address | |||||
| 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 | |||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ SBS2023 | Serial | 3863 | ||
| Permanent link to this record | |||||
| Author | Maciej Wielgosz; Antonio Lopez; Muhamad Naveed Riaz | ||||
| Title | CARLA-BSP: a simulated dataset with pedestrians | Type | Miscellaneous | ||
| Year | 2023 | Publication | Arxiv | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | We present a sample dataset featuring pedestrians generated using the ARCANE framework, a new framework for generating datasets in CARLA (0.9.13). We provide use cases for pedestrian detection, autoencoding, pose estimation, and pose lifting. We also showcase baseline results. | ||||
| Address | |||||
| 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 | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ WLN2023 | Serial | 3866 | ||
| Permanent link to this record | |||||
| Author | Akhil Gurram; Antonio Lopez | ||||
| Title | On the Metrics for Evaluating Monocular Depth Estimation | Type | Miscellaneous | ||
| Year | 2023 | Publication | Arxiv | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | Monocular Depth Estimation (MDE) is performed to produce 3D information that can be used in downstream tasks such as those related to on-board perception for Autonomous Vehicles (AVs) or driver assistance. Therefore, a relevant arising question is whether the standard metrics for MDE assessment are a good indicator of the accuracy of future MDE-based driving-related perception tasks. We address this question in this paper. In particular, we take the task of 3D object detection on point clouds as a proxy of on-board perception. We train and test state-of-the-art 3D object detectors using 3D point clouds coming from MDE models. We confront the ranking of object detection results with the ranking given by the depth estimation metrics of the MDE models. We conclude that, indeed, MDE evaluation metrics give rise to a ranking of methods that reflects relatively well the 3D object detection results we may expect. Among the different metrics, the absolute relative (abs-rel) error seems to be the best for that purpose. | ||||
| Address | |||||
| 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 | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ GuL2023 | Serial | 3867 | ||
| Permanent link to this record | |||||
| Author | David Pujol Perich; Albert Clapes; Sergio Escalera | ||||
| Title | SADA: Semantic adversarial unsupervised domain adaptation for Temporal Action Localization | Type | Miscellaneous | ||
| Year | 2023 | Publication | Arxiv | Abbreviated Journal | |
| Volume |
Issue | Pages | |||
| Keywords | |||||
| Abstract | Temporal Action Localization (TAL) is a complex task that poses relevant challenges, particularly when attempting to generalize on new -- unseen -- domains in real-world applications. These scenarios, despite realistic, are often neglected in the literature, exposing these solutions to important performance degradation. In this work, we tackle this issue by introducing, for the first time, an approach for Unsupervised Domain Adaptation (UDA) in sparse TAL, which we refer to as Semantic Adversarial unsupervised Domain Adaptation (SADA). Our contributions are threefold: (1) we pioneer the development of a domain adaptation model that operates on realistic sparse action detection benchmarks; (2) we tackle the limitations of global-distribution alignment techniques by introducing a novel adversarial loss that is sensitive to local class distributions, ensuring finer-grained adaptation; and (3) we present a novel set of benchmarks based on EpicKitchens100 and CharadesEgo, that evaluate multiple domain shifts in a comprehensive manner. Our experiments indicate that SADA improves the adaptation across domains when compared to fully supervised state-of-the-art and alternative UDA methods, attaining a performance boost of up to 6.14% mAP. | ||||
| Address | |||||
| 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 | |||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ PCE2023 | Serial | 4014 | ||
| Permanent link to this record | |||||