| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–20] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Shiqi Yang; Yaxing Wang; Joost Van de Weijer; Luis Herranz; Shangling Jui | ||||
| Title | Generalized Source-free Domain Adaptation | Type | Conference Article | ||
| Year | 2021 | Publication | 19th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages  |
8958-8967 | ||
| Keywords | |||||
| Abstract | Domain adaptation (DA) aims to transfer the knowledge learned from a source domain to an unlabeled target domain. Some recent works tackle source-free domain adaptation (SFDA) where only a source pre-trained model is available for adaptation to the target domain. However, those methods do not consider keeping source performance which is of high practical value in real world applications. In this paper, we propose a new domain adaptation paradigm called Generalized Source-free Domain Adaptation (G-SFDA), where the learned model needs to perform well on both the target and source domains, with only access to current unlabeled target data during adaptation. First, we propose local structure clustering (LSC), aiming to cluster the target features with its semantically similar neighbors, which successfully adapts the model to the target domain in the absence of source data. Second, we propose sparse domain attention (SDA), it produces a binary domain specific attention to activate different feature channels for different domains, meanwhile the domain attention will be utilized to regularize the gradient during adaptation to keep source information. In the experiments, for target performance our method is on par with or better than existing DA and SFDA methods, specifically it achieves state-of-the-art performance (85.4%) on VisDA, and our method works well for all domains after adapting to single or multiple target domains. | ||||
| Address | Virtual; October 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 | |||
| Notes | LAMP; 600.120; 600.147 | Approved | no | ||
| Call Number | Admin @ si @ YWW2021 | Serial | 3605 | ||
| Permanent link to this record | |||||
| Author | David Berga; Xose R. Fernandez-Vidal; Xavier Otazu; Xose M. Pardo | ||||
| Title | SID4VAM: A Benchmark Dataset with Synthetic Images for Visual Attention Modeling | Type | Conference Article | ||
| Year | 2019 | Publication | 18th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages |
8788-8797 | ||
| Keywords | |||||
| Abstract | A benchmark of saliency models performance with a synthetic image dataset is provided. Model performance is evaluated through saliency metrics as well as the influence of model inspiration and consistency with human psychophysics. SID4VAM is composed of 230 synthetic images, with known salient regions. Images were generated with 15 distinct types of low-level features (e.g. orientation, brightness, color, size...) with a target-distractor popout type of synthetic patterns. We have used Free-Viewing and Visual Search task instructions and 7 feature contrasts for each feature category. Our study reveals that state-ofthe-art Deep Learning saliency models do not perform well with synthetic pattern images, instead, models with Spectral/Fourier inspiration outperform others in saliency metrics and are more consistent with human psychophysical experimentation. This study proposes a new way to evaluate saliency models in the forthcoming literature, accounting for synthetic images with uniquely low-level feature contexts, distinct from previous eye tracking image datasets. | ||||
| Address | Seul; Corea; October 2019 | ||||
| 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 | NEUROBIT; 600.128 | Approved | no | ||
| Call Number | Admin @ si @ BFO2019b | Serial | 3372 | ||
| Permanent link to this record | |||||
| Author | Hunor Laczko; Meysam Madadi; Sergio Escalera; Jordi Gonzalez | ||||
| Title | A Generative Multi-Resolution Pyramid and Normal-Conditioning 3D Cloth Draping | Type | Conference Article | ||
| Year | 2024 | Publication | Winter Conference on Applications of Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages |
8709-8718 | ||
| Keywords | |||||
| Abstract | RGB cloth generation has been deeply studied in the related literature, however, 3D garment generation remains an open problem. In this paper, we build a conditional variational autoencoder for 3D garment generation and draping. We propose a pyramid network to add garment details progressively in a canonical space, i.e. unposing and unshaping the garments w.r.t. the body. We study conditioning the network on surface normal UV maps, as an intermediate representation, which is an easier problem to optimize than 3D coordinates. Our results on two public datasets, CLOTH3D and CAPE, show that our model is robust, controllable in terms of detail generation by the use of multi-resolution pyramids, and achieves state-of-the-art results that can highly generalize to unseen garments, poses, and shapes even when training with small amounts of data. | ||||
| Address | Waikoloa; Hawai; USA; January 2024 | ||||
| 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 | ISE; HUPBA | Approved | no | ||
| Call Number | Admin @ si @ LME2024 | Serial | 3996 | ||
| Permanent link to this record | |||||
| Author | Rahma Kalboussi; Aymen Azaza; Joost Van de Weijer; Mehrez Abdellaoui; Ali Douik | ||||
| Title | Object proposals for salient object segmentation in videos | Type | Journal Article | ||
| Year | 2020 | Publication | Multimedia Tools and Applications | Abbreviated Journal | MTAP |
| Volume | 79 | Issue | 13 | Pages |
8677-8693 |
| Keywords | |||||
| Abstract | Salient object segmentation in videos is generally broken up in a video segmentation part and a saliency assignment part. Recently, object proposals, which are used to segment the image, have had significant impact on many computer vision applications, including image segmentation, object detection, and recently saliency detection in still images. However, their usage has not yet been evaluated for salient object segmentation in videos. Therefore, in this paper, we investigate the application of object proposals to salient object segmentation in videos. In addition, we propose a new motion feature derived from the optical flow structure tensor for video saliency detection. Experiments on two standard benchmark datasets for video saliency show that the proposed motion feature improves saliency estimation results, and that object proposals are an efficient method for salient object segmentation. Results on the challenging SegTrack v2 and Fukuchi benchmark data sets show that we significantly outperform the state-of-the-art. | ||||
| 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 | KAW2020 | Serial | 3504 | ||
| Permanent link to this record | |||||
| Author | Adrian Galdran; Aitor Alvarez-Gila; Alessandro Bria; Javier Vazquez; Marcelo Bertalmio | ||||
| Title | On the Duality Between Retinex and Image Dehazing | Type | Conference Article | ||
| Year | 2018 | Publication | 31st IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
8212–8221 | ||
| Keywords | Image color analysis; Task analysis; Atmospheric modeling; Computer vision; Computational modeling; Lighting | ||||
| Abstract | Image dehazing deals with the removal of undesired loss of visibility in outdoor images due to the presence of fog. Retinex is a color vision model mimicking the ability of the Human Visual System to robustly discount varying illuminations when observing a scene under different spectral lighting conditions. Retinex has been widely explored in the computer vision literature for image enhancement and other related tasks. While these two problems are apparently unrelated, the goal of this work is to show that they can be connected by a simple linear relationship. Specifically, most Retinex-based algorithms have the characteristic feature of always increasing image brightness, which turns them into ideal candidates for effective image dehazing by directly applying Retinex to a hazy image whose intensities have been inverted. In this paper, we give theoretical proof that Retinex on inverted intensities is a solution to the image dehazing problem. Comprehensive qualitative and quantitative results indicate that several classical and modern implementations of Retinex can be transformed into competing image dehazing algorithms performing on pair with more complex fog removal methods, and can overcome some of the main challenges associated with this problem. | ||||
| Address | Salt Lake City; USA; June 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 | CVPR | ||
| Notes | LAMP; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ GAB2018 | Serial | 3146 | ||
| Permanent link to this record | |||||
| Author | Pau Rodriguez; Diego Velazquez; Guillem Cucurull; Josep M. Gonfaus; Xavier Roca; Seiichi Ozawa; Jordi Gonzalez | ||||
| Title | Personality Trait Analysis in Social Networks Based on Weakly Supervised Learning of Shared Images | Type | Journal Article | ||
| Year | 2020 | Publication | Applied Sciences | Abbreviated Journal | APPLSCI |
| Volume | 10 | Issue | 22 | Pages |
8170 |
| Keywords | sentiment analysis, personality trait analysis; weakly-supervised learning; visual classification; OCEAN model; social networks | ||||
| Abstract | Social networks have attracted the attention of psychologists, as the behavior of users can be used to assess personality traits, and to detect sentiments and critical mental situations such as depression or suicidal tendencies. Recently, the increasing amount of image uploads to social networks has shifted the focus from text to image-based personality assessment. However, obtaining the ground-truth requires giving personality questionnaires to the users, making the process very costly and slow, and hindering research on large populations. In this paper, we demonstrate that it is possible to predict which images are most associated with each personality trait of the OCEAN personality model, without requiring ground-truth personality labels. Namely, we present a weakly supervised framework which shows that the personality scores obtained using specific images textually associated with particular personality traits are highly correlated with scores obtained using standard text-based personality questionnaires. We trained an OCEAN trait model based on Convolutional Neural Networks (CNNs), learned from 120K pictures posted with specific textual hashtags, to infer whether the personality scores from the images uploaded by users are consistent with those scores obtained from text. In order to validate our claims, we performed a personality test on a heterogeneous group of 280 human subjects, showing that our model successfully predicts which kind of image will match a person with a given level of a trait. Looking at the results, we obtained evidence that personality is not only correlated with text, but with image content too. Interestingly, different visual patterns emerged from those images most liked by persons with a particular personality trait: for instance, pictures most associated with high conscientiousness usually contained healthy food, while low conscientiousness pictures contained injuries, guns, and alcohol. These findings could pave the way to complement text-based personality questionnaires with image-based questions. | ||||
| 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; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ RVC2020b | Serial | 3553 | ||
| Permanent link to this record | |||||
| Author | Idoia Ruiz; Joan Serrat | ||||
| Title | Rank-based ordinal classification | Type | Conference Article | ||
| Year | 2020 | Publication | 25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
8069-8076 | ||
| Keywords | |||||
| Abstract | Differently from the regular classification task, in ordinal classification there is an order in the classes. As a consequence not all classification errors matter the same: a predicted class close to the groundtruth one is better than predicting a farther away class. To account for this, most previous works employ loss functions based on the absolute difference between the predicted and groundtruth class labels. We argue that there are many cases in ordinal classification where label values are arbitrary (for instance 1. . . C, being C the number of classes) and thus such loss functions may not be the best choice. We instead propose a network architecture that produces not a single class prediction but an ordered vector, or ranking, of all the possible classes from most to least likely. This is thanks to a loss function that compares groundtruth and predicted rankings of these class labels, not the labels themselves. Another advantage of this new formulation is that we can enforce consistency in the predictions, namely, predicted rankings come from some unimodal vector of scores with mode at the groundtruth class. We compare with the state of the art ordinal classification methods, showing
that ours attains equal or better performance, as measured by common ordinal classification metrics, on three benchmark datasets. Furthermore, it is also suitable for a new task on image aesthetics assessment, i.e. most voted score prediction. Finally, we also apply it to building damage assessment from satellite images, providing an analysis of its performance depending on the degree of imbalance of the dataset. |
||||
| 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 | ICPR | ||
| Notes | ADAS; 600.118; 600.124 | Approved | no | ||
| Call Number | Admin @ si @ RuS2020 | Serial | 3549 | ||
| Permanent link to this record | |||||
| Author | Xialei Liu; Joost Van de Weijer; Andrew Bagdanov | ||||
| Title | Leveraging Unlabeled Data for Crowd Counting by Learning to Rank | Type | Conference Article | ||
| Year | 2018 | Publication | 31st IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
7661 - 7669 | ||
| Keywords | Task analysis; Training; Computer vision; Visualization; Estimation; Head; Context modeling | ||||
| Abstract | We propose a novel crowd counting approach that leverages abundantly available unlabeled crowd imagery in a learning-to-rank framework. To induce a ranking of
cropped images , we use the observation that any sub-image of a crowded scene image is guaranteed to contain the same number or fewer persons than the super-image. This allows us to address the problem of limited size of existing datasets for crowd counting. We collect two crowd scene datasets from Google using keyword searches and queryby-example image retrieval, respectively. We demonstrate how to efficiently learn from these unlabeled datasets by incorporating learning-to-rank in a multi-task network which simultaneously ranks images and estimates crowd density maps. Experiments on two of the most challenging crowd counting datasets show that our approach obtains state-ofthe-art results. |
||||
| Address | Salt Lake City; USA; June 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 | CVPR | ||
| Notes | LAMP; 600.109; 600.106; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ LWB2018 | Serial | 3159 | ||
| Permanent link to this record | |||||
| Author | Albert Ali Salah; E. Pauwels; R. Tavenard; Theo Gevers | ||||
| Title | T-Patterns Revisited: Mining for Temporal Patterns in Sensor Data | Type | Journal Article | ||
| Year | 2010 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 10 | Issue | 8 | Pages |
7496-7513 |
| Keywords | sensor networks; temporal pattern extraction; T-patterns; Lempel-Ziv; Gaussian mixture model; MERL motion data | ||||
| Abstract | The trend to use large amounts of simple sensors as opposed to a few complex sensors to monitor places and systems creates a need for temporal pattern mining algorithms to work on such data. The methods that try to discover re-usable and interpretable patterns in temporal event data have several shortcomings. We contrast several recent approaches to the problem, and extend the T-Pattern algorithm, which was previously applied for detection of sequential patterns in behavioural sciences. The temporal complexity of the T-pattern approach is prohibitive in the scenarios we consider. We remedy this with a statistical model to obtain a fast and robust algorithm to find patterns in temporal data. We test our algorithm on a recent database collected with passive infrared sensors with millions of events. | ||||
| 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 | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ SPT2010 | Serial | 1845 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; Aura Hernandez-Sabate; Julien Enconniere; Saryani Asmayawati; Pau Folch; Juan Borrego-Carazo; Miquel Angel Piera | ||||
| Title | E-Pilots: A System to Predict Hard Landing During the Approach Phase of Commercial Flights | Type | Journal Article | ||
| Year | 2022 | Publication | IEEE Access | Abbreviated Journal | ACCESS |
| Volume | 10 | Issue | Pages |
7489-7503 | |
| Keywords | |||||
| Abstract | More than half of all commercial aircraft operation accidents could have been prevented by executing a go-around. Making timely decision to execute a go-around manoeuvre can potentially reduce overall aviation industry accident rate. In this paper, we describe a cockpit-deployable machine learning system to support flight crew go-around decision-making based on the prediction of a hard landing event.
This work presents a hybrid approach for hard landing prediction that uses features modelling temporal dependencies of aircraft variables as inputs to a neural network. Based on a large dataset of 58177 commercial flights, the results show that our approach has 85% of average sensitivity with 74% of average specificity at the go-around point. It follows that our approach is a cockpit-deployable recommendation system that outperforms existing approaches. |
||||
| 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; 600.139; 600.118; 600.145 | Approved | no | ||
| Call Number | Admin @ si @ GHE2022 | Serial | 3721 | ||
| Permanent link to this record | |||||
| Author | Simone Balocco; Carlo Gatta; Marina Alberti; Xavier Carrillo; Juan Rigla; Petia Radeva | ||||
| Title | Relation between plaque type, plaque thickness, blood shear stress and plaque stress in coronary arteries assessed by X-ray Angiography and Intravascular Ultrasound | Type | Journal Article | ||
| Year | 2012 | Publication | Medical Physics | Abbreviated Journal | MEDPHYS |
| Volume | 39 | Issue | 12 | Pages |
7430-7445 |
| Keywords | |||||
| Abstract | PMID 23231293
PURPOSE: Atheromatic plaque progression is affected, among others phenomena, by biomechanical, biochemical, and physiological factors. In this paper, the authors introduce a novel framework able to provide both morphological (vessel radius, plaque thickness, and type) and biomechanical (wall shear stress and Von Mises stress) indices of coronary arteries. METHODS: First, the approach reconstructs the three-dimensional morphology of the vessel from intravascular ultrasound (IVUS) and Angiographic sequences, requiring minimal user interaction. Then, a computational pipeline allows to automatically assess fluid-dynamic and mechanical indices. Ten coronary arteries are analyzed illustrating the capabilities of the tool and confirming previous technical and clinical observations. RESULTS: The relations between the arterial indices obtained by IVUS measurement and simulations have been quantitatively analyzed along the whole surface of the artery, extending the analysis of the coronary arteries shown in previous state of the art studies. Additionally, for the first time in the literature, the framework allows the computation of the membrane stresses using a simplified mechanical model of the arterial wall. CONCLUSIONS: Circumferentially (within a given frame), statistical analysis shows an inverse relation between the wall shear stress and the plaque thickness. At the global level (comparing a frame within the entire vessel), it is observed that heavy plaque accumulations are in general calcified and are located in the areas of the vessel having high wall shear stress. Finally, in their experiments the inverse proportionality between fluid and structural stresses is observed. |
||||
| 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 | Approved | no | ||
| Call Number | Admin @ si @BGA2012 | Serial | 2170 | ||
| Permanent link to this record | |||||
| Author | Jorge Bernal; F. Javier Sanchez; Fernando Vilariño | ||||
| Title | Impact of Image Preprocessing Methods on Polyp Localization in Colonoscopy Frames | Type | Conference Article | ||
| Year | 2013 | Publication | 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society | Abbreviated Journal | |
| Volume | Issue | Pages |
7350 - 7354 | ||
| Keywords | |||||
| Abstract | In this paper we present our image preprocessing methods as a key part of our automatic polyp localization scheme. These methods are used to assess the impact of different endoluminal scene elements when characterizing polyps. More precisely we tackle the influence of specular highlights, blood vessels and black mask surrounding the scene. Experimental results prove that the appropriate handling of these elements leads to a great improvement in polyp localization results. | ||||
| Address | Osaka; Japan; July 2013 | ||||
| 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 | 1557-170X | ISBN | Medium | ||
| Area | 800 | Expedition | Conference | EMBC | |
| Notes | MV; 600.047; 600.060;SIAI | Approved | no | ||
| Call Number | Admin @ si @ BSV2013 | Serial | 2286 | ||
| Permanent link to this record | |||||
| Author | Joan Marc Llargues Asensio; Juan Peralta; Raul Arrabales; Manuel Gonzalez Bedia; Paulo Cortez; Antonio Lopez | ||||
| Title | Artificial Intelligence Approaches for the Generation and Assessment of Believable Human-Like Behaviour in Virtual Characters | Type | Journal Article | ||
| Year | 2014 | Publication | Expert Systems With Applications | Abbreviated Journal | EXSY |
| Volume | 41 | Issue | 16 | Pages |
7281–7290 |
| Keywords | Turing test; Human-like behaviour; Believability; Non-player characters; Cognitive architectures; Genetic algorithm; Artificial neural networks | ||||
| Abstract | Having artificial agents to autonomously produce human-like behaviour is one of the most ambitious original goals of Artificial Intelligence (AI) and remains an open problem nowadays. The imitation game originally proposed by Turing constitute a very effective method to prove the indistinguishability of an artificial agent. The behaviour of an agent is said to be indistinguishable from that of a human when observers (the so-called judges in the Turing test) cannot tell apart humans and non-human agents. Different environments, testing protocols, scopes and problem domains can be established to develop limited versions or variants of the original Turing test. In this paper we use a specific version of the Turing test, based on the international BotPrize competition, built in a First-Person Shooter video game, where both human players and non-player characters interact in complex virtual environments. Based on our past experience both in the BotPrize competition and other robotics and computer game AI applications we have developed three new more advanced controllers for believable agents: two based on a combination of the CERA–CRANIUM and SOAR cognitive architectures and other based on ADANN, a system for the automatic evolution and adaptation of artificial neural networks. These two new agents have been put to the test jointly with CCBot3, the winner of BotPrize 2010 competition (Arrabales et al., 2012), and have showed a significant improvement in the humanness ratio. Additionally, we have confronted all these bots to both First-person believability assessment (BotPrize original judging protocol) and Third-person believability assessment, demonstrating that the active involvement of the judge has a great impact in the recognition of human-like behaviour. | ||||
| 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; 600.055; 600.057; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ LPA2014 | Serial | 2500 | ||
| 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 | Armin Mehri; Parichehr Behjati Ardakani; Angel Sappa | ||||
| Title | LiNet: A Lightweight Network for Image Super Resolution | Type | Conference Article | ||
| Year | 2021 | Publication | 25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
7196-7202 | ||
| Keywords | |||||
| Abstract | This paper proposes a new lightweight network, LiNet, that enhancing technical efficiency in lightweight super resolution and operating approximately like very large and costly networks in terms of number of network parameters and operations. The proposed architecture allows the network to learn more abstract properties by avoiding low-level information via multiple links. LiNet introduces a Compact Dense Module, which contains set of inner and outer blocks, to efficiently extract meaningful information, to better leverage multi-level representations before upsampling stage, and to allow an efficient information and gradient flow within the network. Experiments on benchmark datasets show that the proposed LiNet achieves favorable performance against lightweight state-of-the-art methods. | ||||
| 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 | |||
| Notes | MSIAU; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ MAS2021a | Serial | 3583 | ||
| Permanent link to this record | |||||