| Home | [51–60] << 61 62 63 64 65 66 67 68 69 70 >> [71–80] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | David Rotger; Petia Radeva; N. Bruining | ||||
| Title | Automatic Detection of Bioabsorbable Coronary Stents in IVUS Images using a Cascade of Classifiers | Type | Journal Article | ||
| Year | 2010 | Publication | IEEE Transactions on Information Technology in Biomedicine | Abbreviated Journal | TITB |
| Volume | 14 | Issue | 2 | Pages | 535 – 537 |
| Keywords | |||||
| Abstract | Bioabsorbable drug-eluting coronary stents present a very promising improvement to the common metallic ones solving some of the most important problems of stent implantation: the late restenosis. These stents made of poly-L-lactic acid cause a very subtle acoustic shadow (compared to the metallic ones) making difficult the automatic detection and measurements in images. In this paper, we propose a novel approach based on a cascade of GentleBoost classifiers to detect the stent struts using structural features to code the information of the different subregions of the struts. A stochastic gradient descent method is applied to optimize the overall performance of the detector. Validation results of struts detection are very encouraging with an average F-measure of 81%. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor  |
|||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ RRB2010 | Serial | 1287 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Josep Llados; Gemma Sanchez; Dimosthenis Karatzas | ||||
| Title | Rotation Invariant Hand-Drawn Symbol Recognition based on a Dynamic Time Warping Model | Type | Journal Article | ||
| Year | 2010 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 13 | Issue | 3 | Pages | 229–241 |
| Keywords | |||||
| Abstract | One of the major difficulties of handwriting symbol recognition is the high variability among symbols because of the different writer styles. In this paper, we introduce a robust approach for describing and recognizing hand-drawn symbols tolerant to these writer style differences. This method, which is invariant to scale and rotation, is based on the dynamic time warping (DTW) algorithm. The symbols are described by vector sequences, a variation of the DTW distance is used for computing the matching distance, and K-Nearest Neighbor is used to classify them. Our approach has been evaluated in two benchmarking scenarios consisting of hand-drawn symbols. Compared with state-of-the-art methods for symbol recognition, our method shows higher tolerance to the irregular deformations induced by hand-drawn strokes. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor |
||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1433-2833 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; IF 2009: 1,213 | Approved | no | ||
| Call Number | DAG @ dag @ FLS2010a | Serial | 1288 | ||
| Permanent link to this record | |||||
| Author | Mathieu Nicolas Delalandre; Ernest Valveny; Tony Pridmore; Dimosthenis Karatzas | ||||
| Title | Generation of Synthetic Documents for Performance Evaluation of Symbol Recognition & Spotting Systems | Type | Journal Article | ||
| Year | 2010 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 13 | Issue | 3 | Pages | 187-207 |
| Keywords | |||||
| Abstract | This paper deals with the topic of performance evaluation of symbol recognition & spotting systems. We propose here a new approach to the generation of synthetic graphics documents containing non-isolated symbols in a real context. This approach is based on the definition of a set of constraints that permit us to place the symbols on a pre-defined background according to the properties of a particular domain (architecture, electronics, engineering, etc.). In this way, we can obtain a large amount of images resembling real documents by simply defining the set of constraints and providing a few pre-defined backgrounds. As documents are synthetically generated, the groundtruth (the location and the label of every symbol) becomes automatically available. We have applied this approach to the generation of a large database of architectural drawings and electronic diagrams, which shows the flexibility of the system. Performance evaluation experiments of a symbol localization system show that our approach permits to generate documents with different features that are reflected in variation of localization results. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor |
||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1433-2833 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ DVP2010 | Serial | 1289 | ||
| Permanent link to this record | |||||
| Author | Jose Antonio Rodriguez; Florent Perronnin; Gemma Sanchez; Josep Llados | ||||
| Title | Unsupervised writer adaptation of whole-word HMMs with application to word-spotting | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 8 | Pages | 742–749 |
| Keywords | Word-spotting; Handwriting recognition; Writer adaptation; Hidden Markov model; Document analysis | ||||
| Abstract | In this paper we propose a novel approach for writer adaptation in a handwritten word-spotting task. The method exploits the fact that the semi-continuous hidden Markov model separates the word model parameters into (i) a codebook of shapes and (ii) a set of word-specific parameters.
Our main contribution is to employ this property to derive writer-specific word models by statistically adapting an initial universal codebook to each document. This process is unsupervised and does not even require the appearance of the keyword(s) in the searched document. Experimental results show an increase in performance when this adaptation technique is applied. To the best of our knowledge, this is the first work dealing with adaptation for word-spotting. The preliminary version of this paper obtained an IBM Best Student Paper Award at the 19th International Conference on Pattern Recognition. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor |
||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RPS2010 | Serial | 1290 | ||
| Permanent link to this record | |||||
| Author | Partha Pratim Roy; Umapada Pal; Josep Llados | ||||
| Title | Seal Object Detection in Document Images using GHT of Local Component Shapes | Type | Conference Article | ||
| Year | 2010 | Publication | 10th ACM Symposium On Applied Computing | Abbreviated Journal | |
| Volume | Issue | Pages | 23–27 | ||
| Keywords | |||||
| Abstract | Due to noise, overlapped text/signature and multi-oriented nature, seal (stamp) object detection involves a difficult challenge. This paper deals with automatic detection of seal from documents with cluttered background. Here, a seal object is characterized by scale and rotation invariant spatial feature descriptors (distance and angular position) computed from recognition result of individual connected components (characters). Recognition of multi-scale and multi-oriented component is done using Support Vector Machine classifier. Generalized Hough Transform (GHT) is used to detect the seal and a voting is casted for finding possible location of the seal object in a document based on these spatial feature descriptor of components pairs. The peak of votes in GHT accumulator validates the hypothesis to locate the seal object in a document. Experimental results show that, the method is efficient to locate seal instance of arbitrary shape and orientation in documents. | ||||
| Address | Sierre, Switzerland | ||||
| 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 | SAC | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RPL2010a | Serial | 1291 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Josep Llados | ||||
| Title | Symbol Spotting in Digital Libraries:Focused Retrieval over Graphic-rich Document Collections | Type | Book Whole | ||
| Year | 2010 | Publication | Symbol Spotting in Digital Libraries:Focused Retrieval over Graphic-rich Document Collections | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Focused Retrieval , Graphical Pattern Indexation,Graphics Recognition ,Pattern Recognition , Performance Evaluation , Symbol Description ,Symbol Spotting | ||||
| Abstract | The specific problem of symbol recognition in graphical documents requires additional techniques to those developed for character recognition. The most well-known obstacle is the so-called Sayre paradox: Correct recognition requires good segmentation, yet improvement in segmentation is achieved using information provided by the recognition process. This dilemma can be avoided by techniques that identify sets of regions containing useful information. Such symbol-spotting methods allow the detection of symbols in maps or technical drawings without having to fully segment or fully recognize the entire content.
This unique text/reference provides a complete, integrated and large-scale solution to the challenge of designing a robust symbol-spotting method for collections of graphic-rich documents. The book examines a number of features and descriptors, from basic photometric descriptors commonly used in computer vision techniques to those specific to graphical shapes, presenting a methodology which can be used in a wide variety of applications. Additionally, readers are supplied with an insight into the problem of performance evaluation of spotting methods. Some very basic knowledge of pattern recognition, document image analysis and graphics recognition is assumed. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer | 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-84996-208-7 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RuL2010a | Serial | 1292 | ||
| Permanent link to this record | |||||
| Author | Muhammad Muzzamil Luqman; Thierry Brouard; Jean-Yves Ramel; Josep Llados | ||||
| Title | Vers une approche foue of encapsulation de graphes: application a la reconnaissance de symboles | Type | Conference Article | ||
| Year | 2010 | Publication | Colloque International Francophone sur l'Écrit et le Document | Abbreviated Journal | |
| Volume | Issue | Pages | 169-184 | ||
| Keywords | Fuzzy interval; Graph embedding; Bayesian network; Symbol recognition | ||||
| Abstract | We present a new methodology for symbol recognition, by employing a structural approach for representing visual associations in symbols and a statistical classifier for recognition. A graphic symbol is vectorized, its topological and geometrical details are encoded by an attributed relational graph and a signature is computed for it. Data adapted fuzzy intervals have been introduced for addressing the sensitivity of structural representations to noise. The joint probability distribution of signatures is encoded by a Bayesian network, which serves as a mechanism for pruning irrelevant features and choosing a subset of interesting features from structural signatures of underlying symbol set, and is deployed in a supervised learning scenario for recognizing query symbols. Experimental results on pre-segmented 2D linear architectural and electronic symbols from GREC databases are presented. | ||||
| Address | Sousse, Tunisia | ||||
| 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 | CIFED | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ LBR2010a | Serial | 1293 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Ernest Valveny; F. Serratosa; K. Riesen; Horst Bunke | ||||
| Title | Generalized Median Graph Computation by Means of Graph Embedding in Vector Spaces | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 43 | Issue | 4 | Pages | 1642–1655 |
| Keywords | Graph matching; Weighted mean of graphs; Median graph; Graph embedding; Vector spaces | ||||
| Abstract | The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we propose a new approach for the computation of the median graph based on graph embedding. Graphs are embedded into a vector space and the median is computed in the vector domain. We have designed a procedure based on the weighted mean of a pair of graphs to go from the vector domain back to the graph domain in order to obtain a final approximation of the median graph. Experiments on three different databases containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results. These experiments on real data open the door to the application of the median graph to a number of more complex machine learning algorithms where a representative of a set of graphs is needed. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor |
||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ FVS2010 | Serial | 1294 | ||
| Permanent link to this record | |||||
| Author | Jaume Amores | ||||
| Title | Vocabulary-based Approaches for Multiple-Instance Data: a Comparative Study | Type | Conference Article | ||
| Year | 2010 | Publication | 20th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 4246–4250 | ||
| Keywords | |||||
| Abstract | Multiple Instance Learning (MIL) has become a hot topic and many different algorithms have been proposed in the last years. Despite this fact, there is a lack of comparative studies that shed light into the characteristics of the different methods and their behavior in different scenarios. In this paper we provide such an analysis. We include methods from different families, and pay special attention to vocabulary-based approaches, a new family of methods that has not received much attention in the MIL literature. The empirical comparison includes seven databases from four heterogeneous domains, implementations of eight popular MIL methods, and a study of the behavior under synthetic conditions. Based on this analysis, we show that, with an appropriate implementation, vocabulary-based approaches outperform other MIL methods in most of the cases, showing in general a more consistent performance. | ||||
| Address | Istanbul, Turkey | ||||
| 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-4244-7542-1 | Medium | |
| Area | Expedition | Conference | ICPR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ Amo2010 | Serial | 1295 | ||
| Permanent link to this record | |||||
| Author | Josep M. Gonfaus; Xavier Boix; Joost Van de Weijer; Andrew Bagdanov; Joan Serrat; Jordi Gonzalez | ||||
| Title | Harmony Potentials for Joint Classification and Segmentation | Type | Conference Article | ||
| Year | 2010 | Publication | 23rd IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3280–3287 | ||
| Keywords | |||||
| Abstract | Hierarchical conditional random fields have been successfully applied to object segmentation. One reason is their ability to incorporate contextual information at different scales. However, these models do not allow multiple labels to be assigned to a single node. At higher scales in the image, this yields an oversimplified model, since multiple classes can be reasonable expected to appear within one region. This simplified model especially limits the impact that observations at larger scales may have on the CRF model. Neglecting the information at larger scales is undesirable since class-label estimates based on these scales are more reliable than at smaller, noisier scales. To address this problem, we propose a new potential, called harmony potential, which can encode any possible combination of class labels. We propose an effective sampling strategy that renders tractable the underlying optimization problem. Results show that our approach obtains state-of-the-art results on two challenging datasets: Pascal VOC 2009 and MSRC-21. | ||||
| Address | San Francisco CA, 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 | 1063-6919 | ISBN | 978-1-4244-6984-0 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS;CIC;ISE | Approved | no | ||
| Call Number | ADAS @ adas @ GBW2010 | Serial | 1296 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Eduard Vazquez | ||||
| Title | Lacuna Restoration: How to choose a neutral colour? | Type | Conference Article | ||
| Year | 2010 | Publication | Proceedings of The CREATE 2010 Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 248–252 | ||
| Keywords | |||||
| Abstract | Painting restoration which involves filling in material loss (called lacuna) is a complex process. Several standard techniques exist to tackle lacuna restoration,
and this article focuses on those techniques that employ a “neutral” colour to mask the defect. Restoration experts often disagree on the choice of such a colour and in fact, the concept of a neutral colour is controversial. We posit that a neutral colour is one that attracts relatively little visual attention for a specific lacuna. We conducted an eye tracking experiment to compare two common neutral colour selection methods, specifically the most common local colour and the mean local colour. Results obtained demonstrate that the most common local colour triggers less visual attention in general. Notwithstanding, we have observed instances in which the most common colour triggers a significant amount of attention when subjects spent time resolving their confusion about whether or not a lacuna was part of the painting. |
||||
| Address | Gjovik, Norway | ||||
| 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 | CREATE | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ MuV2010 | Serial | 1297 | ||
| Permanent link to this record | |||||
| Author | Marta Teres; Eduard Vazquez | ||||
| Title | Museums, spaces and museographical resources. Current state and proposals for a multidisciplinary framework to open new perspectives | Type | Conference Article | ||
| Year | 2010 | Publication | Proceedings of The CREATE 2010 Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 319–323 | ||
| Keywords | |||||
| Abstract | Two of the main aims of a museum are to communicate its heritage and to make enjoy its visitors. This communication can be done through the pieces itself and the museographical resources but also through the building, the interior design, the light and the colour. Art museums, in opposition with other museums, lack on the application of these additional resources. Such a work necessarily requires a multidisciplinary point of view for a holistic vision of all what a museum implies and to use all its potential as a tool of knowledge and culture for all the visitors. | ||||
| Address | Gjovik, Norway | ||||
| 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 | CREATE | ||
| Notes | Approved | no | |||
| Call Number | Admin @ si @ TeV2010 | Serial | 1298 | ||
| Permanent link to this record | |||||
| Author | Eduard Vazquez; Ramon Baldrich | ||||
| Title | Non-supervised goodness measure for image segmentation | Type | Conference Article | ||
| Year | 2010 | Publication | Proceedings of The CREATE 2010 Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 334–335 | ||
| Keywords | |||||
| Abstract | |||||
| Address | Gjovik, Norway | ||||
| 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 | CREATE | ||
| Notes | CIC | Approved | no | ||
| Call Number | CAT @ cat @ VaB2010 | Serial | 1299 | ||
| Permanent link to this record | |||||
| Author | Antonio Lopez; Joan Serrat; Cristina Cañero; Felipe Lumbreras; T. Graf | ||||
| Title | Robust lane markings detection and road geometry computation | Type | Journal Article | ||
| Year | 2010 | Publication | International Journal of Automotive Technology | Abbreviated Journal | IJAT |
| Volume | 11 | Issue | 3 | Pages | 395–407 |
| Keywords | lane markings | ||||
| Abstract | Detection of lane markings based on a camera sensor can be a low-cost solution to lane departure and curve-over-speed warnings. A number of methods and implementations have been reported in the literature. However, reliable detection is still an issue because of cast shadows, worn and occluded markings, variable ambient lighting conditions, for example. We focus on increasing detection reliability in two ways. First, we employed an image feature other than the commonly used edges: ridges, which we claim addresses this problem better. Second, we adapted RANSAC, a generic robust estimation method, to fit a parametric model of a pair of lane lines to the image features, based on both ridgeness and ridge orientation. In addition, the model was fitted for the left and right lane lines simultaneously to enforce a consistent result. Four measures of interest for driver assistance applications were directly computed from the fitted parametric model at each frame: lane width, lane curvature, and vehicle yaw angle and lateral offset with regard the lane medial axis. We qualitatively assessed our method in video sequences captured on several road types and under very different lighting conditions. We also quantitatively assessed it on synthetic but realistic video sequences for which road geometry and vehicle trajectory ground truth are known. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | The Korean Society of Automotive Engineers | Place of Publication | Editor |
||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1229-9138 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ LSC2010 | Serial | 1300 | ||
| Permanent link to this record | |||||
| Author | David Geronimo; Angel Sappa; Antonio Lopez | ||||
| Title | Stereo-based Candidate Generation for Pedestrian Protection Systems | Type | Book Chapter | ||
| Year | 2010 | Publication | Binocular Vision: Development, Depth Perception and Disorders | Abbreviated Journal | |
| Volume | Issue | 9 | Pages | 189–208 | |
| Keywords | Pedestrian Detection | ||||
| Abstract | This chapter describes a stereo-based algorithm that provides candidate image windows to a latter 2D classification stage in an on-board pedestrian detection system. The proposed algorithm, which consists of three stages, is based on the use of both stereo imaging and scene prior knowledge (i.e., pedestrians are on the ground) to reduce the candidate searching space. First, a successful road surface fitting algorithm provides estimates on the relative ground-camera pose. This stage directs the search toward the road area thus avoiding irrelevant regions like the sky. Then, three different schemes are used to scan the estimated road surface with pedestrian-sized windows: (a) uniformly distributed through the road surface (3D); (b) uniformly distributed through the image (2D); (c) not uniformly distributed but according to a quadratic function (combined 2D-3D). Finally, the set of candidate windows is reduced by analyzing their 3D content. Experimental results of the proposed algorithm, together with statistics of searching space reduction are provided. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | NOVA Publishers | Place of Publication | Editor |
||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ GSL2010 | Serial | 1301 | ||
| Permanent link to this record | |||||