| |
Records |
Links |
|
Author |
G. Roig; Xavier Boix; F. de la Torre; Joan Serrat; C. Vilella |
|
| |
Title |
Hierarchical CRF with product label spaces for parts-based Models |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
IEEE Conference on Automatic Face and Gesture Recognition |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
Non-rigid object detection is a challenging an open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, human-computer interaction or image auto-annotation. Most successful approaches to non-rigid object detection make use of part-based models. In particular, Conditional Random Fields (CRF) have been successfully embedded into a discriminative parts-based model framework due to its effectiveness for learning and inference (usually based on a tree structure). However, CRF-based approaches do not incorporate global constraints and only model pairwise interactions. This is especially important when modeling object classes that may have complex parts interactions (e.g. facial features or body articulations), because neglecting them yields an oversimplified model with suboptimal performance. To overcome this limitation, this paper proposes a novel hierarchical CRF (HCRF). The main contribution is to build a hierarchy of part combinations by extending the label set to a hierarchy of product label spaces. In order to keep the inference computation tractable, we propose an effective method to reduce the new label set. We test our method on two applications: facial feature detection on the Multi-PIE database and human pose estimation on the Buffy dataset. |
|
| |
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 |
FG |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RBT2011 |
Serial |
1862 |
|
| 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 |
David Vazquez; Antonio Lopez; Daniel Ponsa |
|
| |
Title |
Unsupervised Domain Adaptation of Virtual and Real Worlds for Pedestrian Detection |
Type |
Conference Article |
| |
Year |
2012 |
Publication |
21st International Conference on Pattern Recognition |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
3492 - 3495 |
|
| |
Keywords |
Pedestrian Detection; Domain Adaptation; Virtual worlds |
|
| |
Abstract |
Vision-based object detectors are crucial for different applications. They rely on learnt object models. Ideally, we would like to deploy our vision system in the scenario where it must operate, and lead it to self-learn how to distinguish the objects of interest, i.e., without human intervention. However, the learning of each object model requires labelled samples collected through a tiresome manual process. For instance, we are interested in exploring the self-training of a pedestrian detector for driver assistance systems. Our first approach to avoid manual labelling consisted in the use of samples coming from realistic computer graphics, so that their labels are automatically available [12]. This would make possible the desired self-training of our pedestrian detector. However, as we showed in [14], between virtual and real worlds it may be a dataset shift. In order to overcome it, we propose the use of unsupervised domain adaptation techniques that avoid human intervention during the adaptation process. In particular, this paper explores the use of the transductive SVM (T-SVM) learning algorithm in order to adapt virtual and real worlds for pedestrian detection (Fig. 1). |
|
| |
Address |
Tsukuba Science City, Japan |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
IEEE |
Place of Publication |
Tsukuba Science City, JAPAN |
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1051-4651 |
ISBN |
978-1-4673-2216-4 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICPR |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ VLP2012 |
Serial |
1981 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jose Carlos Rubio; Joan Serrat; Antonio Lopez; N. Paragios |
|
| |
Title |
Image Contextual Representation and Matching through Hierarchies and Higher Order Graphs |
Type |
Conference Article |
| |
Year |
2012 |
Publication |
21st International Conference on Pattern Recognition |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
2664 - 2667 |
|
| |
Keywords |
|
|
| |
Abstract |
We present a region matching algorithm which establishes correspondences between regions from two segmented images. An abstract graph-based representation conceals the image in a hierarchical graph, exploiting the scene properties at two levels. First, the similarity and spatial consistency of the image semantic objects is encoded in a graph of commute times. Second, the cluttered regions of the semantic objects are represented with a shape descriptor. Many-to-many matching of regions is specially challenging due to the instability of the segmentation under slight image changes, and we explicitly handle it through high order potentials. We demonstrate the matching approach applied to images of world famous buildings, captured under different conditions, showing the robustness of our method to large variations in illumination and viewpoint. |
|
| |
Address |
Tsukuba Science City, Japan |
|
| |
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 |
978-1-4673-2216-4 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICPR |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RSL2012a; |
Serial |
2032 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Patricia Marquez;Debora Gil;Aura Hernandez-Sabate |
|
| |
Title |
A Complete Confidence Framework for Optical Flow |
Type |
Conference Article |
| |
Year |
2012 |
Publication |
12th European Conference on Computer Vision – Workshops and Demonstrations |
Abbreviated Journal |
|
|
| |
Volume |
7584 |
Issue |
2 |
Pages |
124-133 |
|
| |
Keywords |
Optical flow, confidence measures, sparsification plots, error prediction plots |
|
| |
Abstract |
Medial representations are powerful tools for describing and parameterizing the volumetric shape of anatomical structures. Existing methods show excellent results when applied to 2D objects, but their quality drops across dimensions. This paper contributes to the computation of medial manifolds in two aspects. First, we provide a standard scheme for the computation of medial manifolds that avoid degenerated medial axis segments; second, we introduce an energy based method which performs independently of the dimension. We evaluate quantitatively the performance of our method with respect to existing approaches, by applying them to synthetic shapes of known medial geometry. Finally, we show results on shape representation of multiple abdominal organs, exploring the use of medial manifolds for the representation of multi-organ relations. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer-Verlag |
Place of Publication |
Florence, Italy, October 7-13, 2012 |
Editor |
Andrea Fusiello, Vittorio Murino ,Rita Cucchiara |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
978-3-642-33867-0 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ECCVW |
|
| |
Notes |
IAM;ADAS; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ MGH2012b |
Serial |
1991 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Diego Cheda; Daniel Ponsa; Antonio Lopez |
|
| |
Title |
Monocular Egomotion Estimation based on Image Matching |
Type |
Conference Article |
| |
Year |
2012 |
Publication |
1st International Conference on Pattern Recognition Applications and Methods |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
425-430 |
|
| |
Keywords |
SLAM |
|
| |
Abstract |
|
|
| |
Address |
Portugal |
|
| |
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 |
ICPRAM |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CPL2012a;; ADAS @ adas @ |
Serial |
2011 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Diego Cheda; Daniel Ponsa; Antonio Lopez |
|
| |
Title |
Monocular Depth-based Background Estimation |
Type |
Conference Article |
| |
Year |
2012 |
Publication |
7th International Conference on Computer Vision Theory and Applications |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
323-328 |
|
| |
Keywords |
|
|
| |
Abstract |
In this paper, we address the problem of reconstructing the background of a scene from a video sequence with occluding objects. The images are taken by hand-held cameras. Our method composes the background by selecting the appropriate pixels from previously aligned input images. To do that, we minimize a cost function that penalizes the deviations from the following assumptions: background represents objects whose distance to the camera is maximal, and background objects are stationary. Distance information is roughly obtained by a supervised learning approach that allows us to distinguish between close and distant image regions. Moving foreground objects are filtered out by using stationariness and motion boundary constancy measurements. The cost function is minimized by a graph cuts method. We demonstrate the applicability of our approach to recover an occlusion-free background in a set of sequences. |
|
| |
Address |
Roma |
|
| |
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 |
VISAPP |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CPL2012b; ADAS @ adas @ cpl2012e |
Serial |
2012 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Diego Cheda; Daniel Ponsa; Antonio Lopez |
|
| |
Title |
Pedestrian Candidates Generation using Monocular Cues |
Type |
Conference Article |
| |
Year |
2012 |
Publication |
IEEE Intelligent Vehicles Symposium |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
7-12 |
|
| |
Keywords |
pedestrian detection |
|
| |
Abstract |
Common techniques for pedestrian candidates generation (e.g., sliding window approaches) are based on an exhaustive search over the image. This implies that the number of windows produced is huge, which translates into a significant time consumption in the classification stage. In this paper, we propose a method that significantly reduces the number of windows to be considered by a classifier. Our method is a monocular one that exploits geometric and depth information available on single images. Both representations of the world are fused together to generate pedestrian candidates based on an underlying model which is focused only on objects standing vertically on the ground plane and having certain height, according with their depths on the scene. We evaluate our algorithm on a challenging dataset and demonstrate its application for pedestrian detection, where a considerable reduction in the number of candidate windows is reached. |
|
| |
Address |
|
|
| |
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 |
1931-0587 |
ISBN |
978-1-4673-2119-8 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IV |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CPL2012c; ADAS @ adas @ cpl2012d |
Serial |
2013 |
|
| Permanent link to this record |
