| Home | [111–120] << 121 122 123 124 125 126 127 128 129 130 >> [131–140] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Angel Morera; Angel Sanchez; A. Belen Moreno; Angel Sappa; Jose F. Velez | ||||
| Title | SSD vs. YOLO for Detection of Outdoor Urban Advertising Panels under Multiple Variabilities | Type | Journal Article | ||
| Year | 2020 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 20 | Issue | 16 | Pages | 4587 |
| Keywords | |||||
| Abstract | This work compares Single Shot MultiBox Detector (SSD) and You Only Look Once (YOLO) deep neural networks for the outdoor advertisement panel detection problem by handling multiple and combined variabilities in the scenes. Publicity panel detection in images offers important advantages both in the real world as well as in the virtual one. For example, applications like Google Street View can be used for Internet publicity and when detecting these ads panels in images, it could be possible to replace the publicity appearing inside the panels by another from a funding company. In our experiments, both SSD and YOLO detectors have produced acceptable results under variable sizes of panels, illumination conditions, viewing perspectives, partial occlusion of panels, complex background and multiple panels in scenes. Due to the difficulty of finding annotated images for the considered problem, we created our own dataset for conducting the experiments. The major strength of the SSD model was the almost elimination of False Positive (FP) cases, situation that is preferable when the publicity contained inside the panel is analyzed after detecting them. On the other side, YOLO produced better panel localization results detecting a higher number of True Positive (TP) panels with a higher accuracy. Finally, a comparison of the two analyzed object detection models with different types of semantic segmentation networks and using the same evaluation metrics is also included. | ||||
| 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 | MSIAU; 600.130; 601.349; 600.122 | Approved | no | ||
Call Number  |
Admin @ si @ MSM2020 | Serial | 3452 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Sandra Skaff; Luca Marchesotti; Florent Perronnin | ||||
| Title | Towards automatic and flexible concept transfer | Type | Journal Article | ||
| Year | 2012 | Publication | Computers and Graphics | Abbreviated Journal | CG |
| Volume | 36 | Issue | 6 | Pages | 622–634 |
| Keywords | |||||
| Abstract | This paper introduces a novel approach to automatic, yet flexible, image concepttransfer; examples of concepts are “romantic”, “earthy”, and “luscious”. The presented method modifies the color content of an input image given only a concept specified by a user in natural language, thereby requiring minimal user input. This method is particularly useful for users who are aware of the message they wish to convey in the transferred image while being unsure of the color combination needed to achieve the corresponding transfer. Our framework is flexible for two reasons. First, the user may select one of two modalities to map input image chromaticities to target concept chromaticities depending on the level of photo-realism required. Second, the user may adjust the intensity level of the concepttransfer to his/her liking with a single parameter. The proposed method uses a convex clustering algorithm, with a novel pruning mechanism, to automatically set the complexity of models of chromatic content. Results show that our approach yields transferred images which effectively represent concepts as confirmed by a user study. | ||||
| 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 | 0097-8493 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC | Approved | no | ||
| Call Number |
Admin @ si @ MSM2012 | Serial | 2002 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Sandra Skaff; Luca Marchesotti; Florent Perronnin | ||||
| Title | Towards Automatic Concept Transfer | Type | Conference Article | ||
| Year | 2011 | Publication | Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering | Abbreviated Journal | |
| Volume | Issue | Pages | 167.176 | ||
| Keywords | chromatic modeling, color concepts, color transfer, concept transfer | ||||
| Abstract | This paper introduces a novel approach to automatic concept transfer; examples of concepts are “romantic”, “earthy”, and “luscious”. The approach modifies the color content of an input image given only a concept specified by a user in natural language, thereby requiring minimal user input. This approach is particularly useful for users who are aware of the message they wish to convey in the transferred image while being unsure of the color combination needed to achieve the corresponding transfer. The user may adjust the intensity level of the concept transfer to his/her liking with a single parameter. The proposed approach uses a convex clustering algorithm, with a novel pruning mechanism, to automatically set the complexity of models of chromatic content. It also uses the Earth-Mover's Distance to compute a mapping between the models of the input image and the target chromatic concept. Results show that our approach yields transferred images which effectively represent concepts, as confirmed by a user study. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | ACM Press | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-4503-0907-3 | Medium | ||
| Area | Expedition | Conference | NPAR | ||
| Notes | CIC | Approved | no | ||
| Call Number |
Admin @ si @ MSM2011 | Serial | 1866 | ||
| Permanent link to this record | |||||
| Author | Mikel Menta; Adriana Romero; Joost Van de Weijer | ||||
| Title | Learning to adapt class-specific features across domains for semantic segmentation | Type | Miscellaneous | ||
| Year | 2020 | Publication | Arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | arXiv:2001.08311
Recent advances in unsupervised domain adaptation have shown the effectiveness of adversarial training to adapt features across domains, endowing neural networks with the capability of being tested on a target domain without requiring any training annotations in this domain. The great majority of existing domain adaptation models rely on image translation networks, which often contain a huge amount of domain-specific parameters. Additionally, the feature adaptation step often happens globally, at a coarse level, hindering its applicability to tasks such as semantic segmentation, where details are of crucial importance to provide sharp results. In this thesis, we present a novel architecture, which learns to adapt features across domains by taking into account per class information. To that aim, we design a conditional pixel-wise discriminator network, whose output is conditioned on the segmentation masks. Moreover, following recent advances in image translation, we adopt the recently introduced StarGAN architecture as image translation backbone, since it is able to perform translations across multiple domains by means of a single generator network. Preliminary results on a segmentation task designed to assess the effectiveness of the proposed approach highlight the potential of the model, improving upon strong baselines and alternative designs. |
||||
| 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 | LAMP; 600.120 | Approved | no | ||
| Call Number |
Admin @ si @ MRW2020 | Serial | 3545 | ||
| Permanent link to this record | |||||
| Author | Marc Masana; Idoia Ruiz; Joan Serrat; Joost Van de Weijer; Antonio Lopez | ||||
| Title | Metric Learning for Novelty and Anomaly Detection | Type | Conference Article | ||
| Year | 2018 | Publication | 29th British Machine Vision Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | When neural networks process images which do not resemble the distribution seen during training, so called out-of-distribution images, they often make wrong predictions, and do so too confidently. The capability to detect out-of-distribution images is therefore crucial for many real-world applications. We divide out-of-distribution detection between novelty detection ---images of classes which are not in the training set but are related to those---, and anomaly detection ---images with classes which are unrelated to the training set. By related we mean they contain the same type of objects, like digits in MNIST and SVHN. Most existing work has focused on anomaly detection, and has addressed this problem considering networks trained with the cross-entropy loss. Differently from them, we propose to use metric learning which does not have the drawback of the softmax layer (inherent to cross-entropy methods), which forces the network to divide its prediction power over the learned classes. We perform extensive experiments and evaluate both novelty and anomaly detection, even in a relevant application such as traffic sign recognition, obtaining comparable or better results than previous works. | ||||
| Address | Newcastle; uk; September 2018 | ||||
| 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 | BMVC | ||
| Notes | LAMP; ADAS; 601.305; 600.124; 600.106; 602.200; 600.120; 600.118 | Approved | no | ||
| Call Number |
Admin @ si @ MRS2018 | Serial | 3156 | ||
| Permanent link to this record | |||||
| Author | Adria Molina; Pau Riba; Lluis Gomez; Oriol Ramos Terrades; Josep Llados | ||||
| Title | Date Estimation in the Wild of Scanned Historical Photos: An Image Retrieval Approach | Type | Conference Article | ||
| Year | 2021 | Publication | 16th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | 12822 | Issue | Pages | 306-320 | |
| Keywords | |||||
| Abstract | This paper presents a novel method for date estimation of historical photographs from archival sources. The main contribution is to formulate the date estimation as a retrieval task, where given a query, the retrieved images are ranked in terms of the estimated date similarity. The closer are their embedded representations the closer are their dates. Contrary to the traditional models that design a neural network that learns a classifier or a regressor, we propose a learning objective based on the nDCG ranking metric. We have experimentally evaluated the performance of the method in two different tasks: date estimation and date-sensitive image retrieval, using the DEW public database, overcoming the baseline methods. | ||||
| Address | Lausanne; Suissa; September 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 | ICDAR | ||
| Notes | DAG; 600.121; 600.140; 110.312 | Approved | no | ||
| Call Number |
Admin @ si @ MRG2021b | Serial | 3571 | ||
| Permanent link to this record | |||||
| Author | Andres Mafla; Rafael S. Rezende; Lluis Gomez; Diana Larlus; Dimosthenis Karatzas | ||||
| Title | StacMR: Scene-Text Aware Cross-Modal Retrieval | Type | Conference Article | ||
| Year | 2021 | Publication | IEEE Winter Conference on Applications of Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 2219-2229 | ||
| Keywords | |||||
| Abstract | |||||
| Address | Virtual; January 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 | WACV | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number |
Admin @ si @ MRG2021a | Serial | 3492 | ||
| Permanent link to this record | |||||
| Author | Enric Marti; J.Roncaries; Debora Gil; Aura Hernandez-Sabate; Antoni Gurgui; Ferran Poveda | ||||
| Title | PBL On Line: A proposal for the organization, part-time monitoring and assessment of PBL group activities | Type | Journal | ||
| Year | 2015 | Publication | Journal of Technology and Science Education | Abbreviated Journal | JOTSE |
| Volume | 5 | Issue | 2 | Pages | 87-96 |
| 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; ADAS; 600.076; 600.075 | Approved | no | ||
| Call Number |
Admin @ si @ MRG2015 | Serial | 2608 | ||
| Permanent link to this record | |||||
| Author | Daniel Marczak; Grzegorz Rypesc; Sebastian Cygert; Tomasz Trzcinski; Bartłomiej Twardowski | ||||
| Title | Generalized Continual Category Discovery | Type | Miscellaneous | ||
| Year | 2023 | Publication | arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Most of Continual Learning (CL) methods push the limit of supervised learning settings, where an agent is expected to learn new labeled tasks and not forget previous knowledge. However, these settings are not well aligned with real-life scenarios, where a learning agent has access to a vast amount of unlabeled data encompassing both novel (entirely unlabeled) classes and examples from known classes. Drawing inspiration from Generalized Category Discovery (GCD), we introduce a novel framework that relaxes this assumption. Precisely, in any task, we allow for the existence of novel and known classes, and one must use continual version of unsupervised learning methods to discover them. We call this setting Generalized Continual Category Discovery (GCCD). It unifies CL and GCD, bridging the gap between synthetic benchmarks and real-life scenarios. With a series of experiments, we present that existing methods fail to accumulate knowledge from subsequent tasks in which unlabeled samples of novel classes are present. In light of these limitations, we propose a method that incorporates both supervised and unsupervised signals and mitigates the forgetting through the use of centroid adaptation. Our method surpasses strong CL methods adopted for GCD techniques and presents a superior representation learning performance. | ||||
| 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 | LAMP | Approved | no | ||
| Call Number |
Admin @ si @ MRC2023 | Serial | 3985 | ||
| Permanent link to this record | |||||
| Author | Md. Mostafa Kamal Sarker; Hatem A. Rashwan; Mohamed Abdel-Nasser; Vivek Kumar Singh; Syeda Furruka Banu; Farhan Akram; Forhad U. H. Chowdhury; Kabir Ahmed Choudhury; Sylvie Chambon; Petia Radeva; Domenec Puig | ||||
| Title | MobileGAN: Skin Lesion Segmentation Using a Lightweight Generative Adversarial Network | Type | Miscellaneous | ||
| Year | 2019 | Publication | Arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | CoRR abs/1907.00856
Skin lesion segmentation in dermoscopic images is a challenge due to their blurry and irregular boundaries. Most of the segmentation approaches based on deep learning are time and memory consuming due to the hundreds of millions of parameters. Consequently, it is difficult to apply them to real dermatoscope devices with limited GPU and memory resources. In this paper, we propose a lightweight and efficient Generative Adversarial Networks (GAN) model, called MobileGAN for skin lesion segmentation. More precisely, the MobileGAN combines 1D non-bottleneck factorization networks with position and channel attention modules in a GAN model. The proposed model is evaluated on the test dataset of the ISBI 2017 challenges and the validation dataset of ISIC 2018 challenges. Although the proposed network has only 2.35 millions of parameters, it is still comparable with the state-of-the-art. The experimental results show that our MobileGAN obtains comparable performance with an accuracy of 97.61%. |
||||
| 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 | MILAB; no menciona | Approved | no | ||
| Call Number |
Admin @ si @ MRA2019 | Serial | 3384 | ||
| 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 | C. Mariño; M.G. Penas; M. Penedo; David Lloret; M.J. Carreira | ||||
| Title | Integration of Mutual Information and Creaseness Based Methods for the Automatic Registration of SLO Sequences. | Type | Miscellaneous | ||
| Year | 2001 | Publication | Proceedings of the SIARP´2001. | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Brasil. | ||||
| 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 | Approved | no | |||
| Call Number |
Admin @ si @ MPP2001 | Serial | 197 | ||
| Permanent link to this record | |||||
| Author | Enric Marti; Ferran Poveda; Antoni Gurgui; Jaume Rocarias; Debora Gil; Aura Hernandez-Sabate | ||||
| Title | Una experiencia de estructura, funcionamiento y evaluación de la asignatura de graficos por computador con metodologia de aprendizaje basado en proyectos | Type | Miscellaneous | ||
| Year | 2013 | Publication | IV Congreso Internacional UNIVEST | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | IV Congreso Internacional UNIVEST | ||||
| 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 | UNIVEST | ||
| Notes | IAM; ADAS | Approved | no | ||
| Call Number |
Admin @ si @ MPG2013b | Serial | 2384 | ||
| Permanent link to this record | |||||
| Author | Enric Marti; Ferran Poveda; Antoni Gurgui; Jaume Rocarias; Debora Gil | ||||
| Title | Una propuesta de seguimiento, tutorías on line y evaluación en la metodología de Aprendizaje Basado en Proyectos | Type | Miscellaneous | ||
| Year | 2013 | Publication | IV Congreso Internacional UNIVEST | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Poster | ||||
| Address | Girona | ||||
| 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 | UNIVEST | ||
| Notes | IAM | Approved | no | ||
| Call Number |
Admin @ si @ MPG2013a | Serial | 2304 | ||
| Permanent link to this record | |||||
| Author | Mikhail Mozerov; Joost Van de Weijer | ||||
| Title | Improved Recursive Geodesic Distance Computation for Edge Preserving Filter | Type | Journal Article | ||
| Year | 2017 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 26 | Issue | 8 | Pages | 3696 - 3706 |
| Keywords | Geodesic distance filter; color image filtering; image enhancement | ||||
| Abstract | All known recursive filters based on the geodesic distance affinity are realized by two 1D recursions applied in two orthogonal directions of the image plane. The 2D extension of the filter is not valid and has theoretically drawbacks, which lead to known artifacts. In this paper, a maximum influence propagation method is proposed to approximate the 2D extension for the
geodesic distance-based recursive filter. The method allows to partially overcome the drawbacks of the 1D recursion approach. We show that our improved recursion better approximates the true geodesic distance filter, and the application of this improved filter for image denoising outperforms the existing recursive implementation of the geodesic distance. As an application, we consider a geodesic distance-based filter for image denoising. Experimental evaluation of our denoising method demonstrates comparable and for several test images better results, than stateof-the-art approaches, while our algorithm is considerably fasterwith computational complexity O(8P). |
||||
| 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 | LAMP; ISE; 600.120; 600.098; 600.119 | Approved | no | ||
| Call Number |
Admin @ si @ Moz2017 | Serial | 2921 | ||
| Permanent link to this record | |||||