Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

<< 1 2 3 4 5 6 7 8 9 10 >>

List View

Citations

Details

	Records
	Author	B. Zhou; Agata Lapedriza; J. Xiao; A. Torralba; A. Oliva
	Title	Learning Deep Features for Scene Recognition using Places Database			Type	Conference Article
	Year	2014	Publication	28th Annual Conference on Neural Information Processing Systems	Abbreviated Journal
	Volume		Issue		Pages	487-495
	Keywords
	Abstract
	Address	Montreal; Canada; December 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	NIPS
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ ZLX2014			Serial	2621
Permanent link to this record



	Author	Agata Lapedriza; David Masip; David Sanchez
	Title	Emotions Classification using Facial Action Units Recognition			Type	Conference Article
	Year	2014	Publication	17th International Conference of the Catalan Association for Artificial Intelligence	Abbreviated Journal
	Volume	269	Issue		Pages	55-64
	Keywords
	Abstract	In this work we build a system for automatic emotion classification from image sequences. We analyze subtle changes in facial expressions by detecting a subset of 12 representative facial action units (AUs). Then, we classify emotions based on the output of these AUs classifiers, i.e. the presence/absence of AUs. We base the AUs classification upon a set of spatio-temporal geometric and appearance features for facial representation, fusing them within the emotion classifier. A decision tree is trained for emotion classifying, making the resulting model easy to interpret by capturing the combination of AUs activation that lead to a particular emotion. For Cohn-Kanade database, the proposed system classifies 7 emotions with a mean accuracy of near 90%, attaining a similar recognition accuracy in comparison with non-interpretable models that are not based in AUs detection.
	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	978-1-61499-451-0	Medium
	Area		Expedition		Conference	CCIA
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ LMS2014			Serial	2622
Permanent link to this record



	Author	Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados
	Title	Hierarchical Plausibility-Graphs for Symbol Spotting in Graphical Documents			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	25-37
	Keywords
	Abstract	Graph representation of graphical documents often suffers from noise such as spurious nodes and edges, and their discontinuity. In general these errors occur during the low-level image processing viz. binarization, skeletonization, vectorization etc. Hierarchical graph representation is a nice and efficient way to solve this kind of problem by hierarchically merging node-node and node-edge depending on the distance. But the creation of hierarchical graph representing the graphical information often uses hard thresholds on the distance to create the hierarchical nodes (next state) of the lower nodes (or states) of a graph. As a result, the representation often loses useful information. This paper introduces plausibilities to the nodes of hierarchical graph as a function of distance and proposes a modified algorithm for matching subgraphs of the hierarchical graphs. The plausibility-annotated nodes help to improve the performance of the matching algorithm on two hierarchical structures. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 600.056; 600.061; 600.077			Approved	no
	Call Number	Admin @ si @ BDJ2014			Serial	2699
Permanent link to this record



	Author	Marçal Rusiñol; Dimosthenis Karatzas; Josep Llados
	Title	Spotting Graphical Symbols in Camera-Acquired Documents in Real Time			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	3-10
	Keywords
	Abstract	In this paper we present a system devoted to spot graphical symbols in camera-acquired document images. The system is based on the extraction and further matching of ORB compact local features computed over interest key-points. Then, the FLANN indexing framework based on approximate nearest neighbor search allows to efficiently match local descriptors between the captured scene and the graphical models. Finally, the RANSAC algorithm is used in order to compute the homography between the spotted symbol and its appearance in the document image. The proposed approach is efficient and is able to work in real time.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 600.055; 600.061; 600.077			Approved	no
	Call Number	Admin @ si @ RKL2014			Serial	2700
Permanent link to this record



	Author	Marçal Rusiñol; V. Poulain d'Andecy; Dimosthenis Karatzas; Josep Llados
	Title	Classification of Administrative Document Images by Logo Identification			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	49-58
	Keywords	Administrative Document Classification; Logo Recognition; Logo Spotting
	Abstract	This paper is focused on the categorization of administrative document images (such as invoices) based on the recognition of the supplier’s graphical logo. Two different methods are proposed, the first one uses a bag-of-visual-words model whereas the second one tries to locate logo images described by the blurred shape model descriptor within documents by a sliding-window technique. Preliminar results are reported with a dataset of real administrative documents.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.056; 600.045; 605.203; 600.077			Approved	no
	Call Number	Admin @ si @ RPK2014			Serial	2701
Permanent link to this record



	Author	L. Rothacker; Marçal Rusiñol; Josep Llados; G.A. Fink
	Title	A Two-stage Approach to Segmentation-Free Query-by-example Word Spotting			Type	Journal
	Year	2014	Publication	Manuscript Cultures	Abbreviated Journal
	Volume	7	Issue		Pages	47-58
	Keywords
	Abstract	With the ongoing progress in digitization, huge document collections and archives have become available to a broad audience. Scanned document images can be transmitted electronically and studied simultaneously throughout the world. While this is very beneficial, it is often impossible to perform automated searches on these document collections. Optical character recognition usually fails when it comes to handwritten or historic documents. In order to address the need for exploring document collections rapidly, researchers are working on word spotting. In query-by-example word spotting scenarios, the user selects an exemplary occurrence of the query word in a document image. The word spotting system then retrieves all regions in the collection that are visually similar to the given example of the query word. The best matching regions are presented to the user and no actual transcription is required. An important property of a word spotting system is the computational speed with which queries can be executed. In our previous work, we presented a relatively slow but high-precision method. In the present work, we will extend this baseline system to an integrated two-stage approach. In a coarse-grained first stage, we will filter document images efficiently in order to identify regions that are likely to contain the query word. In the fine-grained second stage, these regions will be analyzed with our previously presented high-precision method. Finally, we will report recognition results and query times for the well-known George Washington benchmark in our evaluation. We achieve state-of-the-art recognition results while the query times can be reduced to 50% in comparison with our baseline.
	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; 600.061; 600.077			Approved	no
	Call Number	Admin @ si @			Serial	3190
Permanent link to this record



	Author	Albert Gordo; Florent Perronnin; Yunchao Gong; Svetlana Lazebnik
	Title	Asymmetric Distances for Binary Embeddings			Type	Journal Article
	Year	2014	Publication	IEEE Transactions on Pattern Analysis and Machine Intelligence	Abbreviated Journal	TPAMI
	Volume	36	Issue	1	Pages	33-47
	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), PCA Embedding (PCAE), PCA Embedding with random rotations (PCAE-RR), and PCA Embedding with iterative quantization (PCAE-ITQ). 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.
	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	DAG; 600.045; 605.203; 600.077			Approved	no
	Call Number	Admin @ si @ GPG2014			Serial	2272
Permanent link to this record



	Author	Palaiahnakote Shivakumara; Anjan Dutta; Chew Lim Tan; Umapada Pal
	Title	Multi-oriented scene text detection in video based on wavelet and angle projection boundary growing			Type	Journal Article
	Year	2014	Publication	Multimedia Tools and Applications	Abbreviated Journal	MTAP
	Volume	72	Issue	1	Pages	515-539
	Keywords
	Abstract	In this paper, we address two complex issues: 1) Text frame classification and 2) Multi-oriented text detection in video text frame. We first divide a video frame into 16 blocks and propose a combination of wavelet and median-moments with k-means clustering at the block level to identify probable text blocks. For each probable text block, the method applies the same combination of feature with k-means clustering over a sliding window running through the blocks to identify potential text candidates. We introduce a new idea of symmetry on text candidates in each block based on the observation that pixel distribution in text exhibits a symmetric pattern. The method integrates all blocks containing text candidates in the frame and then all text candidates are mapped on to a Sobel edge map of the original frame to obtain text representatives. To tackle the multi-orientation problem, we present a new method called Angle Projection Boundary Growing (APBG) which is an iterative algorithm and works based on a nearest neighbor concept. APBG is then applied on the text representatives to fix the bounding box for multi-oriented text lines in the video frame. Directional information is used to eliminate false positives. Experimental results on a variety of datasets such as non-horizontal, horizontal, publicly available data (Hua’s data) and ICDAR-03 competition data (camera images) show that the proposed method outperforms existing methods proposed for video and the state of the art methods for scene text as well.
	Address
	Corporate Author				Thesis
	Publisher	Springer US	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1380-7501	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.077			Approved	no
	Call Number	Admin @ si @ SDT2014			Serial	2357
Permanent link to this record



	Author	Antonio Hernandez; Miguel Angel Bautista; Xavier Perez Sala; Victor Ponce; Sergio Escalera; Xavier Baro; Oriol Pujol; Cecilio Angulo
	Title	Probability-based Dynamic Time Warping and Bag-of-Visual-and-Depth-Words for Human Gesture Recognition in RGB-D			Type	Journal Article
	Year	2014	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	50	Issue	1	Pages	112-121
	Keywords	RGB-D; Bag-of-Words; Dynamic Time Warping; Human Gesture Recognition
	Abstract	PATREC5825 We present a methodology to address the problem of human gesture segmentation and recognition in video and depth image sequences. A Bag-of-Visual-and-Depth-Words (BoVDW) model is introduced as an extension of the Bag-of-Visual-Words (BoVW) model. State-of-the-art RGB and depth features, including a newly proposed depth descriptor, are analysed and combined in a late fusion form. The method is integrated in a Human Gesture Recognition pipeline, together with a novel probability-based Dynamic Time Warping (PDTW) algorithm which is used to perform prior segmentation of idle gestures. The proposed DTW variant uses samples of the same gesture category to build a Gaussian Mixture Model driven probabilistic model of that gesture class. Results of the whole Human Gesture Recognition pipeline in a public data set show better performance in comparison to both standard BoVW model and DTW 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	HuPBA;MV; 605.203			Approved	no
	Call Number	Admin @ si @ HBP2014			Serial	2353
Permanent link to this record



	Author	Marco Pedersoli; Jordi Gonzalez; Xu Hu; Xavier Roca
	Title	Toward Real-Time Pedestrian Detection Based on a Deformable Template Model			Type	Journal Article
	Year	2014	Publication	IEEE Transactions on Intelligent Transportation Systems	Abbreviated Journal	TITS
	Volume	15	Issue	1	Pages	355-364
	Keywords
	Abstract	Most advanced driving assistance systems already include pedestrian detection systems. Unfortunately, there is still a tradeoff between precision and real time. For a reliable detection, excellent precision-recall such a tradeoff is needed to detect as many pedestrians as possible while, at the same time, avoiding too many false alarms; in addition, a very fast computation is needed for fast reactions to dangerous situations. Recently, novel approaches based on deformable templates have been proposed since these show a reasonable detection performance although they are computationally too expensive for real-time performance. In this paper, we present a system for pedestrian detection based on a hierarchical multiresolution part-based model. The proposed system is able to achieve state-of-the-art detection accuracy due to the local deformations of the parts while exhibiting a speedup of more than one order of magnitude due to a fast coarse-to-fine inference technique. Moreover, our system explicitly infers the level of resolution available so that the detection of small examples is feasible with a very reduced computational cost. We conclude this contribution by presenting how a graphics processing unit-optimized implementation of our proposed system is suitable for real-time pedestrian detection in terms of both accuracy and speed.
	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	ISE; 601.213; 600.078			Approved	no
	Call Number	PGH2014			Serial	2350
Permanent link to this record



	Author	Bogdan Raducanu; Fadi Dornaika
	Title	Embedding new observations via sparse-coding for non-linear manifold learning			Type	Journal Article
	Year	2014	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	47	Issue	1	Pages	480-492
	Keywords
	Abstract	Non-linear dimensionality reduction techniques are affected by two critical aspects: (i) the design of the adjacency graphs, and (ii) the embedding of new test data-the out-of-sample problem. For the first aspect, the proposed solutions, in general, were heuristically driven. For the second aspect, the difficulty resides in finding an accurate mapping that transfers unseen data samples into an existing manifold. Past works addressing these two aspects were heavily parametric in the sense that the optimal performance is only achieved for a suitable parameter choice that should be known in advance. In this paper, we demonstrate that the sparse representation theory not only serves for automatic graph construction as shown in recent works, but also represents an accurate alternative for out-of-sample embedding. Considering for a case study the Laplacian Eigenmaps, we applied our method to the face recognition problem. To evaluate the effectiveness of the proposed out-of-sample embedding, experiments are conducted using the K-nearest neighbor (KNN) and Kernel Support Vector Machines (KSVM) classifiers on six public face datasets. The experimental results show that the proposed model is able to achieve high categorization effectiveness as well as high consistency with non-linear embeddings/manifolds obtained in batch modes.
	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	LAMP;			Approved	no
	Call Number	Admin @ si @ RaD2013b			Serial	2316
Permanent link to this record



	Author	Naveen Onkarappa; Angel Sappa
	Title	Speed and Texture: An Empirical Study on Optical-Flow Accuracy in ADAS Scenarios			Type	Journal Article
	Year	2014	Publication	IEEE Transactions on Intelligent Transportation Systems	Abbreviated Journal	TITS
	Volume	15	Issue	1	Pages	136-147
	Keywords
	Abstract	IF: 3.064 Increasing mobility in everyday life has led to the concern for the safety of automotives and human life. Computer vision has become a valuable tool for developing driver assistance applications that target such a concern. Many such vision-based assisting systems rely on motion estimation, where optical flow has shown its potential. A variational formulation of optical flow that achieves a dense flow field involves a data term and regularization terms. Depending on the image sequence, the regularization has to appropriately be weighted for better accuracy of the flow field. Because a vehicle can be driven in different kinds of environments, roads, and speeds, optical-flow estimation has to be accurately computed in all such scenarios. In this paper, we first present the polar representation of optical flow, which is quite suitable for driving scenarios due to the possibility that it offers to independently update regularization factors in different directional components. Then, we study the influence of vehicle speed and scene texture on optical-flow accuracy. Furthermore, we analyze the relationships of these specific characteristics on a driving scenario (vehicle speed and road texture) with the regularization weights in optical flow for better accuracy. As required by the work in this paper, we have generated several synthetic sequences along with ground-truth flow fields.
	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	ADAS; 600.076			Approved	no
	Call Number	Admin @ si @ OnS2014a			Serial	2386
Permanent link to this record



	Author	Cesar Isaza; Joaquin Salas; Bogdan Raducanu
	Title	Rendering ground truth data sets to detect shadows cast by static objects in outdoors			Type	Journal Article
	Year	2014	Publication	Multimedia Tools and Applications	Abbreviated Journal	MTAP
	Volume	70	Issue	1	Pages	557-571
	Keywords	Synthetic ground truth data set; Sun position; Shadow detection; Static objects shadow detection
	Abstract	In our work, we are particularly interested in studying the shadows cast by static objects in outdoor environments, during daytime. To assess the accuracy of a shadow detection algorithm, we need ground truth information. The collection of such information is a very tedious task because it is a process that requires manual annotation. To overcome this severe limitation, we propose in this paper a methodology to automatically render ground truth using a virtual environment. To increase the degree of realism and usefulness of the simulated environment, we incorporate in the scenario the precise longitude, latitude and elevation of the actual location of the object, as well as the sun’s position for a given time and day. To evaluate our method, we consider a qualitative and a quantitative comparison. In the quantitative one, we analyze the shadow cast by a real object in a particular geographical location and its corresponding rendered model. To evaluate qualitatively the methodology, we use some ground truth images obtained both manually and automatically.
	Address
	Corporate Author				Thesis
	Publisher	Springer US	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1380-7501	ISBN		Medium
	Area		Expedition		Conference
	Notes	LAMP;			Approved	no
	Call Number	Admin @ si @ ISR2014			Serial	2229
Permanent link to this record



	Author	Shida Beigpour; Christian Riess; Joost Van de Weijer; Elli Angelopoulou
	Title	Multi-Illuminant Estimation with Conditional Random Fields			Type	Journal Article
	Year	2014	Publication	IEEE Transactions on Image Processing	Abbreviated Journal	TIP
	Volume	23	Issue	1	Pages	83-95
	Keywords	color constancy; CRF; multi-illuminant
	Abstract	Most existing color constancy algorithms assume uniform illumination. However, in real-world scenes, this is not often the case. Thus, we propose a novel framework for estimating the colors of multiple illuminants and their spatial distribution in the scene. We formulate this problem as an energy minimization task within a conditional random field over a set of local illuminant estimates. In order to quantitatively evaluate the proposed method, we created a novel data set of two-dominant-illuminant images comprised of laboratory, indoor, and outdoor scenes. Unlike prior work, our database includes accurate pixel-wise ground truth illuminant information. The performance of our method is evaluated on multiple data sets. Experimental results show that our framework clearly outperforms single illuminant estimators as well as a recently proposed multi-illuminant estimation 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	1057-7149	ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC; LAMP; 600.074; 600.079			Approved	no
	Call Number	Admin @ si @ BRW2014			Serial	2451
Permanent link to this record



	Author	Jiaolong Xu; Sebastian Ramos; David Vazquez; Antonio Lopez
	Title	Domain Adaptation of Deformable Part-Based Models			Type	Journal Article
	Year	2014	Publication	IEEE Transactions on Pattern Analysis and Machine Intelligence	Abbreviated Journal	TPAMI
	Volume	36	Issue	12	Pages	2367-2380
	Keywords	Domain Adaptation; Pedestrian Detection
	Abstract	The accuracy of object classifiers can significantly drop when the training data (source domain) and the application scenario (target domain) have inherent differences. Therefore, adapting the classifiers to the scenario in which they must operate is of paramount importance. We present novel domain adaptation (DA) methods for object detection. As proof of concept, we focus on adapting the state-of-the-art deformable part-based model (DPM) for pedestrian detection. We introduce an adaptive structural SVM (A-SSVM) that adapts a pre-learned classifier between different domains. By taking into account the inherent structure in feature space (e.g., the parts in a DPM), we propose a structure-aware A-SSVM (SA-SSVM). Neither A-SSVM nor SA-SSVM needs to revisit the source-domain training data to perform the adaptation. Rather, a low number of target-domain training examples (e.g., pedestrians) are used. To address the scenario where there are no target-domain annotated samples, we propose a self-adaptive DPM based on a self-paced learning (SPL) strategy and a Gaussian Process Regression (GPR). Two types of adaptation tasks are assessed: from both synthetic pedestrians and general persons (PASCAL VOC) to pedestrians imaged from an on-board camera. Results show that our proposals avoid accuracy drops as high as 15 points when comparing adapted and non-adapted detectors.
	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; 601.217; 600.076			Approved	no
	Call Number	ADAS @ adas @ XRV2014b			Serial	2436
Permanent link to this record