Home | << 1 2 3 4 5 6 7 8 9 10 >> |
![]() |
Records | |||||
---|---|---|---|---|---|
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 signicantly as a function of distance, a system based on multiple classiers 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 eect of the distance in pedestrian detection. We have evaluated three pedestrian detectors (HOG, HAAR and EOH) in two dierent databases (INRIA and Daimler09) for two dierent 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 | Albert Andaluz | ||||
Title | LV Contour Segmentation in TMR images using Semantic Description of Tissue and Prior Knowledge Correction | Type | Report | ||
Year | 2009 | Publication | CVC Technical Report | Abbreviated Journal | |
Volume | 142 | Issue | Pages | ||
Keywords | Active Contour Models; Snakes; Active Shape Models; Deformable Templates; Left Ventricle Segmentation; Generalized Orthogonal Procrustes Analysis; Harmonic Phase Flow; Principal Component Analysis; Tagged Magnetic Resonance | ||||
Abstract | The Diagnosis of Left Ventricle (LV) pathologies is related to regional wall motion analysis. Health indicator scores such as the rotation and the torsion are useful for the diagnose of the Left Ventricle (LV) function. However, this requires proper identification of LV segments. On one hand, manual segmentation is robust, but it is slow and requires medical expertise. On the other hand, the tag pattern in Tagged Magnetic Resonance (TMR) sequences is a problem for the automatic segmentation of the LV boundaries. Consequently, we propose a method based in the classical formulation of parametric Snakes, combined with Active Shape models. Our semantic definition of the LV is tagged tissue that experiences motion in the systolic cycle. This defines two energy potentials for the Snake convergence. Additionally, the mean shape corrects excessive deviation from the anatomical shape. We have validated our approach in 15 healthy volunteers and two short axis cuts. In this way, we have compared the automatic segmentations to manual shapes outlined by medical experts. Also, we have explored the accuracy of clinical scores computed using automatic contours. The results show minor divergence in the approximation and the manual segmentations as well as robust computation of clinical scores in all cases. From this we conclude that the proposed method is a promising support tool for clinical analysis. | ||||
Address | |||||
Corporate Author | Thesis | Master's thesis | |||
Publisher ![]() |
Place of Publication | Bellaterra 08193, Barcelona, Spain | Editor | ||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | |||
Series Volume | Series Issue | Edition | |||
ISSN | ISBN | Medium | |||
Area | Expedition | Conference | |||
Notes | IAM; | Approved | no | ||
Call Number | IAM @ iam @ And2009 | Serial | 1667 | ||
Permanent link to this record | |||||
Author | Xavier Baro; Sergio Escalera; Jordi Vitria; Oriol Pujol; Petia Radeva | ||||
Title | Traffic Sign Recognition Using Evolutionary Adaboost Detection and Forest-ECOC Classification | Type | Journal Article | ||
Year | 2009 | Publication | IEEE Transactions on Intelligent Transportation Systems | Abbreviated Journal | TITS |
Volume | 10 | Issue | 1 | Pages | 113–126 |
Keywords | |||||
Abstract | The high variability of sign appearance in uncontrolled environments has made the detection and classification of road signs a challenging problem in computer vision. In this paper, we introduce a novel approach for the detection and classification of traffic signs. Detection is based on a boosted detectors cascade, trained with a novel evolutionary version of Adaboost, which allows the use of large feature spaces. Classification is defined as a multiclass categorization problem. A battery of classifiers is trained to split classes in an Error-Correcting Output Code (ECOC) framework. We propose an ECOC design through a forest of optimal tree structures that are embedded in the ECOC matrix. The novel system offers high performance and better accuracy than the state-of-the-art strategies and is potentially better in terms of noise, affine deformation, partial occlusions, and reduced illumination. | ||||
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 | 1524-9050 | ISBN | Medium | ||
Area | Expedition | Conference | |||
Notes | OR;MILAB;HuPBA;MV | Approved | no | ||
Call Number | BCNPCL @ bcnpcl @ BEV2008 | Serial | 1116 | ||
Permanent link to this record | |||||
Author | Niki Aifanti; Angel Sappa; N. Grammalidis; Sotiris Malassiotis | ||||
Title | Advances in Tracking and Recognition of Human Motion | Type | Book Chapter | ||
Year | 2009 | Publication | Encyclopedia of Information Science and Technology | Abbreviated Journal | |
Volume | I | Issue | 2nd edition | Pages | 65–71 |
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 | ADAS | Approved | no | ||
Call Number | ADAS @ adas @ ASG2009 | Serial | 1143 | ||
Permanent link to this record | |||||
Author | Mohammad Rouhani | ||||
Title | 3D Data Fitting and Tracking for Real Time Applications | Type | Report | ||
Year | 2009 | Publication | CVC Technical Report | Abbreviated Journal | |
Volume | 138 | Issue | 138 | Pages | |
Keywords | |||||
Abstract | |||||
Address | Barcelona, Spain | ||||
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 | |||
Notes | invisible;ADAS | Approved | no | ||
Call Number | Admin @ si @ Rou2009 | Serial | 1150 | ||
Permanent link to this record | |||||
Author | Fadi Dornaika; Angel Sappa | ||||
Title | A Featureless and Stochastic Approach to On-board Stereo Vision System Pose | Type | Journal Article | ||
Year | 2009 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
Volume | 27 | Issue | 9 | Pages | 1382–1393 |
Keywords | On-board stereo vision system; Pose estimation; Featureless approach; Particle filtering; Image warping | ||||
Abstract | This paper presents a direct and stochastic technique for real-time estimation of on-board stereo head’s position and orientation. Unlike existing works which rely on feature extraction either in the image domain or in 3D space, our proposed approach directly estimates the unknown parameters from the stream of stereo pairs’ brightness. The pose parameters are tracked using the particle filtering framework which implicitly enforces the smoothness constraints on the estimated parameters. The proposed technique can be used with a driver assistance applications as well as with augmented reality applications. Extended experiments on urban environments with different road geometries are presented. Comparisons with a 3D data-based approach are presented. Moreover, we provide a performance study aiming at evaluating the accuracy of the proposed 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 | ISBN | Medium | |||
Area | Expedition | Conference | |||
Notes | ADAS | Approved | no | ||
Call Number | ADAS @ adas @ DoS2009b | Serial | 1152 | ||
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 | Bogdan Raducanu; Jordi Vitria; D. Gatica-Perez | ||||
Title | You are Fired! Nonverbal Role Analysis in Competitive Meetings | Type | Conference Article | ||
Year | 2009 | Publication | IEEE International Conference on Audio, Speech and Signal Processing | Abbreviated Journal | |
Volume | Issue | Pages | 1949–1952 | ||
Keywords | |||||
Abstract | This paper addresses the problem of social interaction analysis in competitive meetings, using nonverbal cues. For our study, we made use of ldquoThe Apprenticerdquo reality TV show, which features a competition for a real, highly paid corporate job. Our analysis is centered around two tasks regarding a person's role in a meeting: predicting the person with the highest status and predicting the fired candidates. The current study was carried out using nonverbal audio cues. Results obtained from the analysis of a full season of the show, representing around 90 minutes of audio data, are very promising (up to 85.7% of accuracy in the first case and up to 92.8% in the second case). Our approach is based only on the nonverbal interaction dynamics during the meeting without relying on the spoken words. | ||||
Address | Taipei, Taiwan | ||||
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 | 1520-6149 | ISBN | 978-1-4244-2353-8 | Medium | |
Area | Expedition | Conference | ICASSP | ||
Notes | OR;MV | Approved | no | ||
Call Number | BCNPCL @ bcnpcl @ RVG2009 | Serial | 1154 | ||
Permanent link to this record | |||||
Author | David Masip; Agata Lapedriza; Jordi Vitria | ||||
Title | Boosted Online Learning for Face Recognition | Type | Journal Article | ||
Year | 2009 | Publication | IEEE Transactions on Systems, Man and Cybernetics part B | Abbreviated Journal | TSMCB |
Volume | 39 | Issue | 2 | Pages | 530–538 |
Keywords | |||||
Abstract | Face recognition applications commonly suffer from three main drawbacks: a reduced training set, information lying in high-dimensional subspaces, and the need to incorporate new people to recognize. In the recent literature, the extension of a face classifier in order to include new people in the model has been solved using online feature extraction techniques. The most successful approaches of those are the extensions of the principal component analysis or the linear discriminant analysis. In the current paper, a new online boosting algorithm is introduced: a face recognition method that extends a boosting-based classifier by adding new classes while avoiding the need of retraining the classifier each time a new person joins the system. The classifier is learned using the multitask learning principle where multiple verification tasks are trained together sharing the same feature space. The new classes are added taking advantage of the structure learned previously, being the addition of new classes not computationally demanding. The present proposal has been (experimentally) validated with two different facial data sets by comparing our approach with the current state-of-the-art techniques. The results show that the proposed online boosting algorithm fares better in terms of final accuracy. In addition, the global performance does not decrease drastically even when the number of classes of the base problem is multiplied by eight. | ||||
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 | 1083–4419 | ISBN | Medium | ||
Area | Expedition | Conference | |||
Notes | OR;MV | Approved | no | ||
Call Number | BCNPCL @ bcnpcl @ MLV2009 | Serial | 1155 | ||
Permanent link to this record | |||||
Author | C. Alejandro Parraga; Robert Benavente; Maria Vanrell; Ramon Baldrich | ||||
Title | Psychophysical measurements to model inter-colour regions of colour-naming space | Type | Journal Article | ||
Year | 2009 | Publication | Journal of Imaging Science and Technology | Abbreviated Journal | |
Volume | 53 | Issue | 3 | Pages | 031106 (8 pages) |
Keywords | image processing; Analysis | ||||
Abstract | JCR Impact Factor 2009: 0.391
In this paper, we present a fuzzy-set of parametric functions which segment the CIE lab space into eleven regions which correspond to the group of common universal categories present in all evolved languages as identified by anthropologists and linguists. The set of functions is intended to model a color-name assignment task by humans and differs from other models in its emphasis on the inter-color boundary regions, which were explicitly measured by means of a psychophysics experiment. In our particular implementation, the CIE lab space was segmented into eleven color categories using a Triple Sigmoid as the fuzzy sets basis, whose parameters are included in this paper. The model’s parameters were adjusted according to the psychophysical results of a yes/no discrimination paradigm where observers had to choose (English) names for isoluminant colors belonging to regions in-between neighboring categories. These colors were presented on a calibrated CRT monitor (14-bit x 3 precision). The experimental results show that inter- color boundary regions are much less defined than expected and color samples other than those near the most representatives are needed to define the position and shape of boundaries between categories. The extended set of model parameters is given as a table. |
||||
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 | Approved | no | ||
Call Number | CAT @ cat @ PBV2009 | Serial | 1157 | ||
Permanent link to this record | |||||
Author | Ignasi Rius; Jordi Gonzalez; Javier Varona; Xavier Roca | ||||
Title | Action-specific motion prior for efficient bayesian 3D human body tracking | Type | Journal Article | ||
Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
Volume | 42 | Issue | 11 | Pages | 2907–2921 |
Keywords | |||||
Abstract | In this paper, we aim to reconstruct the 3D motion parameters of a human body
model from the known 2D positions of a reduced set of joints in the image plane. Towards this end, an action-specific motion model is trained from a database of real motion-captured performances. The learnt motion model is used within a particle filtering framework as a priori knowledge on human motion. First, our dynamic model guides the particles according to similar situations previously learnt. Then, the solution space is constrained so only feasible human postures are accepted as valid solutions at each time step. As a result, we are able to track the 3D configuration of the full human body from several cycles of walking motion sequences using only the 2D positions of a very reduced set of joints from lateral or frontal viewpoints. |
||||
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 | ISE | Approved | no | ||
Call Number | ISE @ ise @ RGV2009 | Serial | 1159 | ||
Permanent link to this record | |||||
Author | Mikhail Mozerov; Ariel Amato; Xavier Roca; Jordi Gonzalez | ||||
Title | Solving the Multi Object Occlusion Problem in a Multiple Camera Tracking System | Type | Journal | ||
Year | 2009 | Publication | Pattern Recognition and Image Analysis | Abbreviated Journal | |
Volume | 19 | Issue | 1 | Pages | 165-171 |
Keywords | |||||
Abstract | An efficient method to overcome adverse effects of occlusion upon object tracking is presented. The method is based on matching paths of objects in time and solves a complex occlusion-caused problem of merging separate segments of the same path. | ||||
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 | 1054-6618 | ISBN | Medium | ||
Area | Expedition | Conference | |||
Notes | ISE | Approved | no | ||
Call Number | ISE @ ise @ MAR2009a | Serial | 1160 | ||
Permanent link to this record | |||||
Author | Carme Julia; Angel Sappa; Felipe Lumbreras; Joan Serrat; Antonio Lopez | ||||
Title | An iterative multiresolution scheme for SFM with missing data | Type | Journal Article | ||
Year | 2009 | Publication | Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
Volume | 34 | Issue | 3 | Pages | 240–258 |
Keywords | |||||
Abstract | Several techniques have been proposed for tackling the Structure from Motion problem through factorization in the case of missing data. However, when the percentage of unknown data is high, most of them may not perform as well as expected. Focussing on this problem, an iterative multiresolution scheme, which aims at recovering missing entries in the originally given input matrix, is proposed. Information recovered following a coarse-to-fine strategy is used for filling in the missing entries. The objective is to recover, as much as possible, missing data in the given matrix.
Thus, when a factorization technique is applied to the partially or totally filled in matrix, instead of to the originally given input one, better results will be obtained. An evaluation study about the robustness to missing and noisy data is reported. Experimental results obtained with synthetic and real video sequences are presented to show the viability of the proposed 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 | ISBN | Medium | |||
Area | Expedition | Conference | |||
Notes | ADAS | Approved | no | ||
Call Number | ADAS @ adas @ JSL2009a | Serial | 1163 | ||
Permanent link to this record | |||||
Author | Marçal Rusiñol; Josep Llados | ||||
Title | A Performance Evaluation Protocol for Symbol Spotting Systems in Terms of Recognition and Location Indices | Type | Journal Article | ||
Year | 2009 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
Volume | 12 | Issue | 2 | Pages | 83-96 |
Keywords | Performance evaluation; Symbol Spotting; Graphics Recognition | ||||
Abstract | Symbol spotting systems are intended to retrieve regions of interest from a document image database where the queried symbol is likely to be found. They shall have the ability to recognize and locate graphical symbols in a single step. In this paper, we present a set of measures to evaluate the performance of a symbol spotting system in terms of recognition abilities, location accuracy and scalability. We show that the proposed measures allow to determine the weaknesses and strengths of different methods. In particular we have tested a symbol spotting method based on a set of four different off-the-shelf shape descriptors. | ||||
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 | 1433-2833 | ISBN | Medium | ||
Area | Expedition | Conference | |||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ RuL2009a | Serial | 1166 | ||
Permanent link to this record | |||||
Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
Title | Median Graphs: A Genetic Approach based on New Theoretical Properties | Type | Journal Article | ||
Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
Volume | 42 | Issue | 9 | Pages | 2003–2012 |
Keywords | Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition | ||||
Abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
Address | |||||
Corporate Author | Thesis | ||||
Publisher ![]() |
Place of Publication | Editor | |||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | |||
Series Volume | Series Issue | Edition | |||
ISSN | ISBN | Medium | |||
Area | Expedition | Conference | |||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ FVS2009b | Serial | 1167 | ||
Permanent link to this record |