| Home | [81–90] << 91 92 93 94 95 96 97 98 99 100 >> [101–110] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Adriana Romero; Petia Radeva; Carlo Gatta | ||||
Title  |
Meta-parameter free unsupervised sparse feature learning | Type | Journal Article | ||
| Year | 2015 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 37 | Issue | 8 | Pages | 1716-1722 |
| Keywords | |||||
| Abstract | We propose a meta-parameter free, off-the-shelf, simple and fast unsupervised feature learning algorithm, which exploits a new way of optimizing for sparsity. Experiments on CIFAR-10, STL- 10 and UCMerced show that the method achieves the state-of-theart performance, providing discriminative features that generalize well. | ||||
| 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; 600.068; 600.079; 601.160 | Approved | no | ||
| Call Number | Admin @ si @ RRG2014b | Serial | 2594 | ||
| Permanent link to this record | |||||
| Author | Wenjuan Gong; Yue Zhang; Wei Wang; Peng Cheng; Jordi Gonzalez | ||||
| Title |
Meta-MMFNet: Meta-learning-based Multi-model Fusion Network for Micro-expression Recognition | Type | Journal Article | ||
| Year | 2023 | Publication | ACM Transactions on Multimedia Computing, Communications, and Applications | Abbreviated Journal | TMCCA |
| Volume | 20 | Issue | 2 | Pages | 1–20 |
| Keywords | |||||
| Abstract | Despite its wide applications in criminal investigations and clinical communications with patients suffering from autism, automatic micro-expression recognition remains a challenging problem because of the lack of training data and imbalanced classes problems. In this study, we proposed a meta-learning-based multi-model fusion network (Meta-MMFNet) to solve the existing problems. The proposed method is based on the metric-based meta-learning pipeline, which is specifically designed for few-shot learning and is suitable for model-level fusion. The frame difference and optical flow features were fused, deep features were extracted from the fused feature, and finally in the meta-learning-based framework, weighted sum model fusion method was applied for micro-expression classification. Meta-MMFNet achieved better results than state-of-the-art methods on four datasets. The code is available at https://github.com/wenjgong/meta-fusion-based-method. | ||||
| 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 @ GZW2023 | Serial | 3862 | ||
| Permanent link to this record | |||||
| Author | Wenjuan Gong; Zhang Yue; Wei Wang; Cheng Peng; Jordi Gonzalez | ||||
| Title |
Meta-MMFNet: Meta-Learning Based Multi-Model Fusion Network for Micro-Expression Recognition | Type | Journal Article | ||
| Year | 2022 | Publication | ACM Transactions on Multimedia Computing, Communications, and Applications | Abbreviated Journal | ACMTMC |
| Volume | Issue | Pages | |||
| Keywords | Feature Fusion; Model Fusion; Meta-Learning; Micro-Expression Recognition | ||||
| Abstract | Despite its wide applications in criminal investigations and clinical communications with patients suffering from autism, automatic micro-expression recognition remains a challenging problem because of the lack of training data and imbalanced classes problems. In this study, we proposed a meta-learning based multi-model fusion network (Meta-MMFNet) to solve the existing problems. The proposed method is based on the metric-based meta-learning pipeline, which is specifically designed for few-shot learning and is suitable for model-level fusion. The frame difference and optical flow features were fused, deep features were extracted from the fused feature, and finally in the meta-learning-based framework, weighted sum model fusion method was applied for micro-expression classification. Meta-MMFNet achieved better results than state-of-the-art methods on four datasets. The code is available at https://github.com/wenjgong/meta-fusion-based-method. | ||||
| Address | 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 | |||
| Notes | ISE; 600.157 | Approved | no | ||
| Call Number | Admin @ si @ GYW2022 | Serial | 3692 | ||
| 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 | Chenshen Wu; Luis Herranz; Xialei Liu; Joost Van de Weijer; Bogdan Raducanu | ||||
| Title |
Memory Replay GANs: Learning to Generate New Categories without Forgetting | Type | Conference Article | ||
| Year | 2018 | Publication | 32nd Annual Conference on Neural Information Processing Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 5966-5976 | ||
| Keywords | |||||
| Abstract | Previous works on sequential learning address the problem of forgetting in discriminative models. In this paper we consider the case of generative models. In particular, we investigate generative adversarial networks (GANs) in the task of learning new categories in a sequential fashion. We first show that sequential fine tuning renders the network unable to properly generate images from previous categories (ie forgetting). Addressing this problem, we propose Memory Replay GANs (MeRGANs), a conditional GAN framework that integrates a memory replay generator. We study two methods to prevent forgetting by leveraging these replays, namely joint training with replay and replay alignment. Qualitative and quantitative experimental results in MNIST, SVHN and LSUN datasets show that our memory replay approach can generate competitive images while significantly mitigating the forgetting of previous categories. | ||||
| Address | Montreal; Canada; December 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 | NIPS | ||
| Notes | LAMP; 600.106; 600.109; 602.200; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ WHL2018 | Serial | 3249 | ||
| Permanent link to this record | |||||
| Author | Fernando Vilariño; Dan Norton; Onur Ferhat | ||||
| Title |
Memory Fields: DJs in the Library | Type | Conference Article | ||
| Year | 2015 | Publication | 21 st Symposium of Electronic Arts | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Vancouver; Canada; August 2015 | ||||
| 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 | ISEA | ||
| Notes | ;SIAI | Approved | no | ||
| Call Number | Admin @ si @VNF2015 | Serial | 2800 | ||
| Permanent link to this record | |||||
| Author | Dan Norton; Fernando Vilariño; Onur Ferhat | ||||
| Title |
Memory Field – Creative Engagement in Digital Collections | Type | Conference Article | ||
| Year | 2015 | Publication | Internet Librarian International Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | “Memory Fields” is a trans-disciplinary project aiming at the (re)valorisation of digital collections.Its main deliverable is an interface for a dual screen installation, used to access and mix the public library digital collections. The collections being used in this case are a collection of digitised posters from the Spanish Civil War, belonging to the Arxiu General de Catalunya, and a collection of field recordings made by Dan Norton. The system generates visualisations, and the images and sounds are mixed together using narrative primitives of video dj. Users contribute to the digital collections by adding personal memories and observations. The comments and recollections appear as flowers growing in a “memory field” and memories remain public in a Twitter feed (@Memoryfields). | ||||
| Address | London; UK; October 2015 | ||||
| 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 | ILI | ||
| Notes | MV;SIAI | Approved | no | ||
| Call Number | Admin @ si @NVF2015 | Serial | 2796 | ||
| Permanent link to this record | |||||
| Author | Cristhian A. Aguilera-Carrasco; C. Aguilera; Angel Sappa | ||||
| Title |
Melamine Faced Panels Defect Classification beyond the Visible Spectrum | Type | Journal Article | ||
| Year | 2018 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 18 | Issue | 11 | Pages | 1-10 |
| Keywords | industrial application; infrared; machine learning | ||||
| Abstract | In this work, we explore the use of images from different spectral bands to classify defects in melamine faced panels, which could appear through the production process. Through experimental evaluation, we evaluate the use of images from the visible (VS), near-infrared (NIR), and long wavelength infrared (LWIR), to classify the defects using a feature descriptor learning approach together with a support vector machine classifier. Two descriptors were evaluated, Extended Local Binary Patterns (E-LBP) and SURF using a Bag of Words (BoW) representation. The evaluation was carried on with an image set obtained during this work, which contained five different defect categories that currently occurs in the industry. Results show that using images from beyond the visual spectrum helps to improve classification performance in contrast with a single visible spectrum solution. | ||||
| 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.122 | Approved | no | ||
| Call Number | Admin @ si @ AAS2018 | Serial | 3191 | ||
| Permanent link to this record | |||||
| Author | David Lloret | ||||
| Title |
Medical Image Registration Based on a Creaseress Measure. | Type | Book Whole | ||
| Year | 2002 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Place of Publication | Editor | Joan Serrat | ||
| 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 @ Llo2002 | Serial | 321 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
| Title |
Median Graphs: A Genetic Approach based on New Theoretical Properties | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 42 | Issue | 9 | Pages | 2003–2012 |
| Keywords | Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition | ||||
| Abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
| 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 | DAG @ dag @ FVS2009b | Serial | 1167 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
| Title |
Median graph: A new exact algorithm using a distance based on the maximum common subgraph | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 30 | Issue | 5 | Pages | 579–588 |
| Keywords | |||||
| Abstract | Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier Science Inc. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ FVS2009a | Serial | 1114 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; I. Bardaji; Ernest Valveny; Dimosthenis Karatzas; Horst Bunke | ||||
| Title |
Median Graph Computation by Means of Graph Embedding into Vector Spaces | Type | Book Chapter | ||
| Year | 2013 | Publication | Graph Embedding for Pattern Analysis | Abbreviated Journal | |
| Volume | Issue | Pages | 45-72 | ||
| Keywords | |||||
| Abstract | In pattern recognition [8, 14], a key issue to be addressed when designing a system is how to represent input patterns. Feature vectors is a common option. That is, a set of numerical features describing relevant properties of the pattern are computed and arranged in a vector form. The main advantages of this kind of representation are computational simplicity and a well sound mathematical foundation. Thus, a large number of operations are available to work with vectors and a large repository of algorithms for pattern analysis and classification exist. However, the simple structure of feature vectors might not be the best option for complex patterns where nonnumerical features or relations between different parts of the pattern become relevant. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer New York | Place of Publication | Editor | Yun Fu; Yungian Ma | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-4614-4456-5 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ FBV2013 | Serial | 2421 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
| Title |
Median Graph Computation by means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subraph | Type | Conference Article | ||
| Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 5524 | Issue | Pages | 346–353 | |
| Keywords | |||||
| Abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present a new genetic algorithm for the median graph computation. A set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity, show that we obtain good approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
| Address | Póvoa de Varzim, Portugal | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-02171-8 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ FVS2009c | Serial | 1174 | ||
| Permanent link to this record | |||||
| Author | H. Martin ; Jens Fagertun; Sergio Vera; Debora Gil | ||||
| Title |
Medial structure generation for registration of anatomical structures | Type | Book Chapter | ||
| Year | 2017 | Publication | Skeletonization, Theory, Methods and Applications | Abbreviated Journal | |
| Volume | 11 | 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; 600.096; 600.075; 600.145 | Approved | no | ||
| Call Number | Admin @ si @ MFV2017a | Serial | 2935 | ||
| Permanent link to this record | |||||
| Author | David Roche; Debora Gil; Jesus Giraldo | ||||
| Title |
Mechanistic analysis of the function of agonists and allosteric modulators: Reconciling two-state and operational models | Type | Journal Article | ||
| Year | 2013 | Publication | British Journal of Pharmacology | Abbreviated Journal | BJP |
| Volume | 169 | Issue | 6 | Pages | 1189-202 |
| Keywords | |||||
| Abstract | Two-state and operational models of both agonism and allosterism are compared to identify and characterize common pharmacological parameters. To account for the receptor-dependent basal response, constitutive receptor activity is considered in the operational models. By arranging two-state models as the fraction of active receptors and operational models as the fractional response relative to the maximum effect of the system, a one-by-one correspondence between parameters is found. The comparative analysis allows a better understanding of complex allosteric interactions. In particular, the inclusion of constitutive receptor activity in the operational model of allosterism allows the characterization of modulators able to lower the basal response of the system; that is, allosteric modulators with negative intrinsic efficacy. Theoretical simulations and overall goodness of fit of the models to simulated data suggest that it is feasible to apply the models to experimental data and constitute one step forward in receptor theory formalism. | ||||
| 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.044; 605.203 | Approved | no | ||
| Call Number | IAM @ iam @ RGG2013b | Serial | 2195 | ||
| Permanent link to this record | |||||