| Home | [151–160] << 161 162 163 164 165 166 167 168 169 170 >> [171–180] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Jaume Gibert | ||||
| Title | Vector Space Embedding of Graphs via Statistics of Labelling Information | Type | Book Whole | ||
| Year | 2012 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
Abstract  |
Pattern recognition is the task that aims at distinguishing objects among different classes. When such a task wants to be solved in an automatic way a crucial step is how to formally represent such patterns to the computer. Based on the different representational formalisms, we may distinguish between statistical and structural pattern recognition. The former describes objects as a set of measurements arranged in the form of what is called a feature vector. The latter assumes that relations between parts of the underlying objects need to be explicitly represented and thus it uses relational structures such as graphs for encoding their inherent information. Vector spaces are a very flexible mathematical structure that has allowed to come up with several efficient ways for the analysis of patterns under the form of feature vectors. Nevertheless, such a representation cannot explicitly cope with binary relations between parts of the objects and it is restricted to measure the exact same number of features for each pattern under study regardless of their complexity. Graph-based representations present the contrary situation. They can easily adapt to the inherent complexity of the patterns but introduce a problem of high computational complexity, hindering the design of efficient tools to process and analyse patterns.
Solving this paradox is the main goal of this thesis. The ideal situation for solving pattern recognition problems would be to represent the patterns using relational structures such as graphs, and to be able to use the wealthy repository of data processing tools from the statistical pattern recognition domain. An elegant solution to this problem is to transform the graph domain into a vector domain where any processing algorithm can be applied. In other words, by mapping each graph to a point in a vector space we automatically get access to the rich set of algorithms from the statistical domain to be applied in the graph domain. Such methodology is called graph embedding. In this thesis we propose to associate feature vectors to graphs in a simple and very efficient way by just putting attention on the labelling information that graphs store. In particular, we count frequencies of node labels and of edges between labels. Although their locality, these features are able to robustly represent structurally global properties of graphs, when considered together in the form of a vector. We initially deal with the case of discrete attributed graphs, where features are easy to compute. The continuous case is tackled as a natural generalization of the discrete one, where rather than counting node and edge labelling instances, we count statistics of some representatives of them. We encounter how the proposed vectorial representations of graphs suffer from high dimensionality and correlation among components and we face these problems by feature selection algorithms. We also explore how the diversity of different embedding representations can be exploited in order to boost the performance of base classifiers in a multiple classifier systems framework. An extensive experimental evaluation finally shows how the methodology we propose can be efficiently computed and compete with other graph matching and embedding methodologies. |
||||
| Address | |||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Ernest Valveny | |
| 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 | Admin @ si @ Gib2012 | Serial | 2204 | ||
| Permanent link to this record | |||||
| Author | Guillermo Torres; Debora Gil; Antoni Rosell; S. Mena; Carles Sanchez | ||||
| Title | Virtual Radiomics Biopsy for the Histological Diagnosis of Pulmonary Nodules | Type | Conference Article | ||
| Year | 2023 | Publication | 37th International Congress and Exhibition is organized by Computer Assisted Radiology and Surgery | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
Pòster | ||||
| Address | Munich; Germany; June 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CARS | ||
| Notes | IAM | Approved | no | ||
| Call Number | Admin @ si @ TGR2023a | Serial | 3950 | ||
| Permanent link to this record | |||||
| Author | Sonia Baeza; Debora Gil; Carles Sanchez; Guillermo Torres; Ignasi Garcia Olive; Ignasi Guasch; Samuel Garcia Reina; Felipe Andreo; Jose Luis Mate; Jose Luis Vercher; Antonio Rosell | ||||
| Title | Biopsia virtual radiomica para el diagnóstico histológico de nódulos pulmonares – Resultados intermedios del proyecto Radiolung | Type | Conference Article | ||
| Year | 2023 | Publication | SEPAR | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
Pòster | ||||
| Address | Granada; Spain; June 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | SEPAR | ||
| Notes | IAM | Approved | no | ||
| Call Number | Admin @ si @ BGS2023 | Serial | 3951 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; Guillermo Torres; Carles Sanchez | ||||
| Title | Transforming radiomic features into radiological words | Type | Conference Article | ||
| Year | 2023 | Publication | IEEE International Symposium on Biomedical Imaging | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
Pòster | ||||
| Address | Cartagena de Indias; Colombia; April 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ISBI | ||
| Notes | IAM | Approved | no | ||
| Call Number | Admin @ si @ GTS2023 | Serial | 3952 | ||
| Permanent link to this record | |||||
| Author | Guillermo Torres; Debora Gil; Antonio Rosell; Sonia Baeza; Carles Sanchez | ||||
| Title | A radiomic biopsy for virtual histology of pulmonary nodules | Type | Conference Article | ||
| Year | 2023 | Publication | IEEE International Symposium on Biomedical Imaging | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
Pòster | ||||
| Address | Cartagena de Indias; Colombia; April 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ISBI | ||
| Notes | IAM | Approved | no | ||
| Call Number | Admin @ si @ TGR2023b | Serial | 3954 | ||
| Permanent link to this record | |||||
| Author | David Vazquez; David Geronimo; Antonio Lopez | ||||
| Title | The effect of the distance in pedestrian detection | Type | Report | ||
| Year | 2009 | Publication | CVC Technical Report | Abbreviated Journal | |
| Volume | 149 | Issue | Pages | ||
| Keywords | Pedestrian Detection | ||||
| Abstract |
Pedestrian accidents are one of the leading preventable causes of death. In order to reduce the number of accidents, in the last decade the pedestrian protection systems have been introduced, a special type of advanced driver assistance systems, in witch an on-board camera explores the road ahead for possible collisions with pedestrians in order to warn the driver or perform braking actions. As a result of the variability of the appearance, pose and size, pedestrian detection is a very challenging task. So many techniques, models and features have been proposed to solve the problem. As the appearance of pedestrians varies signi cantly as a function of distance, a system based on multiple classi ers specialized on diferent depths is likely to improve the overall performance with respect to a typical system based on a general detector. Accordingly, the main aim of this work is to explore the e ect of the distance in pedestrian detection. We have evaluated three pedestrian detectors (HOG, HAAR and EOH) in two di erent databases (INRIA and Daimler09) for two di erent sizes (small and big). By a extensive set of experiments we answer to questions like which datasets and evaluation methods are the most adequate, which is the best method for each size of the pedestrians and why or how do the method optimum parameters vary with respect to the distance | ||||
| Address | |||||
| Corporate Author | Thesis | Master's 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 | M.Sc. | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ VGL2009 | Serial | 1669 | ||
| Permanent link to this record | |||||
| Author | Alejandro Gonzalez Alzate; Sebastian Ramos; David Vazquez; Antonio Lopez; Jaume Amores | ||||
| Title | Spatiotemporal Stacked Sequential Learning for Pedestrian Detection | Type | Conference Article | ||
| Year | 2015 | Publication | Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 3-12 | ||
| Keywords | SSL; Pedestrian Detection | ||||
| Abstract |
Pedestrian classifiers decide which image windows contain a pedestrian. In practice, such classifiers provide a relatively high response at neighbor windows overlapping a pedestrian, while the responses around potential false positives are expected to be lower. An analogous reasoning applies for image sequences. If there is a pedestrian located within a frame, the same pedestrian is expected to appear close to the same location in neighbor frames. Therefore, such a location has chances of receiving high classification scores during several frames, while false positives are expected to be more spurious. In this paper we propose to exploit such correlations for improving the accuracy of base pedestrian classifiers. In particular, we propose to use two-stage classifiers which not only rely on the image descriptors required by the base classifiers but also on the response of such base classifiers in a given spatiotemporal neighborhood. More specifically, we train pedestrian classifiers using a stacked sequential learning (SSL) paradigm. We use a new pedestrian dataset we have acquired from a car to evaluate our proposal at different frame rates. We also test on a well known dataset: Caltech. The obtained results show that our SSL proposal boosts detection accuracy significantly with a minimal impact on the computational cost. Interestingly, SSL improves more the accuracy at the most dangerous situations, i.e. when a pedestrian is close to the camera. | ||||
| Address | Santiago de Compostela; España; June 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 | ACDC | Expedition | Conference | IbPRIA | |
| Notes | ADAS; 600.057; 600.054; 600.076 | Approved | no | ||
| Call Number | GRV2015; ADAS @ adas @ GRV2015 | Serial | 2454 | ||
| Permanent link to this record | |||||
| Author | Alejandro Gonzalez Alzate | ||||
| Title | Multi-modal Pedestrian Detection | Type | Book Whole | ||
| Year | 2015 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
Pedestrian detection continues to be an extremely challenging problem in real scenarios, in which situations like illumination changes, noisy images, unexpected objects, uncontrolled scenarios and variant appearance of objects occur constantly. All these problems force the development of more robust detectors for relevant applications like vision-based autonomous vehicles, intelligent surveillance, and pedestrian tracking for behavior analysis. Most reliable vision-based pedestrian detectors base their decision on features extracted using a single sensor capturing complementary features, e.g., appearance, and texture. These features usually are extracted from the current frame, ignoring temporal information, or including it in a post process step e.g., tracking or temporal coherence. Taking into account these issues we formulate the following question: can we generate more robust pedestrian detectors by introducing new information sources in the feature extraction step?
In order to answer this question we develop different approaches for introducing new information sources to well-known pedestrian detectors. We start by the inclusion of temporal information following the Stacked Sequential Learning (SSL) paradigm which suggests that information extracted from the neighboring samples in a sequence can improve the accuracy of a base classifier. We then focus on the inclusion of complementary information from different sensors like 3D point clouds (LIDAR – depth), far infrared images (FIR), or disparity maps (stereo pair cameras). For this end we develop a multi-modal framework in which information from different sensors is used for increasing detection accuracy (by increasing information redundancy). Finally we propose a multi-view pedestrian detector, this multi-view approach splits the detection problem in n sub-problems. Each sub-problem will detect objects in a given specific view reducing in that way the variability problem faced when a single detectors is used for the whole problem. We show that these approaches obtain competitive results with other state-of-the-art methods but instead of design new features, we reuse existing ones boosting their performance. |
||||
| Address | November 2015 | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | David Vazquez;Antonio Lopez; | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-943427-7-6 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ Gon2015 | Serial | 2706 | ||
| Permanent link to this record | |||||
| Author | Victor Campmany; Sergio Silva; Juan Carlos Moure; Antoni Espinosa; David Vazquez; Antonio Lopez | ||||
| Title | GPU-based pedestrian detection for autonomous driving | Type | Abstract | ||
| Year | 2015 | Publication | Programming and Tunning Massive Parallel Systems | Abbreviated Journal | PUMPS |
| Volume | Issue | Pages | |||
| Keywords | Autonomous Driving; ADAS; CUDA; Pedestrian Detection | ||||
| Abstract |
Pedestrian detection for autonomous driving has gained a lot of prominence during the last few years. Besides the fact that it is one of the hardest tasks within computer vision, it involves huge computational costs. The real-time constraints in the field are tight, and regular processors are not able to handle the workload obtaining an acceptable ratio of frames per second (fps). Moreover, multiple cameras are required to obtain accurate results, so the need to speed up the process is even higher. Taking the work in [1] as our baseline, we propose a CUDA implementation of a pedestrian detection system. Further, we introduce significant algorithmic adjustments and optimizations to adapt the problem to the GPU architecture. The aim is to provide a system capable of running in real-time obtaining reliable results. | ||||
| Address | Barcelona; Spain | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | PUMPS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | PUMPS | ||
| Notes | ADAS; 600.076; 600.082; 600.085 | Approved | no | ||
| Call Number | ADAS @ adas @ CSM2015 | Serial | 2644 | ||
| Permanent link to this record | |||||
| Author | Victor Campmany; Sergio Silva; Juan Carlos Moure; Toni Espinosa; David Vazquez; Antonio Lopez | ||||
| Title | GPU-based pedestrian detection for autonomous driving | Type | Conference Article | ||
| Year | 2016 | Publication | GPU Technology Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Pedestrian Detection; GPU | ||||
| Abstract |
Pedestrian detection for autonomous driving is one of the hardest tasks within computer vision, and involves huge computational costs. Obtaining acceptable real-time performance, measured in frames per second (fps), for the most advanced algorithms is nowadays a hard challenge. Taking the work in [1] as our baseline, we propose a CUDA implementation of a pedestrian detection system that includes LBP and HOG as feature descriptors and SVM and Random forest as classifiers. We introduce significant algorithmic adjustments and optimizations to adapt the problem to the NVIDIA GPU architecture. The aim is to deploy a real-time system providing reliable results. | ||||
| Address | Silicon Valley; San Francisco; USA; April 2016 | ||||
| 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 | GTC | ||
| Notes | ADAS; 600.085; 600.082; 600.076 | Approved | no | ||
| Call Number | ADAS @ adas @ CSM2016 | Serial | 2737 | ||
| Permanent link to this record | |||||
| Author | David Geronimo; Antonio Lopez; Angel Sappa | ||||
| Title | Computer Vision Approaches for Pedestrian Detection: Visible Spectrum Survey | Type | Conference Article | ||
| Year | 2007 | Publication | 3rd Iberian Conference on Pattern Recognition and Image Analysis, LNCS 4477 | Abbreviated Journal | |
| Volume | 1 | Issue | Pages | 547–554 | |
| Keywords | Pedestrian detection | ||||
| Abstract |
Pedestrian detection from images of the visible spectrum is a high relevant area of research given its potential impact in the design of pedestrian protection systems. There are many proposals in the literature but they lack a comparative viewpoint. According to this, in this paper we first propose a common framework where we fit the different approaches, and second we use this framework to provide a comparative point of view of the details of such different approaches, pointing out also the main challenges to be solved in the future. In summary, we expect
this survey to be useful for both novel and experienced researchers in the field. In the first case, as a clarifying snapshot of the state of the art; in the second, as a way to unveil trends and to take conclusions from the comparative study. |
||||
| Address | Girona (Spain) | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | J. Marti et al. | ||
| 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 | Approved | no | ||
| Call Number | ADAS @ adas @ GLS2007 | Serial | 804 | ||
| Permanent link to this record | |||||
| Author | Antonio Lopez | ||||
| Title | Pedestrian Detection Systems | Type | Book Chapter | ||
| Year | 2018 | Publication | Wiley Encyclopedia of Electrical and Electronics Engineering | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
Pedestrian detection is a highly relevant topic for both advanced driver assistance systems (ADAS) and autonomous driving. In this entry, we review the ideas behind pedestrian detection systems from the point of view of perception based on computer vision and machine 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 | ADAS; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ Lop2018 | Serial | 3230 | ||
| Permanent link to this record | |||||
| Author | David Vazquez | ||||
| Title | Domain Adaptation of Virtual and Real Worlds for Pedestrian Detection | Type | Book Whole | ||
| Year | 2013 | Publication | PhD Thesis, Universitat de Barcelona-CVC | Abbreviated Journal | |
| Volume | 1 | Issue | 1 | Pages | 1-105 |
| Keywords | Pedestrian Detection; Domain Adaptation | ||||
| Abstract |
Pedestrian detection is of paramount interest for many applications, e.g. Advanced Driver Assistance Systems, Intelligent Video Surveillance and Multimedia systems. Most promising pedestrian detectors rely on appearance-based classifiers trained with annotated data. However, the required annotation step represents an intensive and subjective task for humans, what makes worth to minimize their intervention in this process by using computational tools like realistic virtual worlds. The reason to use these kind of tools relies in the fact that they allow the automatic generation of precise and rich annotations of visual information. Nevertheless, the use of this kind of data comes with the following question: can a pedestrian appearance model learnt with virtual-world data work successfully for pedestrian detection in real-world scenarios?. To answer this question, we conduct different experiments that suggest a positive answer. However, the pedestrian classifiers trained with virtual-world data can suffer the so called dataset shift problem as real-world based classifiers does. Accordingly, we have designed different domain adaptation techniques to face this problem, all of them integrated in a same framework (V-AYLA). We have explored different methods to train a domain adapted pedestrian classifiers by collecting a few pedestrian samples from the target domain (real world) and combining them with many samples of the source domain (virtual world). The extensive experiments we present show that pedestrian detectors developed within the V-AYLA framework do achieve domain adaptation. Ideally, we would like to adapt our system without any human intervention. Therefore, as a first proof of concept we also propose an unsupervised domain adaptation technique that avoids human intervention during the adaptation process. To the best of our knowledge, this Thesis work is the first demonstrating adaptation of virtual and real worlds for developing an object detector. Last but not least, we also assessed a different strategy to avoid the dataset shift that consists in collecting real-world samples and retrain with them in such a way that no bounding boxes of real-world pedestrians have to be provided. We show that the generated classifier is competitive with respect to the counterpart trained with samples collected by manually annotating pedestrian bounding boxes. The results presented on this Thesis not only end with a proposal for adapting a virtual-world pedestrian detector to the real world, but also it goes further by pointing out a new methodology that would allow the system to adapt to different situations, which we hope will provide the foundations for future research in this unexplored area. | ||||
| Address | Barcelona | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Barcelona | Editor | Antonio Lopez;Daniel Ponsa |
| Language | English | Summary Language | Original Title | ||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-940530-1-6 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | adas | Approved | yes | ||
| Call Number | ADAS @ adas @ Vaz2013 | Serial | 2276 | ||
| Permanent link to this record | |||||
| Author | David Vazquez; Javier Marin; Antonio Lopez; Daniel Ponsa; David Geronimo | ||||
| Title | Virtual and Real World Adaptation for Pedestrian Detection | Type | Journal Article | ||
| Year | 2014 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 36 | Issue | 4 | Pages | 797-809 |
| Keywords | Domain Adaptation; Pedestrian Detection | ||||
| Abstract |
Pedestrian detection is of paramount interest for many applications. Most promising detectors rely on discriminatively learnt classifiers, i.e., trained with annotated samples. However, the annotation step is a human intensive and subjective task worth to be minimized. By using virtual worlds we can automatically obtain precise and rich annotations. Thus, we face the question: can a pedestrian appearance model learnt in realistic virtual worlds work successfully for pedestrian detection in realworld images?. Conducted experiments show that virtual-world based training can provide excellent testing accuracy in real world, but it can also suffer the dataset shift problem as real-world based training does. Accordingly, we have designed a domain adaptation framework, V-AYLA, in which we have tested different techniques to collect a few pedestrian samples from the target domain (real world) and combine them with the many examples of the source domain (virtual world) in order to train a domain adapted pedestrian classifier that will operate in the target domain. V-AYLA reports the same detection accuracy than when training with many human-provided pedestrian annotations and testing with real-world images of the same domain. To the best of our knowledge, this is the first work demonstrating adaptation of virtual and real worlds for developing an object detector. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.057; 600.054; 600.076 | Approved | no | ||
| Call Number | ADAS @ adas @ VML2014 | Serial | 2275 | ||
| 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 | |||||