Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	511–525 of 3413 records found matching your query (RSS \| history):

Search & Display Options

Select All Deselect All

[21–30] << 31 32 33 34 35 36 37 38 39 40 >> [41–50]

List View

Citations

Details

	Records
	Author	German Ros; Laura Sellart; Joanna Materzynska; David Vazquez; Antonio Lopez
	Title	The SYNTHIA Dataset: A Large Collection of Synthetic Images for Semantic Segmentation of Urban Scenes			Type	Conference Article
	Year	2016	Publication	29th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	3234-3243
	Keywords	Domain Adaptation; Autonomous Driving; Virtual Data; Semantic Segmentation
	Abstract	Vision-based semantic segmentation in urban scenarios is a key functionality for autonomous driving. The irruption of deep convolutional neural networks (DCNNs) allows to foresee obtaining reliable classifiers to perform such a visual task. However, DCNNs require to learn many parameters from raw images; thus, having a sufficient amount of diversified images with this class annotations is needed. These annotations are obtained by a human cumbersome labour specially challenging for semantic segmentation, since pixel-level annotations are required. In this paper, we propose to use a virtual world for automatically generating realistic synthetic images with pixel-level annotations. Then, we address the question of how useful can be such data for the task of semantic segmentation; in particular, when using a DCNN paradigm. In order to answer this question we have generated a synthetic diversified collection of urban images, named SynthCity, with automatically generated class annotations. We use SynthCity in combination with publicly available real-world urban images with manually provided annotations. Then, we conduct experiments on a DCNN setting that show how the inclusion of SynthCity in the training stage significantly improves the performance of the semantic segmentation task
	Address	Las Vegas; USA; June 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	CVPR
	Notes	ADAS; 600.085; 600.082; 600.076			Approved	no
	Call Number	ADAS @ adas @ RSM2016			Serial	2739
Permanent link to this record



	Author	Marc Serra; Olivier Penacchio; Robert Benavente; Maria Vanrell; Dimitris Samaras
	Title	The Photometry of Intrinsic Images			Type	Conference Article
	Year	2014	Publication	27th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	1494-1501
	Keywords
	Abstract	Intrinsic characterization of scenes is often the best way to overcome the illumination variability artifacts that complicate most computer vision problems, from 3D reconstruction to object or material recognition. This paper examines the deficiency of existing intrinsic image models to accurately account for the effects of illuminant color and sensor characteristics in the estimation of intrinsic images and presents a generic framework which incorporates insights from color constancy research to the intrinsic image decomposition problem. The proposed mathematical formulation includes information about the color of the illuminant and the effects of the camera sensors, both of which modify the observed color of the reflectance of the objects in the scene during the acquisition process. By modeling these effects, we get a “truly intrinsic” reflectance image, which we call absolute reflectance, which is invariant to changes of illuminant or camera sensors. This model allows us to represent a wide range of intrinsic image decompositions depending on the specific assumptions on the geometric properties of the scene configuration and the spectral properties of the light source and the acquisition system, thus unifying previous models in a single general framework. We demonstrate that even partial information about sensors improves significantly the estimated reflectance images, thus making our method applicable for a wide range of sensors. We validate our general intrinsic image framework experimentally with both synthetic data and natural images.
	Address	Columbus; Ohio; USA; June 2014
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	CVPR
	Notes	CIC; 600.052; 600.051; 600.074			Approved	no
	Call Number	Admin @ si @ SPB2014			Serial	2506
Permanent link to this record



	Author	M. Danelljan; Fahad Shahbaz Khan; Michael Felsberg; Joost Van de Weijer
	Title	Adaptive color attributes for real-time visual tracking			Type	Conference Article
	Year	2014	Publication	27th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	1090 - 1097
	Keywords
	Abstract	Visual tracking is a challenging problem in computer vision. Most state-of-the-art visual trackers either rely on luminance information or use simple color representations for image description. Contrary to visual tracking, for object recognition and detection, sophisticated color features when combined with luminance have shown to provide excellent performance. Due to the complexity of the tracking problem, the desired color feature should be computationally efficient, and possess a certain amount of photometric invariance while maintaining high discriminative power. This paper investigates the contribution of color in a tracking-by-detection framework. Our results suggest that color attributes provides superior performance for visual tracking. We further propose an adaptive low-dimensional variant of color attributes. Both quantitative and attributebased evaluations are performed on 41 challenging benchmark color sequences. The proposed approach improves the baseline intensity-based tracker by 24% in median distance precision. Furthermore, we show that our approach outperforms state-of-the-art tracking methods while running at more than 100 frames per second.
	Address	Nottingham; UK; September 2014
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	CVPR
	Notes	CIC; LAMP; 600.074; 600.079			Approved	no
	Call Number	Admin @ si @ DKF2014			Serial	2509
Permanent link to this record



	Author	Rahat Khan; Joost Van de Weijer; Fahad Shahbaz Khan; Damien Muselet; christophe Ducottet; Cecile Barat
	Title	Discriminative Color Descriptors			Type	Conference Article
	Year	2013	Publication	IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	2866 - 2873
	Keywords
	Abstract	Color description is a challenging task because of large variations in RGB values which occur due to scene accidental events, such as shadows, shading, specularities, illuminant color changes, and changes in viewing geometry. Traditionally, this challenge has been addressed by capturing the variations in physics-based models, and deriving invariants for the undesired variations. The drawback of this approach is that sets of distinguishable colors in the original color space are mapped to the same value in the photometric invariant space. This results in a drop of discriminative power of the color description. In this paper we take an information theoretic approach to color description. We cluster color values together based on their discriminative power in a classification problem. The clustering has the explicit objective to minimize the drop of mutual information of the final representation. We show that such a color description automatically learns a certain degree of photometric invariance. We also show that a universal color representation, which is based on other data sets than the one at hand, can obtain competing performance. Experiments show that the proposed descriptor outperforms existing photometric invariants. Furthermore, we show that combined with shape description these color descriptors obtain excellent results on four challenging datasets, namely, PASCAL VOC 2007, Flowers-102, Stanford dogs-120 and Birds-200.
	Address	Portland; Oregon; June 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	1063-6919	ISBN		Medium
	Area		Expedition		Conference	CVPR
	Notes	CIC; 600.048			Approved	no
	Call Number	Admin @ si @ KWK2013a			Serial	2262
Permanent link to this record



	Author	Ivo Everts; Jan van Gemert; Theo Gevers
	Title	Evaluation of Color STIPs for Human Action Recognition			Type	Conference Article
	Year	2013	Publication	IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	2850-2857
	Keywords
	Abstract	This paper is concerned with recognizing realistic human actions in videos based on spatio-temporal interest points (STIPs). Existing STIP-based action recognition approaches operate on intensity representations of the image data. Because of this, these approaches are sensitive to disturbing photometric phenomena such as highlights and shadows. Moreover, valuable information is neglected by discarding chromaticity from the photometric representation. These issues are addressed by Color STIPs. Color STIPs are multi-channel reformulations of existing intensity-based STIP detectors and descriptors, for which we consider a number of chromatic representations derived from the opponent color space. This enhanced modeling of appearance improves the quality of subsequent STIP detection and description. Color STIPs are shown to substantially outperform their intensity-based counterparts on the challenging UCF~sports, UCF11 and UCF50 action recognition benchmarks. Moreover, the results show that color STIPs are currently the single best low-level feature choice for STIP-based approaches to human action recognition.
	Address	Portland; oregon; June 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	1063-6919	ISBN		Medium
	Area		Expedition		Conference	CVPR
	Notes	ALTRES;ISE			Approved	no
	Call Number	Admin @ si @ EGG2013			Serial	2364
Permanent link to this record



	Author	Albert Gordo; Jose Antonio Rodriguez; Florent Perronnin; Ernest Valveny
	Title	Leveraging category-level labels for instance-level image retrieval			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	3045-3052
	Keywords
	Abstract	In this article, we focus on the problem of large-scale instance-level image retrieval. For efficiency reasons, it is common to represent an image by a fixed-length descriptor which is subsequently encoded into a small number of bits. We note that most encoding techniques include an unsupervised dimensionality reduction step. Our goal in this work is to learn a better subspace in a supervised manner. We especially raise the following question: “can category-level labels be used to learn such a subspace?” To answer this question, we experiment with four learning techniques: the first one is based on a metric learning framework, the second one on attribute representations, the third one on Canonical Correlation Analysis (CCA) and the fourth one on Joint Subspace and Classifier Learning (JSCL). While the first three approaches have been applied in the past to the image retrieval problem, we believe we are the first to show the usefulness of JSCL in this context. In our experiments, we use ImageNet as a source of category-level labels and report retrieval results on two standard dataseis: INRIA Holidays and the University of Kentucky benchmark. Our experimental study shows that metric learning and attributes do not lead to any significant improvement in retrieval accuracy, as opposed to CCA and JSCL. As an example, we report on Holidays an increase in accuracy from 39.3% to 48.6% with 32-dimensional representations. Overall JSCL is shown to yield the best results.
	Address	Providence, Rhode Island
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GRP2012			Serial	2050
Permanent link to this record



	Author	Murad Al Haj; Jordi Gonzalez; Larry S. Davis
	Title	On Partial Least Squares in Head Pose Estimation: How to simultaneously deal with misalignment			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	2602-2609
	Keywords
	Abstract	Head pose estimation is a critical problem in many computer vision applications. These include human computer interaction, video surveillance, face and expression recognition. In most prior work on heads pose estimation, the positions of the faces on which the pose is to be estimated are specified manually. Therefore, the results are reported without studying the effect of misalignment. We propose a method based on partial least squares (PLS) regression to estimate pose and solve the alignment problem simultaneously. The contributions of this paper are two-fold: 1) we show that the kernel version of PLS (kPLS) achieves better than state-of-the-art results on the estimation problem and 2) we develop a technique to reduce misalignment based on the learned PLS factors.
	Address	Providence, Rhode Island
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ HGD2012			Serial	2029
Permanent link to this record



	Author	Jose Carlos Rubio; Joan Serrat; Antonio Lopez
	Title	Unsupervised co-segmentation through region matching			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	749-756
	Keywords
	Abstract	Co-segmentation is defined as jointly partitioning multiple images depicting the same or similar object, into foreground and background. Our method consists of a multiple-scale multiple-image generative model, which jointly estimates the foreground and background appearance distributions from several images, in a non-supervised manner. In contrast to other co-segmentation methods, our approach does not require the images to have similar foregrounds and different backgrounds to function properly. Region matching is applied to exploit inter-image information by establishing correspondences between the common objects that appear in the scene. Moreover, computing many-to-many associations of regions allow further applications, like recognition of object parts across images. We report results on iCoseg, a challenging dataset that presents extreme variability in camera viewpoint, illumination and object deformations and poses. We also show that our method is robust against large intra-class variability in the MSRC database.
	Address	Providence, Rhode Island
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ RSL2012b; ADAS @ adas @			Serial	2033
Permanent link to this record



	Author	Antonio Hernandez; Nadezhda Zlateva; Alexander Marinov; Miguel Reyes; Petia Radeva; Dimo Dimov; Sergio Escalera
	Title	Graph Cuts Optimization for Multi-Limb Human Segmentation in Depth Maps			Type	Conference Article
	Year	2012	Publication	25th IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	726-732
	Keywords
	Abstract	We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α-β swap Graph-cuts algorithm. Moreover, depth of spatio-temporal neighboring data points are used as boundary potentials. Results on a new multi-label human depth data set show high performance in terms of segmentation overlapping of the novel methodology compared to classical approaches.
	Address	Portland; Oregon; June 2013
	Corporate Author				Thesis
	Publisher	IEEE Xplore	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4673-1226-4	Medium
	Area		Expedition		Conference	CVPR
	Notes	MILAB;HuPBA			Approved	no
	Call Number	Admin @ si @ HZM2012b			Serial	2046
Permanent link to this record



	Author	Marco Pedersoli; Andrea Vedaldi; Jordi Gonzalez
	Title	A Coarse-to-fine Approach for fast Deformable Object Detection			Type	Conference Article
	Year	2011	Publication	IEEE conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	1353-1360
	Keywords
	Abstract
	Address	Colorado Springs; USA
	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	CVPR
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ PVG2011			Serial	1764
Permanent link to this record



	Author	Miguel Oliveira; Angel Sappa; V.Santos
	Title	Unsupervised Local Color Correction for Coarsely Registered Images			Type	Conference Article
	Year	2011	Publication	IEEE conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	201-208
	Keywords
	Abstract	The current paper proposes a new parametric local color correction technique. Initially, several color transfer functions are computed from the output of the mean shift color segmentation algorithm. Secondly, color influence maps are calculated. Finally, the contribution of every color transfer function is merged using the weights from the color influence maps. The proposed approach is compared with both global and local color correction approaches. Results show that our method outperforms the technique ranked first in a recent performance evaluation on this topic. Moreover, the proposed approach is computed in about one tenth of the time.
	Address	Colorado Springs
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4577-0394-2	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ OSS2011; ADAS @ adas @			Serial	1766
Permanent link to this record



	Author	Albert Gordo; Florent Perronnin
	Title	Asymmetric Distances for Binary Embeddings			Type	Conference Article
	Year	2011	Publication	IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	729 - 736
	Keywords
	Abstract	In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH) and Semi-Supervised Hashing (SSH). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques. We also propose a novel simple binary embedding technique – PCA Embedding (PCAE) – which is shown to yield competitive results with respect to more complex algorithms such as SH and SSH.
	Address	Providence, RI
	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-4577-0394-2	Medium
	Area		Expedition		Conference	CVPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GoP2011; IAM @ iam @ GoP2011			Serial	1817
Permanent link to this record



	Author	Jose Manuel Alvarez; Theo Gevers; Antonio Lopez
	Title	3D Scene Priors for Road Detection			Type	Conference Article
	Year	2010	Publication	23rd IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	57–64
	Keywords	road detection
	Abstract	Vision-based road detection is important in different areas of computer vision such as autonomous driving, car collision warning and pedestrian crossing detection. However, current vision-based road detection methods are usually based on low-level features and they assume structured roads, road homogeneity, and uniform lighting conditions. Therefore, in this paper, contextual 3D information is used in addition to low-level cues. Low-level photometric invariant cues are derived from the appearance of roads. Contextual cues used include horizon lines, vanishing points, 3D scene layout and 3D road stages. Moreover, temporal road cues are included. All these cues are sensitive to different imaging conditions and hence are considered as weak cues. Therefore, they are combined to improve the overall performance of the algorithm. To this end, the low-level, contextual and temporal cues are combined in a Bayesian framework to classify road sequences. Large scale experiments on road sequences show that the road detection method is robust to varying imaging conditions, road types, and scenarios (tunnels, urban and highway). Further, using the combined cues outperforms all other individual cues. Finally, the proposed method provides highest road detection accuracy when compared to state-of-the-art methods.
	Address	San Francisco; CA; USA; June 2010
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4244-6984-0	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS;ISE			Approved	no
	Call Number	ADAS @ adas @ AGL2010a			Serial	1302
Permanent link to this record



	Author	Javier Marin; David Vazquez; David Geronimo; Antonio Lopez
	Title	Learning Appearance in Virtual Scenarios for Pedestrian Detection			Type	Conference Article
	Year	2010	Publication	23rd IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	137–144
	Keywords	Pedestrian Detection; Domain Adaptation
	Abstract	Detecting pedestrians in images is a key functionality to avoid vehicle-to-pedestrian collisions. The most promising detectors rely on appearance-based pedestrian classifiers trained with labelled samples. This paper addresses the following question: can a pedestrian appearance model learnt in virtual scenarios work successfully for pedestrian detection in real images? (Fig. 1). Our experiments suggest a positive answer, which is a new and relevant conclusion for research in pedestrian detection. More specifically, we record training sequences in virtual scenarios and then appearance-based pedestrian classifiers are learnt using HOG and linear SVM. We test such classifiers in a publicly available dataset provided by Daimler AG for pedestrian detection benchmarking. This dataset contains real world images acquired from a moving car. The obtained result is compared with the one given by a classifier learnt using samples coming from real images. The comparison reveals that, although virtual samples were not specially selected, both virtual and real based training give rise to classifiers of similar performance.
	Address	San Francisco; CA; USA; June 2010
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language	English	Summary Language	English	Original Title	Learning Appearance in Virtual Scenarios for Pedestrian Detection
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4244-6984-0	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS			Approved	no
	Call Number	ADAS @ adas @ MVG2010			Serial	1304
Permanent link to this record



	Author	David Aldavert; Arnau Ramisa; Ramon Lopez de Mantaras; Ricardo Toledo
	Title	Fast and Robust Object Segmentation with the Integral Linear Classifier			Type	Conference Article
	Year	2010	Publication	23rd IEEE Conference on Computer Vision and Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	1046–1053
	Keywords
	Abstract	We propose an efficient method, built on the popular Bag of Features approach, that obtains robust multiclass pixel-level object segmentation of an image in less than 500ms, with results comparable or better than most state of the art methods. We introduce the Integral Linear Classifier (ILC), that can readily obtain the classification score for any image sub-window with only 6 additions and 1 product by fusing the accumulation and classification steps in a single operation. In order to design a method as efficient as possible, our building blocks are carefully selected from the quickest in the state of the art. More precisely, we evaluate the performance of three popular local descriptors, that can be very efficiently computed using integral images, and two fast quantization methods: the Hierarchical K-Means, and the Extremely Randomized Forest. Finally, we explore the utility of adding spatial bins to the Bag of Features histograms and that of cascade classifiers to improve the obtained segmentation. Our method is compared to the state of the art in the difficult Graz-02 and PASCAL 2007 Segmentation Challenge datasets.
	Address	San Francisco; CA; USA; June 2010
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1063-6919	ISBN	978-1-4244-6984-0	Medium
	Area		Expedition		Conference	CVPR
	Notes	ADAS			Approved	no
	Call Number	Admin @ si @ ARL2010a			Serial	1311
Permanent link to this record