| Home | [11–20] << 21 22 23 24 25 26 27 28 29 30 >> [31–40] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Lluis Gomez; Andres Mafla; Marçal Rusiñol; Dimosthenis Karatzas | ||||
| Title | Single Shot Scene Text Retrieval | Type | Conference Article | ||
| Year | 2018 | Publication  |
15th European Conference on Computer Vision | Abbreviated Journal | |
| Volume | 11218 | Issue | Pages | 728-744 | |
| Keywords | Image retrieval; Scene text; Word spotting; Convolutional Neural Networks; Region Proposals Networks; PHOC | ||||
| Abstract | Textual information found in scene images provides high level semantic information about the image and its context and it can be leveraged for better scene understanding. In this paper we address the problem of scene text retrieval: given a text query, the system must return all images containing the queried text. The novelty of the proposed model consists in the usage of a single shot CNN architecture that predicts at the same time bounding boxes and a compact text representation of the words in them. In this way, the text based image retrieval task can be casted as a simple nearest neighbor search of the query text representation over the outputs of the CNN over the entire image
database. Our experiments demonstrate that the proposed architecture outperforms previous state-of-the-art while it offers a significant increase in processing speed. |
||||
| Address | Munich; September 2018 | ||||
| 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 | ECCV | ||
| Notes | DAG; 600.084; 601.338; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ GMR2018 | Serial | 3143 | ||
| Permanent link to this record | |||||
| Author | Felipe Codevilla; Antonio Lopez; Vladlen Koltun; Alexey Dosovitskiy | ||||
| Title | On Offline Evaluation of Vision-based Driving Models | Type | Conference Article | ||
| Year | 2018 | Publication |
15th European Conference on Computer Vision | Abbreviated Journal | |
| Volume | 11219 | Issue | Pages | 246-262 | |
| Keywords | Autonomous driving; deep learning | ||||
| Abstract | Autonomous driving models should ideally be evaluated by deploying
them on a fleet of physical vehicles in the real world. Unfortunately, this approach is not practical for the vast majority of researchers. An attractive alternative is to evaluate models offline, on a pre-collected validation dataset with ground truth annotation. In this paper, we investigate the relation between various online and offline metrics for evaluation of autonomous driving models. We find that offline prediction error is not necessarily correlated with driving quality, and two models with identical prediction error can differ dramatically in their driving performance. We show that the correlation of offline evaluation with driving quality can be significantly improved by selecting an appropriate validation dataset and suitable offline metrics. |
||||
| Address | Munich; September 2018 | ||||
| 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 | ECCV | ||
| Notes | ADAS; 600.124; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ CLK2018 | Serial | 3162 | ||
| Permanent link to this record | |||||
| Author | Marc Oliu; Javier Selva; Sergio Escalera | ||||
| Title | Folded Recurrent Neural Networks for Future Video Prediction | Type | Conference Article | ||
| Year | 2018 | Publication |
15th European Conference on Computer Vision | Abbreviated Journal | |
| Volume | 11218 | Issue | Pages | 745-761 | |
| Keywords | |||||
| Abstract | Future video prediction is an ill-posed Computer Vision problem that recently received much attention. Its main challenges are the high variability in video content, the propagation of errors through time, and the non-specificity of the future frames: given a sequence of past frames there is a continuous distribution of possible futures. This work introduces bijective Gated Recurrent Units, a double mapping between the input and output of a GRU layer. This allows for recurrent auto-encoders with state sharing between encoder and decoder, stratifying the sequence representation and helping to prevent capacity problems. We show how with this topology only the encoder or decoder needs to be applied for input encoding and prediction, respectively. This reduces the computational cost and avoids re-encoding the predictions when generating a sequence of frames, mitigating the propagation of errors. Furthermore, it is possible to remove layers from an already trained model, giving an insight to the role performed by each layer and making the model more explainable. We evaluate our approach on three video datasets, outperforming state of the art prediction results on MMNIST and UCF101, and obtaining competitive results on KTH with 2 and 3 times less memory usage and computational cost than the best scored approach. | ||||
| Address | Munich; September 2018 | ||||
| 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 | ECCV | ||
| Notes | HUPBA; no menciona | Approved | no | ||
| Call Number | Admin @ si @ OSE2018 | Serial | 3204 | ||
| Permanent link to this record | |||||
| Author | Ciprian Corneanu; Meysam Madadi; Sergio Escalera | ||||
| Title | Deep Structure Inference Network for Facial Action Unit Recognition | Type | Conference Article | ||
| Year | 2018 | Publication |
15th European Conference on Computer Vision | Abbreviated Journal | |
| Volume | 11216 | Issue | Pages | 309-324 | |
| Keywords | Computer Vision; Machine Learning; Deep Learning; Facial Expression Analysis; Facial Action Units; Structure Inference | ||||
| Abstract | Facial expressions are combinations of basic components called Action Units (AU). Recognizing AUs is key for general facial expression analysis. Recently, efforts in automatic AU recognition have been dedicated to learning combinations of local features and to exploiting correlations between AUs. We propose a deep neural architecture that tackles both problems by combining learned local and global features in its initial stages and replicating a message passing algorithm between classes similar to a graphical model inference approach in later stages. We show that by training the model end-to-end with increased supervision we improve state-of-the-art by 5.3% and 8.2% performance on BP4D and DISFA datasets, respectively. | ||||
| Address | Munich; September 2018 | ||||
| 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 | ECCV | ||
| Notes | HUPBA; no proj | Approved | no | ||
| Call Number | Admin @ si @ CME2018 | Serial | 3205 | ||
| Permanent link to this record | |||||
| Author | Raul Gomez; Lluis Gomez; Jaume Gibert; Dimosthenis Karatzas | ||||
| Title | Learning to Learn from Web Data through Deep Semantic Embeddings | Type | Conference Article | ||
| Year | 2018 | Publication |
15th European Conference on Computer Vision Workshops | Abbreviated Journal | |
| Volume | 11134 | Issue | Pages | 514-529 | |
| Keywords | |||||
| Abstract | In this paper we propose to learn a multimodal image and text embedding from Web and Social Media data, aiming to leverage the semantic knowledge learnt in the text domain and transfer it to a visual model for semantic image retrieval. We demonstrate that the pipeline can learn from images with associated text without supervision and perform a thourough analysis of five different text embeddings in three different benchmarks. We show that the embeddings learnt with Web and Social Media data have competitive performances over supervised methods in the text based image retrieval task, and we clearly outperform state of the art in the MIRFlickr dataset when training in the target data. Further we demonstrate how semantic multimodal image retrieval can be performed using the learnt embeddings, going beyond classical instance-level retrieval problems. Finally, we present a new dataset, InstaCities1M, composed by Instagram images and their associated texts that can be used for fair comparison of image-text embeddings. | ||||
| Address | Munich; Alemanya; September 2018 | ||||
| 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 | ECCVW | ||
| Notes | DAG; 600.129; 601.338; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ GGG2018a | Serial | 3175 | ||
| Permanent link to this record | |||||
| Author | Raul Gomez; Lluis Gomez; Jaume Gibert; Dimosthenis Karatzas | ||||
| Title | Learning from# Barcelona Instagram data what Locals and Tourists post about its Neighbourhoods | Type | Conference Article | ||
| Year | 2018 | Publication |
15th European Conference on Computer Vision Workshops | Abbreviated Journal | |
| Volume | 11134 | Issue | Pages | 530-544 | |
| Keywords | |||||
| Abstract | Massive tourism is becoming a big problem for some cities, such as Barcelona, due to its concentration in some neighborhoods. In this work we gather Instagram data related to Barcelona consisting on images-captions pairs and, using the text as a supervisory signal, we learn relations between images, words and neighborhoods. Our goal is to learn which visual elements appear in photos when people is posting about each neighborhood. We perform a language separate treatment of the data and show that it can be extrapolated to a tourists and locals separate analysis, and that tourism is reflected in Social Media at a neighborhood level. The presented pipeline allows analyzing the differences between the images that tourists and locals associate to the different neighborhoods. The proposed method, which can be extended to other cities or subjects, proves that Instagram data can be used to train multi-modal (image and text) machine learning models that are useful to analyze publications about a city at a neighborhood level. We publish the collected dataset, InstaBarcelona and the code used in the analysis. | ||||
| Address | Munich; Alemanya; September 2018 | ||||
| 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 | ECCVW | ||
| Notes | DAG; 600.129; 601.338; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ GGG2018b | Serial | 3176 | ||
| Permanent link to this record | |||||
| Author | Sergi Garcia Bordils; George Tom; Sangeeth Reddy; Minesh Mathew; Marçal Rusiñol; C.V. Jawahar; Dimosthenis Karatzas | ||||
| Title | Read While You Drive-Multilingual Text Tracking on the Road | Type | Conference Article | ||
| Year | 2022 | Publication |
15th IAPR International workshop on document analysis systems | Abbreviated Journal | |
| Volume | 13237 | Issue | Pages | 756–770 | |
| Keywords | |||||
| Abstract | Visual data obtained during driving scenarios usually contain large amounts of text that conveys semantic information necessary to analyse the urban environment and is integral to the traffic control plan. Yet, research on autonomous driving or driver assistance systems typically ignores this information. To advance research in this direction, we present RoadText-3K, a large driving video dataset with fully annotated text. RoadText-3K is three times bigger than its predecessor and contains data from varied geographical locations, unconstrained driving conditions and multiple languages and scripts. We offer a comprehensive analysis of tracking by detection and detection by tracking methods exploring the limits of state-of-the-art text detection. Finally, we propose a new end-to-end trainable tracking model that yields state-of-the-art results on this challenging dataset. Our experiments demonstrate the complexity and variability of RoadText-3K and establish a new, realistic benchmark for scene text tracking in the wild. | ||||
| Address | La Rochelle; France; May 2022 | ||||
| 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 | 978-3-031-06554-5 | Medium | ||
| Area | Expedition | Conference | DAS | ||
| Notes | DAG; 600.155; 611.022; 611.004 | Approved | no | ||
| Call Number | Admin @ si @ GTR2022 | Serial | 3783 | ||
| Permanent link to this record | |||||
| Author | Jaume Gibert; Ernest Valveny; Horst Bunke | ||||
| Title | Graph of Words Embedding for Molecular Structure-Activity Relationship Analysis | Type | Conference Article | ||
| Year | 2010 | Publication |
15th Iberoamerican Congress on Pattern Recognition | Abbreviated Journal | |
| Volume | 6419 | Issue | Pages | 30–37 | |
| Keywords | |||||
| Abstract | Structure-Activity relationship analysis aims at discovering chemical activity of molecular compounds based on their structure. In this article we make use of a particular graph representation of molecules and propose a new graph embedding procedure to solve the problem of structure-activity relationship analysis. The embedding is essentially an arrangement of a molecule in the form of a vector by considering frequencies of appearing atoms and frequencies of covalent bonds between them. Results on two benchmark databases show the effectiveness of the proposed technique in terms of recognition accuracy while avoiding high operational costs in the transformation. | ||||
| Address | Sao Paulo, Brazil | ||||
| 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 | 0302-9743 | ISBN | 978-3-642-16686-0 | Medium | |
| Area | Expedition | Conference | CIARP | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ GVB2010 | Serial | 1462 | ||
| Permanent link to this record | |||||
| Author | Albert Clapes; Julio C. S. Jacques Junior; Carla Morral; Sergio Escalera | ||||
| Title | ChaLearn LAP 2020 Challenge on Identity-preserved Human Detection: Dataset and Results | Type | Conference Article | ||
| Year | 2020 | Publication |
15th IEEE International Conference on Automatic Face and Gesture Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 801-808 | ||
| Keywords | |||||
| Abstract | This paper summarizes the ChaLearn Looking at People 2020 Challenge on Identity-preserved Human Detection (IPHD). For the purpose, we released a large novel dataset containing more than 112K pairs of spatiotemporally aligned depth and thermal frames (and 175K instances of humans) sampled from 780 sequences. The sequences contain hundreds of non-identifiable people appearing in a mix of in-the-wild and scripted scenarios recorded in public and private places. The competition was divided into three tracks depending on the modalities exploited for the detection: (1) depth, (2) thermal, and (3) depth-thermal fusion. Color was also captured but only used to facilitate the groundtruth annotation. Still the temporal synchronization of three sensory devices is challenging, so bad temporal matches across modalities can occur. Hence, the labels provided should considered “weak”, although test frames were carefully selected to minimize this effect and ensure the fairest comparison of the participants’ results. Despite this added difficulty, the results got by the participants demonstrate current fully-supervised methods can deal with that and achieve outstanding detection performance when measured in terms of AP@0.50. | ||||
| Address | Virtual; November 2020 | ||||
| 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 | FG | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ CJM2020 | Serial | 3501 | ||
| Permanent link to this record | |||||
| Author | Josep Famadas; Meysam Madadi; Cristina Palmero; Sergio Escalera | ||||
| Title | Generative Video Face Reenactment by AUs and Gaze Regularization | Type | Conference Article | ||
| Year | 2020 | Publication |
15th IEEE International Conference on Automatic Face and Gesture Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 444-451 | ||
| Keywords | |||||
| Abstract | In this work, we propose an encoder-decoder-like architecture to perform face reenactment in image sequences. Our goal is to transfer the training subject identity to a given test subject. We regularize face reenactment by facial action unit intensity and 3D gaze vector regression. This way, we enforce the network to transfer subtle facial expressions and eye dynamics, providing a more lifelike result. The proposed encoder-decoder receives as input the previous sequence frame stacked to the current frame image of facial landmarks. Thus, the generated frames benefit from appearance and geometry, while keeping temporal coherence for the generated sequence. At test stage, a new target subject with the facial performance of the source subject and the appearance of the training subject is reenacted. Principal component analysis is applied to project the test subject geometry to the closest training subject geometry before reenactment. Evaluation of our proposal shows faster convergence, and more accurate and realistic results in comparison to other architectures without action units and gaze regularization. | ||||
| Address | Virtual; November 2020 | ||||
| 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 | FG | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ FMP2020 | Serial | 3517 | ||
| Permanent link to this record | |||||
| Author | Fares Alnajar; Theo Gevers; Roberto Valenti; Sennay Ghebreab | ||||
| Title | Calibration-free Gaze Estimation using Human Gaze Patterns | Type | Conference Article | ||
| Year | 2013 | Publication |
15th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 137-144 | ||
| Keywords | |||||
| Abstract | We present a novel method to auto-calibrate gaze estimators based on gaze patterns obtained from other viewers. Our method is based on the observation that the gaze patterns of humans are indicative of where a new viewer will look at [12]. When a new viewer is looking at a stimulus, we first estimate a topology of gaze points (initial gaze points). Next, these points are transformed so that they match the gaze patterns of other humans to find the correct gaze points. In a flexible uncalibrated setup with a web camera and no chin rest, the proposed method was tested on ten subjects and ten images. The method estimates the gaze points after looking at a stimulus for a few seconds with an average accuracy of 4.3 im. Although the reported performance is lower than what could be achieved with dedicated hardware or calibrated setup, the proposed method still provides a sufficient accuracy to trace the viewer attention. This is promising considering the fact that auto-calibration is done in a flexible setup , without the use of a chin rest, and based only on a few seconds of gaze initialization data. To the best of our knowledge, this is the first work to use human gaze patterns in order to auto-calibrate gaze estimators. | ||||
| Address | Sydney | ||||
| 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 | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ AGV2013 | Serial | 2365 | ||
| Permanent link to this record | |||||
| Author | Hamdi Dibeklioglu; Albert Ali Salah; Theo Gevers | ||||
| Title | Like Father, Like Son: Facial Expression Dynamics for Kinship Verification | Type | Conference Article | ||
| Year | 2013 | Publication |
15th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 1497-1504 | ||
| Keywords | |||||
| Abstract | Kinship verification from facial appearance is a difficult problem. This paper explores the possibility of employing facial expression dynamics in this problem. By using features that describe facial dynamics and spatio-temporal appearance over smile expressions, we show that it is possible to improve the state of the art in this problem, and verify that it is indeed possible to recognize kinship by resemblance of facial expressions. The proposed method is tested on different kin relationships. On the average, 72.89% verification accuracy is achieved on spontaneous smiles. | ||||
| Address | Sydney | ||||
| 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 | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ DSG2013 | Serial | 2366 | ||
| Permanent link to this record | |||||
| Author | Javier Marin; David Vazquez; Antonio Lopez; Jaume Amores; Bastian Leibe | ||||
| Title | Random Forests of Local Experts for Pedestrian Detection | Type | Conference Article | ||
| Year | 2013 | Publication |
15th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 2592 - 2599 | ||
| Keywords | ADAS; Random Forest; Pedestrian Detection | ||||
| Abstract | Pedestrian detection is one of the most challenging tasks in computer vision, and has received a lot of attention in the last years. Recently, some authors have shown the advantages of using combinations of part/patch-based detectors in order to cope with the large variability of poses and the existence of partial occlusions. In this paper, we propose a pedestrian detection method that efficiently combines multiple local experts by means of a Random Forest ensemble. The proposed method works with rich block-based representations such as HOG and LBP, in such a way that the same features are reused by the multiple local experts, so that no extra computational cost is needed with respect to a holistic method. Furthermore, we demonstrate how to integrate the proposed approach with a cascaded architecture in order to achieve not only high accuracy but also an acceptable efficiency. In particular, the resulting detector operates at five frames per second using a laptop machine. We tested the proposed method with well-known challenging datasets such as Caltech, ETH, Daimler, and INRIA. The method proposed in this work consistently ranks among the top performers in all the datasets, being either the best method or having a small difference with the best one. | ||||
| Address | Sydney; Australia; December 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1550-5499 | ISBN | Medium | ||
| Area | Expedition | Conference | ICCV | ||
| Notes | ADAS; 600.057; 600.054 | Approved | no | ||
| Call Number | ADAS @ adas @ MVL2013 | Serial | 2333 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny | ||||
| Title | Handwritten Word Spotting with Corrected Attributes | Type | Conference Article | ||
| Year | 2013 | Publication |
15th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 1017-1024 | ||
| Keywords | |||||
| Abstract | We propose an approach to multi-writer word spotting, where the goal is to find a query word in a dataset comprised of document images. We propose an attributes-based approach that leads to a low-dimensional, fixed-length representation of the word images that is fast to compute and, especially, fast to compare. This approach naturally leads to an unified representation of word images and strings, which seamlessly allows one to indistinctly perform query-by-example, where the query is an image, and query-by-string, where the query is a string. We also propose a calibration scheme to correct the attributes scores based on Canonical Correlation Analysis that greatly improves the results on a challenging dataset. We test our approach on two public datasets showing state-of-the-art results. | ||||
| Address | Sydney; Australia; December 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 | 1550-5499 | ISBN | Medium | ||
| Area | Expedition | Conference | ICCV | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ AGF2013 | Serial | 2327 | ||
| Permanent link to this record | |||||
| Author | Gemma Roig; Xavier Boix; R. de Nijs; Sebastian Ramos; K. Kühnlenz; Luc Van Gool | ||||
| Title | Active MAP Inference in CRFs for Efficient Semantic Segmentation | Type | Conference Article | ||
| Year | 2013 | Publication |
15th IEEE International Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 2312 - 2319 | ||
| Keywords | Semantic Segmentation | ||||
| Abstract | Most MAP inference algorithms for CRFs optimize an energy function knowing all the potentials. In this paper, we focus on CRFs where the computational cost of instantiating the potentials is orders of magnitude higher than MAP inference. This is often the case in semantic image segmentation, where most potentials are instantiated by slow classifiers fed with costly features. We introduce Active MAP inference 1) to on-the-fly select a subset of potentials to be instantiated in the energy function, leaving the rest of the parameters of the potentials unknown, and 2) to estimate the MAP labeling from such incomplete energy function. Results for semantic segmentation benchmarks, namely PASCAL VOC 2010 [5] and MSRC-21 [19], show that Active MAP inference achieves similar levels of accuracy but with major efficiency gains. | ||||
| Address | Sydney; Australia; December 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 | 1550-5499 | ISBN | Medium | ||
| Area | Expedition | Conference | ICCV | ||
| Notes | ADAS; 600.057 | Approved | no | ||
| Call Number | ADAS @ adas @ RBN2013 | Serial | 2377 | ||
| Permanent link to this record | |||||