| Home | [201–210] << 211 212 213 214 215 216 217 218 219 220 >> [221–228] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Albert Gordo; Jose Antonio Rodriguez; Florent Perronnin; Ernest Valveny | ||||
| Title | Leveraging category-level labels for instance-level image retrieval | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages  |
3045-3052 | ||
| Keywords | |||||
| Abstract | In this article, we focus on the problem of large-scale instance-level image retrieval. For efficiency reasons, it is common to represent an image by a fixed-length descriptor which is subsequently encoded into a small number of bits. We note that most encoding techniques include an unsupervised dimensionality reduction step. Our goal in this work is to learn a better subspace in a supervised manner. We especially raise the following question: “can category-level labels be used to learn such a subspace?” To answer this question, we experiment with four learning techniques: the first one is based on a metric learning framework, the second one on attribute representations, the third one on Canonical Correlation Analysis (CCA) and the fourth one on Joint Subspace and Classifier Learning (JSCL). While the first three approaches have been applied in the past to the image retrieval problem, we believe we are the first to show the usefulness of JSCL in this context. In our experiments, we use ImageNet as a source of category-level labels and report retrieval results on two standard dataseis: INRIA Holidays and the University of Kentucky benchmark. Our experimental study shows that metric learning and attributes do not lead to any significant improvement in retrieval accuracy, as opposed to CCA and JSCL. As an example, we report on Holidays an increase in accuracy from 39.3% to 48.6% with 32-dimensional representations. Overall JSCL is shown to yield the best results. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GRP2012 | Serial | 2050 | ||
| Permanent link to this record | |||||
| Author | Mario Hernandez; Joao Sanchez; Jordi Vitria | ||||
| Title | Selected papers from Iberian Conference on Pattern Recognition and Image Analysis | Type | Book Whole | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | |
| Volume | 45 | Issue | 9 | Pages |
3047-3582 |
| 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 | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ HSV2012 | Serial | 2069 | ||
| Permanent link to this record | |||||
| Author | Mohammad Rouhani; Angel Sappa | ||||
| Title | Relaxing the 3L Algorithm for an Accurate Implicit Polynomial Fitting | Type | Conference Article | ||
| Year | 2010 | Publication | 23rd IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
3066-3072 | ||
| Keywords | |||||
| Abstract | This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty lies on the relaxation of the additional constraints, already imposed by the 3L algorithm. Hence, the accuracy of the final solution is increased due to the proper adjustment of the expected values in the aforementioned additional constraints. Although iterative, the proposed approach solves the fitting problem within a linear framework, which is independent of the threshold tuning. Experimental results, both in 2D and 3D, showing improvements in the accuracy of the fitting are presented. Comparisons with both state of the art algorithms and a geometric based one (non-linear fitting), which is used as a ground truth, are provided. | ||||
| Address | San Francisco; CA; USA; June 2010 | ||||
| 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 | 1063-6919 | ISBN | 978-1-4244-6984-0 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ RoS2010a | Serial | 1303 | ||
| Permanent link to this record | |||||
| Author | Sudeep Katakol; Basem Elbarashy; Luis Herranz; Joost Van de Weijer; Antonio Lopez | ||||
| Title | Distributed Learning and Inference with Compressed Images | Type | Journal Article | ||
| Year | 2021 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 30 | Issue | Pages |
3069 - 3083 | |
| Keywords | |||||
| Abstract | Modern computer vision requires processing large amounts of data, both while training the model and/or during inference, once the model is deployed. Scenarios where images are captured and processed in physically separated locations are increasingly common (e.g. autonomous vehicles, cloud computing). In addition, many devices suffer from limited resources to store or transmit data (e.g. storage space, channel capacity). In these scenarios, lossy image compression plays a crucial role to effectively increase the number of images collected under such constraints. However, lossy compression entails some undesired degradation of the data that may harm the performance of the downstream analysis task at hand, since important semantic information may be lost in the process. Moreover, we may only have compressed images at training time but are able to use original images at inference time, or vice versa, and in such a case, the downstream model suffers from covariate shift. In this paper, we analyze this phenomenon, with a special focus on vision-based perception for autonomous driving as a paradigmatic scenario. We see that loss of semantic information and covariate shift do indeed exist, resulting in a drop in performance that depends on the compression rate. In order to address the problem, we propose dataset restoration, based on image restoration with generative adversarial networks (GANs). Our method is agnostic to both the particular image compression method and the downstream task; and has the advantage of not adding additional cost to the deployed models, which is particularly important in resource-limited devices. The presented experiments focus on semantic segmentation as a challenging use case, cover a broad range of compression rates and diverse datasets, and show how our method is able to significantly alleviate the negative effects of compression on the downstream visual task. | ||||
| 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; ADAS; 600.120; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ KEH2021 | Serial | 3543 | ||
| Permanent link to this record | |||||
| Author | Jaume Gibert; Ernest Valveny; Horst Bunke | ||||
| Title | Graph Embedding in Vector Spaces by Node Attribute Statistics | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages |
3072-3083 |
| Keywords | Structural pattern recognition; Graph embedding; Data clustering; Graph classification | ||||
| Abstract | Graph-based representations are of broad use and applicability in pattern recognition. They exhibit, however, a major drawback with regards to the processing tools that are available in their domain. Graphembedding into vectorspaces is a growing field among the structural pattern recognition community which aims at providing a feature vector representation for every graph, and thus enables classical statistical learning machinery to be used on graph-based input patterns. In this work, we propose a novel embedding methodology for graphs with continuous nodeattributes and unattributed edges. The approach presented in this paper is based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives. We specifically deal with an important issue of this methodology, namely, the selection of a suitable set of representatives. In an experimental evaluation, we empirically show the advantages of this novel approach in the context of different classification problems using several databases 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 | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GVB2012a | Serial | 1992 | ||
| Permanent link to this record | |||||
| Author | P. Wang; V. Eglin; C. Garcia; C. Largeron; Josep Llados; Alicia Fornes | ||||
| Title | A Coarse-to-Fine Word Spotting Approach for Historical Handwritten Documents Based on Graph Embedding and Graph Edit Distance | Type | Conference Article | ||
| Year | 2014 | Publication | 22nd International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
3074 - 3079 | ||
| Keywords | word spotting; coarse-to-fine mechamism; graphbased representation; graph embedding; graph edit distance | ||||
| Abstract | Effective information retrieval on handwritten document images has always been a challenging task, especially historical ones. In the paper, we propose a coarse-to-fine handwritten word spotting approach based on graph representation. The presented model comprises both the topological and morphological signatures of the handwriting. Skeleton-based graphs with the Shape Context labelled vertexes are established for connected components. Each word image is represented as a sequence of graphs. Aiming at developing a practical and efficient word spotting approach for large-scale historical handwritten documents, a fast and coarse comparison is first applied to prune the regions that are not similar to the query based on the graph embedding methodology. Afterwards, the query and regions of interest are compared by graph edit distance based on the Dynamic Time Warping alignment. The proposed approach is evaluated on a public dataset containing 50 pages of historical marriage license records. The results show that the proposed approach achieves a compromise between efficiency and accuracy. | ||||
| Address | Stockholm; Sweden; August 2014 | ||||
| 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 | 1051-4651 | ISBN | Medium | ||
| Area | Expedition | Conference | ICPR | ||
| Notes | DAG; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ WEG2014a | Serial | 2515 | ||
| Permanent link to this record | |||||
| Author | Yagmur Gucluturk; Umut Guclu; Marc Perez; Hugo Jair Escalante; Xavier Baro; Isabelle Guyon; Carlos Andujar; Julio C. S. Jacques Junior; Meysam Madadi; Sergio Escalera | ||||
| Title | Visualizing Apparent Personality Analysis with Deep Residual Networks | Type | Conference Article | ||
| Year | 2017 | Publication | Chalearn Workshop on Action, Gesture, and Emotion Recognition: Large Scale Multimodal Gesture Recognition and Real versus Fake expressed emotions at ICCV | Abbreviated Journal | |
| Volume | Issue | Pages |
3101-3109 | ||
| Keywords | |||||
| Abstract | Automatic prediction of personality traits is a subjective task that has recently received much attention. Specifically, automatic apparent personality trait prediction from multimodal data has emerged as a hot topic within the filed of computer vision and, more particularly, the so called “looking
at people” sub-field. Considering “apparent” personality traits as opposed to real ones considerably reduces the subjectivity of the task. The real world applications are encountered in a wide range of domains, including entertainment, health, human computer interaction, recruitment and security. Predictive models of personality traits are useful for individuals in many scenarios (e.g., preparing for job interviews, preparing for public speaking). However, these predictions in and of themselves might be deemed to be untrustworthy without human understandable supportive evidence. Through a series of experiments on a recently released benchmark dataset for automatic apparent personality trait prediction, this paper characterizes the audio and visual information that is used by a state-of-the-art model while making its predictions, so as to provide such supportive evidence by explaining predictions made. Additionally, the paper describes a new web application, which gives feedback on apparent personality traits of its users by combining model predictions with their explanations. |
||||
| Address | Venice; Italy; October 2017 | ||||
| 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 | ICCVW | ||
| Notes | HUPBA; 6002.143 | Approved | no | ||
| Call Number | Admin @ si @ GGP2017 | Serial | 3067 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Alicia Fornes; Ernest Valveny | ||||
| Title | A non-rigid appearance model for shape description and recognition | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages |
3105--3113 |
| Keywords | Shape recognition; Deformable models; Shape modeling; Hand-drawn recognition | ||||
| Abstract | In this paper we describe a framework to learn a model of shape variability in a set of patterns. The framework is based on the Active Appearance Model (AAM) and permits to combine shape deformations with appearance variability. We have used two modifications of the Blurred Shape Model (BSM) descriptor as basic shape and appearance features to learn the model. These modifications permit to overcome the rigidity of the original BSM, adapting it to the deformations of the shape to be represented. We have applied this framework to representation and classification of handwritten digits and symbols. We show that results of the proposed methodology outperform the original BSM approach. | ||||
| 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 | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ AFV2012 | Serial | 1982 | ||
| Permanent link to this record | |||||
| Author | Zhengying Liu; Adrien Pavao; Zhen Xu; Sergio Escalera; Fabio Ferreira; Isabelle Guyon; Sirui Hong; Frank Hutter; Rongrong Ji; Julio C. S. Jacques Junior; Ge Li; Marius Lindauer; Zhipeng Luo; Meysam Madadi; Thomas Nierhoff; Kangning Niu; Chunguang Pan; Danny Stoll; Sebastien Treguer; Jin Wang; Peng Wang; Chenglin Wu; Youcheng Xiong; Arber Zela; Yang Zhang | ||||
| Title | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 | Type | Journal Article | ||
| Year | 2021 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 43 | Issue | 9 | Pages |
3108 - 3125 |
| Keywords | |||||
| Abstract | This paper reports the results and post-challenge analyses of ChaLearn's AutoDL challenge series, which helped sorting out a profusion of AutoML solutions for Deep Learning (DL) that had been introduced in a variety of settings, but lacked fair comparisons. All input data modalities (time series, images, videos, text, tabular) were formatted as tensors and all tasks were multi-label classification problems. Code submissions were executed on hidden tasks, with limited time and computational resources, pushing solutions that get results quickly. In this setting, DL methods dominated, though popular Neural Architecture Search (NAS) was impractical. Solutions relied on fine-tuned pre-trained networks, with architectures matching data modality. Post-challenge tests did not reveal improvements beyond the imposed time limit. While no component is particularly original or novel, a high level modular organization emerged featuring a “meta-learner”, “data ingestor”, “model selector”, “model/learner”, and “evaluator”. This modularity enabled ablation studies, which revealed the importance of (off-platform) meta-learning, ensembling, and efficient data management. Experiments on heterogeneous module combinations further confirm the (local) optimality of the winning solutions. Our challenge legacy includes an ever-lasting benchmark (http://autodl.chalearn.org), the open-sourced code of the winners, and a free “AutoDL self-service.” | ||||
| 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 @ LPX2021 | Serial | 3587 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | MSER-based Real-Time Text Detection and Tracking | Type | Conference Article | ||
| Year | 2014 | Publication | 22nd International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
3110 - 3115 | ||
| Keywords | |||||
| Abstract | We present a hybrid algorithm for detection and tracking of text in natural scenes that goes beyond the fulldetection approaches in terms of time performance optimization.
A state-of-the-art scene text detection module based on Maximally Stable Extremal Regions (MSER) is used to detect text asynchronously, while on a separate thread detected text objects are tracked by MSER propagation. The cooperation of these two modules yields real time video processing at high frame rates even on low-resource devices. |
||||
| Address | Stockholm; August 2014 | ||||
| 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 | 1051-4651 | ISBN | Medium | ||
| Area | Expedition | Conference | ICPR | ||
| Notes | DAG; 600.056; 601.158; 601.197; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ GoK2014a | Serial | 2492 | ||
| Permanent link to this record | |||||
| Author | Naveen Onkarappa; Angel Sappa | ||||
| Title | Synthetic sequences and ground-truth flow field generation for algorithm validation | Type | Journal Article | ||
| Year | 2015 | Publication | Multimedia Tools and Applications | Abbreviated Journal | MTAP |
| Volume | 74 | Issue | 9 | Pages |
3121-3135 |
| Keywords | Ground-truth optical flow; Synthetic sequence; Algorithm validation | ||||
| Abstract | Research in computer vision is advancing by the availability of good datasets that help to improve algorithms, validate results and obtain comparative analysis. The datasets can be real or synthetic. For some of the computer vision problems such as optical flow it is not possible to obtain ground-truth optical flow with high accuracy in natural outdoor real scenarios directly by any sensor, although it is possible to obtain ground-truth data of real scenarios in a laboratory setup with limited motion. In this difficult situation computer graphics offers a viable option for creating realistic virtual scenarios. In the current work we present a framework to design virtual scenes and generate sequences as well as ground-truth flow fields. Particularly, we generate a dataset containing sequences of driving scenarios. The sequences in the dataset vary in different speeds of the on-board vision system, different road textures, complex motion of vehicle and independent moving vehicles in the scene. This dataset enables analyzing and adaptation of existing optical flow methods, and leads to invention of new approaches particularly for driver assistance systems. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1380-7501 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.055; 601.215; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ OnS2014b | Serial | 2472 | ||
| 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 | Carlo Gatta; Petia Radeva | ||||
| Title | Bilateral Enhancers | Type | Conference Article | ||
| Year | 2009 | Publication | 16th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages |
3161-3165 | ||
| Keywords | |||||
| Abstract | Ten years ago the concept of bilateral filtering (BF) became popular in the image processing community. The core of the idea is to blend the effect of a spatial filter, as e.g. the Gaussian filter, with the effect of a filter that acts on image values. The two filters acts on orthogonal domains of a picture: the 2D lattice of the image support and the intensity (or color) domain. The BF approach is an intuitive way to blend these two filters giving rise to algorithms that perform difficult tasks requiring a relatively simple design. In this paper we extend the concept of BF, proposing the bilateral enhancers (BE). We show how to design proper functions to obtain an edge-preserving smoothing and a selective sharpening. Moreover, we show that the proposed algorithm can perform edge-preserving smoothing and selective sharpening simultaneously in a single filtering. | ||||
| Address | Cairo, Egypt | ||||
| 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 | 1522-4880 | ISBN | 978-1-4244-5653-6 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | MILAB | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ GaR2009b | Serial | 1243 | ||
| Permanent link to this record | |||||
| Author | Jorge Bernal; F. Javier Sanchez; Fernando Vilariño | ||||
| Title | Towards Automatic Polyp Detection with a Polyp Appearance Model | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages |
3166-3182 |
| Keywords | Colonoscopy,PolypDetection,RegionSegmentation,SA-DOVA descriptot | ||||
| Abstract | This work aims at the automatic polyp detection by using a model of polyp appearance in the context of the analysis of colonoscopy videos. Our method consists of three stages: region segmentation, region description and region classification. The performance of our region segmentation method guarantees that if a polyp is present in the image, it will be exclusively and totally contained in a single region. The output of the algorithm also defines which regions can be considered as non-informative. We define as our region descriptor the novel Sector Accumulation-Depth of Valleys Accumulation (SA-DOVA), which provides a necessary but not sufficient condition for the polyp presence. Finally, we classify our segmented regions according to the maximal values of the SA-DOVA descriptor. Our preliminary classification results are promising, especially when classifying those parts of the image that do not contain a polyp inside. | ||||
| 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 | 0031-3203 | ISBN | Medium | ||
| Area | 800 | Expedition | Conference | IbPRIA | |
| Notes | MV;SIAI | Approved | no | ||
| Call Number | Admin @ si @ BSV2012; IAM @ iam | Serial | 1997 | ||
| Permanent link to this record | |||||
| Author | Jose Luis Gomez; Gabriel Villalonga; Antonio Lopez | ||||
| Title | Co-Training for Deep Object Detection: Comparing Single-Modal and Multi-Modal Approaches | Type | Journal Article | ||
| Year | 2021 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 21 | Issue | 9 | Pages |
3185 |
| Keywords | co-training; multi-modality; vision-based object detection; ADAS; self-driving | ||||
| Abstract | Top-performing computer vision models are powered by convolutional neural networks (CNNs). Training an accurate CNN highly depends on both the raw sensor data and their associated ground truth (GT). Collecting such GT is usually done through human labeling, which is time-consuming and does not scale as we wish. This data-labeling bottleneck may be intensified due to domain shifts among image sensors, which could force per-sensor data labeling. In this paper, we focus on the use of co-training, a semi-supervised learning (SSL) method, for obtaining self-labeled object bounding boxes (BBs), i.e., the GT to train deep object detectors. In particular, we assess the goodness of multi-modal co-training by relying on two different views of an image, namely, appearance (RGB) and estimated depth (D). Moreover, we compare appearance-based single-modal co-training with multi-modal. Our results suggest that in a standard SSL setting (no domain shift, a few human-labeled data) and under virtual-to-real domain shift (many virtual-world labeled data, no human-labeled data) multi-modal co-training outperforms single-modal. In the latter case, by performing GAN-based domain translation both co-training modalities are on par, at least when using an off-the-shelf depth estimation model not specifically trained on the translated images. | ||||
| 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.118 | Approved | no | ||
| Call Number | Admin @ si @ GVL2021 | Serial | 3562 | ||
| Permanent link to this record | |||||