| |
Records |
Links |
|
Author |
Jose Manuel Alvarez; Y. LeCun; Theo Gevers; Antonio Lopez |
|
| |
Title |
Semantic Road Segmentation via Multi-Scale Ensembles of Learned Features |
Type |
Conference Article |
| |
Year  |
2012 |
Publication |
12th European Conference on Computer Vision – Workshops and Demonstrations |
Abbreviated Journal |
|
|
| |
Volume |
7584 |
Issue |
|
Pages |
586-595 |
|
| |
Keywords |
road detection |
|
| |
Abstract |
Semantic segmentation refers to the process of assigning an object label (e.g., building, road, sidewalk, car, pedestrian) to every pixel in an image. Common approaches formulate the task as a random field labeling problem modeling the interactions between labels by combining local and contextual features such as color, depth, edges, SIFT or HoG. These models are trained to maximize the likelihood of the correct classification given a training set. However, these approaches rely on hand–designed features (e.g., texture, SIFT or HoG) and a higher computational time required in the inference process.
Therefore, in this paper, we focus on estimating the unary potentials of a conditional random field via ensembles of learned features. We propose an algorithm based on convolutional neural networks to learn local features from training data at different scales and resolutions. Then, diversification between these features is exploited using a weighted linear combination. Experiments on a publicly available database show the effectiveness of the proposed method to perform semantic road scene segmentation in still images. The algorithm outperforms appearance based methods and its performance is similar compared to state–of–the–art methods using other sources of information such as depth, motion or stereo. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer Berlin Heidelberg |
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-33867-0 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ECCVW |
|
| |
Notes |
ADAS;ISE |
Approved |
no |
|
| |
Call Number |
Admin @ si @ ALG2012; ADAS @ adas |
Serial |
2187 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
German Ros; J. Guerrero; Angel Sappa; Daniel Ponsa; Antonio Lopez |
|
| |
Title |
Fast and Robust l1-averaging-based Pose Estimation for Driving Scenarios |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
24th British Machine Vision Conference |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
SLAM |
|
| |
Abstract |
Robust visual pose estimation is at the core of many computer vision applications, being fundamental for Visual SLAM and Visual Odometry problems. During the last decades, many approaches have been proposed to solve these problems, being RANSAC one of the most accepted and used. However, with the arrival of new challenges, such as large driving scenarios for autonomous vehicles, along with the improvements in the data gathering frameworks, new issues must be considered. One of these issues is the capability of a technique to deal with very large amounts of data while meeting the realtime
constraint. With this purpose in mind, we present a novel technique for the problem of robust camera-pose estimation that is more suitable for dealing with large amount of data, which additionally, helps improving the results. The method is based on a combination of a very fast coarse-evaluation function and a robust ℓ1-averaging procedure. Such scheme leads to high-quality results while taking considerably less time than RANSAC.
Experimental results on the challenging KITTI Vision Benchmark Suite are provided, showing the validity of the proposed approach. |
|
| |
Address |
Bristol; UK; September 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 |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
BMVC |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RGS2013b; ADAS @ adas @ |
Serial |
2274 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Ariel Amato; Angel Sappa; Alicia Fornes; Felipe Lumbreras; Josep Llados |
|
| |
Title |
Divide and Conquer: Atomizing and Parallelizing A Task in A Mobile Crowdsourcing Platform |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
2nd International ACM Workshop on Crowdsourcing for Multimedia |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
21-22 |
|
| |
Keywords |
|
|
| |
Abstract |
In this paper we present some conclusions about the advantages of having an efficient task formulation when a crowdsourcing platform is used. In particular we show how the task atomization and distribution can help to obtain results in an efficient way. Our proposal is based on a recursive splitting of the original task into a set of smaller and simpler tasks. As a result both more accurate and faster solutions are obtained. Our evaluation is performed on a set of ancient documents that need to be digitized. |
|
| |
Address |
Barcelona; October 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 |
|
ISBN |
978-1-4503-2396-3 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
CrowdMM |
|
| |
Notes |
ADAS; ISE; DAG; 600.054; 600.055; 600.045; 600.061; 602.006 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ SLA2013 |
Serial |
2335 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Andrew Nolan; Daniel Serrano; Aura Hernandez-Sabate; Daniel Ponsa; Antonio Lopez |
|
| |
Title |
Obstacle mapping module for quadrotors on outdoor Search and Rescue operations |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
International Micro Air Vehicle Conference and Flight Competition |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
UAV |
|
| |
Abstract |
Obstacle avoidance remains a challenging task for Micro Aerial Vehicles (MAV), due to their limited payload capacity to carry advanced sensors. Unlike larger vehicles, MAV can only carry light weight sensors, for instance a camera, which is our main assumption in this work. We explore passive monocular depth estimation and propose a novel method Position Aided Depth Estimation
(PADE). We analyse PADE performance and compare it against the extensively used Time To Collision (TTC). We evaluate the accuracy, robustness to noise and speed of three Optical Flow (OF) techniques, combined with both depth estimation methods. Our results show PADE is more accurate than TTC at depths between 0-12 meters and is less sensitive to noise. Our findings highlight the potential application of PADE for MAV to perform safe autonomous navigation in
unknown and unstructured environments. |
|
| |
Address |
Toulouse; France; September 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 |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IMAV |
|
| |
Notes |
ADAS; 600.054; 600.057;IAM |
Approved |
no |
|
| |
Call Number |
Admin @ si @ NSH2013 |
Serial |
2371 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Yainuvis Socarras; Sebastian Ramos; David Vazquez; Antonio Lopez; Theo Gevers |
|
| |
Title |
Adapting Pedestrian Detection from Synthetic to Far Infrared Images |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
ICCV Workshop on Visual Domain Adaptation and Dataset Bias |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Domain Adaptation; Far Infrared; Pedestrian Detection |
|
| |
Abstract |
We present different techniques to adapt a pedestrian classifier trained with synthetic images and the corresponding automatically generated annotations to operate with far infrared (FIR) images. The information contained in this kind of images allow us to develop a robust pedestrian detector invariant to extreme illumination changes. |
|
| |
Address |
Sydney; Australia; December 2013 |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
Sydney, Australy |
Editor |
|
|
| |
Language |
English |
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICCVW-VisDA |
|
| |
Notes |
ADAS; 600.054; 600.055; 600.057; 601.217;ISE |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ SRV2013 |
Serial |
2334 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Patricia Marquez; Debora Gil; Aura Hernandez-Sabate |
|
| |
Title |
Evaluation of the Capabilities of Confidence Measures for Assessing Optical Flow Quality |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
ICCV Workshop on Computer Vision in Vehicle Technology: From Earth to Mars |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
624-631 |
|
| |
Keywords |
|
|
| |
Abstract |
Assessing Optical Flow (OF) quality is essential for its further use in reliable decision support systems. The absence of ground truth in such situations leads to the computation of OF Confidence Measures (CM) obtained from either input or output data. A fair comparison across the capabilities of the different CM for bounding OF error is required in order to choose the best OF-CM pair for discarding points where OF computation is not reliable. This paper presents a statistical probabilistic framework for assessing the quality of a given CM. Our quality measure is given in terms of the percentage of pixels whose OF error bound can not be determined by CM values. We also provide statistical tools for the computation of CM values that ensures a given accuracy of the flow field. |
|
| |
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 |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
CVTT:E2M |
|
| |
Notes |
IAM; ADAS; 600.044; 600.057; 601.145 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ MGH2013b |
Serial |
2351 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jiaolong Xu; Sebastian Ramos; Xu Hu; David Vazquez; Antonio Lopez |
|
| |
Title |
Multi-task Bilinear Classifiers for Visual Domain Adaptation |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
Advances in Neural Information Processing Systems Workshop |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Domain Adaptation; Pedestrian Detection; ADAS |
|
| |
Abstract |
We propose a method that aims to lessen the significant accuracy degradation
that a discriminative classifier can suffer when it is trained in a specific domain (source domain) and applied in a different one (target domain). The principal reason for this degradation is the discrepancies in the distribution of the features that feed the classifier in different domains. Therefore, we propose a domain adaptation method that maps the features from the different domains into a common subspace and learns a discriminative domain-invariant classifier within it. Our algorithm combines bilinear classifiers and multi-task learning for domain adaptation.
The bilinear classifier encodes the feature transformation and classification
parameters by a matrix decomposition. In this way, specific feature transformations for multiple domains and a shared classifier are jointly learned in a multi-task learning framework. Focusing on domain adaptation for visual object detection, we apply this method to the state-of-the-art deformable part-based model for cross domain pedestrian detection. Experimental results show that our method significantly avoids the domain drift and improves the accuracy when compared to several baselines. |
|
| |
Address |
Lake Tahoe; Nevada; USA; 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 |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
NIPSW |
|
| |
Notes |
ADAS; 600.054; 600.057; 601.217;ISE |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ XRH2013 |
Serial |
2340 |
|
| 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 |
Naveen Onkarappa; Angel Sappa |
|
| |
Title |
Laplacian Derivative based Regularization for Optical Flow Estimation in Driving Scenario |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
15th International Conference on Computer Analysis of Images and Patterns |
Abbreviated Journal |
|
|
| |
Volume |
8048 |
Issue |
|
Pages |
483-490 |
|
| |
Keywords |
Optical flow; regularization; Driver Assistance Systems; Performance Evaluation |
|
| |
Abstract |
Existing state of the art optical flow approaches, which are evaluated on standard datasets such as Middlebury, not necessarily have a similar performance when evaluated on driving scenarios. This drop on performance is due to several challenges arising on real scenarios during driving. Towards this direction, in this paper, we propose a modification to the regularization term in a variational optical flow formulation, that notably improves the results, specially in driving scenarios. The proposed modification consists on using the Laplacian derivatives of flow components in the regularization term instead of gradients of flow components. We show the improvements in results on a standard real image sequences dataset (KITTI). |
|
| |
Address |
York; UK; August 2013 |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer Berlin Heidelberg |
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-40245-6 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
CAIP |
|
| |
Notes |
ADAS; 600.055; 601.215 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ OnS2013b |
Serial |
2244 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
German Ros; J. Guerrero; Angel Sappa; Antonio Lopez |
|
| |
Title |
VSLAM pose initialization via Lie groups and Lie algebras optimization |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
Proceedings of IEEE International Conference on Robotics and Automation |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
5740 - 5747 |
|
| |
Keywords |
SLAM |
|
| |
Abstract |
We present a novel technique for estimating initial 3D poses in the context of localization and Visual SLAM problems. The presented approach can deal with noise, outliers and a large amount of input data and still performs in real time in a standard CPU. Our method produces solutions with an accuracy comparable to those produced by RANSAC but can be much faster when the percentage of outliers is high or for large amounts of input data. On the current work we propose to formulate the pose estimation as an optimization problem on Lie groups, considering their manifold structure as well as their associated Lie algebras. This allows us to perform a fast and simple optimization at the same time that conserve all the constraints imposed by the Lie group SE(3). Additionally, we present several key design concepts related with the cost function and its Jacobian; aspects that are critical for the good performance of the algorithm. |
|
| |
Address |
Karlsruhe; Germany; May 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 |
1050-4729 |
ISBN |
978-1-4673-5641-1 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICRA |
|
| |
Notes |
ADAS; 600.054; 600.055; 600.057 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RGS2013a; ADAS @ adas @ |
Serial |
2225 |
|
| Permanent link to this record |
