| Home | << 1 2 3 4 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Mikkel Thogersen; Sergio Escalera; Jordi Gonzalez; Thomas B. Moeslund | ||||
Title  |
Segmentation of RGB-D Indoor scenes by Stacking Random Forests and Conditional Random Fields | Type | Journal Article | ||
| Year | 2016 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 80 | Issue | Pages | 208–215 | |
| Keywords | |||||
| Abstract | This paper proposes a technique for RGB-D scene segmentation using Multi-class
Multi-scale Stacked Sequential Learning (MMSSL) paradigm. Following recent trends in state-of-the-art, a base classifier uses an initial SLIC segmentation to obtain superpixels which provide a diminution of data while retaining object boundaries. A series of color and depth features are extracted from the superpixels, and are used in a Conditional Random Field (CRF) to predict superpixel labels. Furthermore, a Random Forest (RF) classifier using random offset features is also used as an input to the CRF, acting as an initial prediction. As a stacked classifier, another Random Forest is used acting on a spatial multi-scale decomposition of the CRF confidence map to correct the erroneous labels assigned by the previous classifier. The model is tested on the popular NYU-v2 dataset. The approach shows that simple multi-modal features with the power of the MMSSL paradigm can achieve better performance than state of the art results on the same dataset. |
||||
| 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; ISE;MILAB; 600.098; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ TEG2016 | Serial | 2843 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title |
Separability of Ternary Codes for Sparse Designs of Error-Correcting Output Codes | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 30 | Issue | 3 | Pages | 285–297 |
| Keywords | |||||
| Abstract | Error Correcting Output Codes (ECOC) represent a successful framework to deal with multi-class categorization problems based on combining binary classifiers. In this paper, we present a new formulation of the ternary ECOC distance and the error-correcting capabilities in the ternary ECOC framework. Based on the new measure, we stress on how to design coding matrices preventing codification ambiguity and propose a new Sparse Random coding matrix with ternary distance maximization. The results on the UCI Repository and in a real speed traffic categorization problem show that when the coding design satisfies the new ternary measures, significant performance improvement is obtained independently of the decoding strategy applied. | ||||
| 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;HuPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2009a | Serial | 1153 | ||
| Permanent link to this record | |||||
| Author | Thanh Nam Le; Muhammad Muzzamil Luqman; Anjan Dutta; Pierre Heroux; Christophe Rigaud; Clement Guerin; Pasquale Foggia; Jean Christophe Burie; Jean Marc Ogier; Josep Llados; Sebastien Adam | ||||
| Title |
Subgraph spotting in graph representations of comic book images | Type | Journal Article | ||
| Year | 2018 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 112 | Issue | Pages | 118-124 | |
| Keywords | Attributed graph; Region adjacency graph; Graph matching; Graph isomorphism; Subgraph isomorphism; Subgraph spotting; Graph indexing; Graph retrieval; Query by example; Dataset and comic book images | ||||
| Abstract | Graph-based representations are the most powerful data structures for extracting, representing and preserving the structural information of underlying data. Subgraph spotting is an interesting research problem, especially for studying and investigating the structural information based content-based image retrieval (CBIR) and query by example (QBE) in image databases. In this paper we address the problem of lack of freely available ground-truthed datasets for subgraph spotting and present a new dataset for subgraph spotting in graph representations of comic book images (SSGCI) with its ground-truth and evaluation protocol. Experimental results of two state-of-the-art methods of subgraph spotting are presented on the new SSGCI dataset. | ||||
| 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; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ LLD2018 | Serial | 3150 | ||
| Permanent link to this record | |||||
| Author | A. Pujol; Jordi Vitria; Felipe Lumbreras; Juan J. Villanueva | ||||
| Title |
Topological principal component analysis for face encoding and recognition | Type | Journal Article | ||
| Year | 2001 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 22 | Issue | 6-7 | Pages | 769–776 |
| Keywords | |||||
| Abstract | IF: 0.552 | ||||
| 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;OR;MV | Approved | no | ||
| Call Number | ADAS @ adas @ PVL2001 | Serial | 155 | ||
| Permanent link to this record | |||||
| Author | Zhengying Liu; Zhen Xu; Sergio Escalera; Isabelle Guyon; Julio C. S. Jacques Junior; Meysam Madadi; Adrien Pavao; Sebastien Treguer; Wei-Wei Tu | ||||
| Title |
Towards automated computer vision: analysis of the AutoCV challenges 2019 | Type | Journal Article | ||
| Year | 2020 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 135 | Issue | Pages | 196-203 | |
| Keywords | Computer vision; AutoML; Deep learning | ||||
| Abstract | We present the results of recent challenges in Automated Computer Vision (AutoCV, renamed here for clarity AutoCV1 and AutoCV2, 2019), which are part of a series of challenge on Automated Deep Learning (AutoDL). These two competitions aim at searching for fully automated solutions for classification tasks in computer vision, with an emphasis on any-time performance. The first competition was limited to image classification while the second one included both images and videos. Our design imposed to the participants to submit their code on a challenge platform for blind testing on five datasets, both for training and testing, without any human intervention whatsoever. Winning solutions adopted deep learning techniques based on already published architectures, such as AutoAugment, MobileNet and ResNet, to reach state-of-the-art performance in the time budget of the challenge (only 20 minutes of GPU time). The novel contributions include strategies to deliver good preliminary results at any time during the learning process, such that a method can be stopped early and still deliver good performance. This feature is key for the adoption of such techniques by data analysts desiring to obtain rapidly preliminary results on large datasets and to speed up the development process. The soundness of our design was verified in several aspects: (1) Little overfitting of the on-line leaderboard providing feedback on 5 development datasets was observed, compared to the final blind testing on the 5 (separate) final test datasets, suggesting that winning solutions might generalize to other computer vision classification tasks; (2) Error bars on the winners’ performance allow us to say with confident that they performed significantly better than the baseline solutions we provided; (3) The ranking of participants according to the any-time metric we designed, namely the Area under the Learning Curve, was different from that of the fixed-time metric, i.e. AUC at the end of the fixed time budget. We released all winning solutions under open-source licenses. At the end of the AutoDL challenge series, all data of the challenge will be made publicly available, thus providing a collection of uniformly formatted datasets, which can serve to conduct further research, particularly on meta-learning. | ||||
| 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; no proj | Approved | no | ||
| Call Number | Admin @ si @ LXE2020 | Serial | 3427 | ||
| Permanent link to this record | |||||
| Author | Eduardo Aguilar; Petia Radeva | ||||
| Title |
Uncertainty-aware integration of local and flat classifiers for food recognition | Type | Journal Article | ||
| Year | 2020 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 136 | Issue | Pages | 237-243 | |
| Keywords | |||||
| Abstract | Food image recognition has recently attracted the attention of many researchers, due to the challenging problem it poses, the ease collection of food images, and its numerous applications to health and leisure. In real applications, it is necessary to analyze and recognize thousands of different foods. For this purpose, we propose a novel prediction scheme based on a class hierarchy that considers local classifiers, in addition to a flat classifier. In order to make a decision about which approach to use, we define different criteria that take into account both the analysis of the Epistemic Uncertainty estimated from the ‘children’ classifiers and the prediction from the ‘parent’ classifier. We evaluate our proposal using three Uncertainty estimation methods, tested on two public food datasets. The results show that the proposed method reduces parent-child error propagation in hierarchical schemes and improves classification results compared to the single flat classifier, meanwhile maintains good performance regardless the Uncertainty estimation method chosen. | ||||
| 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 proj | Approved | no | ||
| Call Number | Admin @ si @ AgR2020 | Serial | 3525 | ||
| Permanent link to this record | |||||
| Author | Ivet Rafegas; Maria Vanrell; Luis A Alexandre; G. Arias | ||||
| Title |
Understanding trained CNNs by indexing neuron selectivity | Type | Journal Article | ||
| Year | 2020 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 136 | Issue | Pages | 318-325 | |
| Keywords | |||||
| Abstract | The impressive performance of Convolutional Neural Networks (CNNs) when solving different vision problems is shadowed by their black-box nature and our consequent lack of understanding of the representations they build and how these representations are organized. To help understanding these issues, we propose to describe the activity of individual neurons by their Neuron Feature visualization and quantify their inherent selectivity with two specific properties. We explore selectivity indexes for: an image feature (color); and an image label (class membership). Our contribution is a framework to seek or classify neurons by indexing on these selectivity properties. It helps to find color selective neurons, such as a red-mushroom neuron in layer Conv4 or class selective neurons such as dog-face neurons in layer Conv5 in VGG-M, and establishes a methodology to derive other selectivity properties. Indexing on neuron selectivity can statistically draw how features and classes are represented through layers in a moment when the size of trained nets is growing and automatic tools to index neurons can be helpful. | ||||
| 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 | CIC; 600.087; 600.140; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ RVL2019 | Serial | 3310 | ||
| Permanent link to this record | |||||
| Author | Jose Antonio Rodriguez; Florent Perronnin; Gemma Sanchez; Josep Llados | ||||
| Title |
Unsupervised writer adaptation of whole-word HMMs with application to word-spotting | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 8 | Pages | 742–749 |
| Keywords | Word-spotting; Handwriting recognition; Writer adaptation; Hidden Markov model; Document analysis | ||||
| Abstract | In this paper we propose a novel approach for writer adaptation in a handwritten word-spotting task. The method exploits the fact that the semi-continuous hidden Markov model separates the word model parameters into (i) a codebook of shapes and (ii) a set of word-specific parameters.
Our main contribution is to employ this property to derive writer-specific word models by statistically adapting an initial universal codebook to each document. This process is unsupervised and does not even require the appearance of the keyword(s) in the searched document. Experimental results show an increase in performance when this adaptation technique is applied. To the best of our knowledge, this is the first work dealing with adaptation for word-spotting. The preliminary version of this paper obtained an IBM Best Student Paper Award at the 19th International Conference on Pattern Recognition. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | 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 @ RPS2010 | Serial | 1290 | ||
| Permanent link to this record | |||||
| Author | Cristina Cañero; Petia Radeva | ||||
| Title |
Vesselness enhancement diffusion | Type | Journal Article | ||
| Year | 2003 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 24 | Issue | 16 | Pages | 3141–3151 |
| Keywords | |||||
| Abstract | IF: 0.809 | ||||
| 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 | BCNPCL @ bcnpcl @ CaR2003 | Serial | 371 | ||
| Permanent link to this record | |||||
| Author | Xavier Otazu; Oriol Pujol | ||||
| Title |
Wavelet based approach to cluster analysis. Application on low dimensional data sets | Type | Journal Article | ||
| Year | 2006 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 27 | Issue | 14 | Pages | 1590–1605 |
| 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 | MILAB; CIC; HuPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ OtP2006 | Serial | 658 | ||
| Permanent link to this record | |||||