Home | [51–60] << 61 62 63 64 65 66 67 68 69 70 >> [71–80] |
![]() |
Records | |||||
---|---|---|---|---|---|
Author | Carlo Gatta; Juan Diego Gomez; Francesco Ciompi; Oriol Rodriguez-Leor; Petia Radeva | ||||
Title | Toward robust myocardial blush grade estimation in contrast angiography | Type | Conference Article | ||
Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
Volume | 5524 | Issue | Pages | 249–256 | |
Keywords | |||||
Abstract | The assessment of Myocardial Blush Grade after primary angioplasty is a precious diagnostic tool to understand if the patient needs further medication or the use of specifics drugs. Unfortunately, the assessment of MBG is difficult for non highly specialized staff. Experimental data show that there is poor correlation between MBG assessment of low and high specialized staff, thus reducing its applicability. This paper proposes a method able to achieve an objective measure of MBG, or a set of parameters that correlates with the MBG. The method tracks the blush area starting from just one single frame tagged by the physician. As a consequence, the blush area is kept isolated from contaminating phenomena such as diaphragm and arteries movements. We also present a method to extract four parameters that are expected to correlate with the MBG. Preliminary results show that the method is capable of extracting interesting information regarding the behavior of the myocardial perfusion. | ||||
Address | Póvoa de Varzim, Portugal | ||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
Series Volume ![]() |
Series Issue | Edition | |||
ISSN | 0302-9743 | ISBN | 978-3-642-02171-8 | Medium | |
Area | Expedition | Conference | IbPRIA | ||
Notes | MILAB | Approved | no | ||
Call Number | BCNPCL @ bcnpcl @ GGC2009 | Serial | 1161 | ||
Permanent link to this record | |||||
Author | Francesco Ciompi; Oriol Pujol; Oriol Rodriguez-Leor; Carlo Gatta; Angel Serrano; Petia Radeva | ||||
Title | Enhancing In-Vitro IVUS Data for Tissue Characterization | Type | Conference Article | ||
Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
Volume | 5524 | Issue | Pages | 241–248 | |
Keywords | |||||
Abstract | Intravascular Ultrasound (IVUS) data validation is usually performed by comparing post-mortem (in-vitro) IVUS data and corresponding histological analysis of the tissue, obtaining a reliable ground truth. The main drawback of this method is the few number of available study cases due to the complex procedure of histological analysis. In this work we propose a novel semi-supervised approach to enhance the in-vitro training set by including examples from in-vivo coronary plaques data set. For this purpose, a Sequential Floating Forward Selection method is applied on in-vivo data and plaque characterization performances are evaluated by Leave-One-Patient-Out cross-validation technique. Supervised data inclusion improves global classification accuracy from 89.39% to 91.82%. | ||||
Address | Póvoa de Varzim, Portugal | ||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
Series Volume ![]() |
Series Issue | Edition | |||
ISSN | 0302-9743 | ISBN | 978-3-642-02171-8 | Medium | |
Area | Expedition | Conference | IbPRIA | ||
Notes | MILAB;HuPBA | Approved | no | ||
Call Number | BCNPCL @ bcnpcl @ CPR2009a | Serial | 1162 | ||
Permanent link to this record | |||||
Author | Carme Julia; Angel Sappa; Felipe Lumbreras; Joan Serrat; Antonio Lopez | ||||
Title | An iterative multiresolution scheme for SFM with missing data | Type | Journal Article | ||
Year | 2009 | Publication | Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
Volume | 34 | Issue | 3 | Pages | 240–258 |
Keywords | |||||
Abstract | Several techniques have been proposed for tackling the Structure from Motion problem through factorization in the case of missing data. However, when the percentage of unknown data is high, most of them may not perform as well as expected. Focussing on this problem, an iterative multiresolution scheme, which aims at recovering missing entries in the originally given input matrix, is proposed. Information recovered following a coarse-to-fine strategy is used for filling in the missing entries. The objective is to recover, as much as possible, missing data in the given matrix.
Thus, when a factorization technique is applied to the partially or totally filled in matrix, instead of to the originally given input one, better results will be obtained. An evaluation study about the robustness to missing and noisy data is reported. Experimental results obtained with synthetic and real video sequences are presented to show the viability of the proposed 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 | ADAS | Approved | no | ||
Call Number | ADAS @ adas @ JSL2009a | Serial | 1163 | ||
Permanent link to this record | |||||
Author | Marçal Rusiñol; Josep Llados; Gemma Sanchez | ||||
Title | Symbol Spotting in Vectorized Technical Drawings Through a Lookup Table of Region Strings | Type | Journal Article | ||
Year | 2010 | Publication | Pattern Analysis and Applications | Abbreviated Journal | PAA |
Volume | 13 | Issue | 3 | Pages | 321-331 |
Keywords | |||||
Abstract | In this paper, we address the problem of symbol spotting in technical document images applied to scanned and vectorized line drawings. Like any information spotting architecture, our approach has two components. First, symbols are decomposed in primitives which are compactly represented and second a primitive indexing structure aims to efficiently retrieve similar primitives. Primitives are encoded in terms of attributed strings representing closed regions. Similar strings are clustered in a lookup table so that the set median strings act as indexing keys. A voting scheme formulates hypothesis in certain locations of the line drawing image where there is a high presence of regions similar to the queried ones, and therefore, a high probability to find the queried graphical symbol. The proposed approach is illustrated in a framework consisting in spotting furniture symbols in architectural drawings. It has been proved to work even in the presence of noise and distortion introduced by the scanning and raster-to-vector processes. | ||||
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-7541 | ISBN | Medium | ||
Area | Expedition | Conference | |||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ RLS2010 | Serial | 1165 | ||
Permanent link to this record | |||||
Author | Marçal Rusiñol; Josep Llados | ||||
Title | A Performance Evaluation Protocol for Symbol Spotting Systems in Terms of Recognition and Location Indices | Type | Journal Article | ||
Year | 2009 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
Volume | 12 | Issue | 2 | Pages | 83-96 |
Keywords | Performance evaluation; Symbol Spotting; Graphics Recognition | ||||
Abstract | Symbol spotting systems are intended to retrieve regions of interest from a document image database where the queried symbol is likely to be found. They shall have the ability to recognize and locate graphical symbols in a single step. In this paper, we present a set of measures to evaluate the performance of a symbol spotting system in terms of recognition abilities, location accuracy and scalability. We show that the proposed measures allow to determine the weaknesses and strengths of different methods. In particular we have tested a symbol spotting method based on a set of four different off-the-shelf shape descriptors. | ||||
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 | 1433-2833 | ISBN | Medium | ||
Area | Expedition | Conference | |||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ RuL2009a | Serial | 1166 | ||
Permanent link to this record | |||||
Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
Title | Median Graphs: A Genetic Approach based on New Theoretical Properties | Type | Journal Article | ||
Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
Volume | 42 | Issue | 9 | Pages | 2003–2012 |
Keywords | Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition | ||||
Abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
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 | Approved | no | ||
Call Number | DAG @ dag @ FVS2009b | Serial | 1167 | ||
Permanent link to this record | |||||
Author | Daniel Ponsa; Antonio Lopez | ||||
Title | Variance reduction techniques in particle-based visual contour Tracking | Type | Journal Article | ||
Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
Volume | 42 | Issue | 11 | Pages | 2372–2391 |
Keywords | Contour tracking; Active shape models; Kalman filter; Particle filter; Importance sampling; Unscented particle filter; Rao-Blackwellization; Partitioned sampling | ||||
Abstract | This paper presents a comparative study of three different strategies to improve the performance of particle filters, in the context of visual contour tracking: the unscented particle filter, the Rao-Blackwellized particle filter, and the partitioned sampling technique. The tracking problem analyzed is the joint estimation of the global and local transformation of the outline of a given target, represented following the active shape model approach. The main contributions of the paper are the novel adaptations of the considered techniques on this generic problem, and the quantitative assessment of their performance in extensive experimental work done. | ||||
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 | ADAS | Approved | no | ||
Call Number | ADAS @ adas @ PoL2009a | Serial | 1168 | ||
Permanent link to this record | |||||
Author | Jose Manuel Alvarez; Theo Gevers; Antonio Lopez | ||||
Title | Learning Photometric Invariance from Diversified Color Model Ensembles | Type | Conference Article | ||
Year | 2009 | Publication | 22nd IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
Volume | Issue | Pages | 565–572 | ||
Keywords | road detection | ||||
Abstract | Color is a powerful visual cue for many computer vision applications such as image segmentation and object recognition. However, most of the existing color models depend on the imaging conditions affecting negatively the performance of the task at hand. Often, a reflection model (e.g., Lambertian or dichromatic reflectance) is used to derive color invariant models. However, those reflection models might be too restricted to model real-world scenes in which different reflectance mechanisms may hold simultaneously. Therefore, in this paper, we aim to derive color invariance by learning from color models to obtain diversified color invariant ensembles. First, a photometrical orthogonal and non-redundant color model set is taken on input composed of both color variants and invariants. Then, the proposed method combines and weights these color models to arrive at a diversified color ensemble yielding a proper balance between invariance (repeatability) and discriminative power (distinctiveness). To achieve this, the fusion method uses a multi-view approach to minimize the estimation error. In this way, the method is robust to data uncertainty and produces properly diversified color invariant ensembles. Experiments are conducted on three different image datasets to validate the method. From the theoretical and experimental results, it is concluded that the method is robust against severe variations in imaging conditions. The method is not restricted to a certain reflection model or parameter tuning. Further, the method outperforms state-of- the-art detection techniques in the field of object, skin and road recognition. | ||||
Address | Miami (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-3992-8 | Medium | |
Area | Expedition | Conference | CVPR | ||
Notes | ADAS;ISE | Approved | no | ||
Call Number | ADAS @ adas @ AGL2009 | Serial | 1169 | ||
Permanent link to this record | |||||
Author | Pau Baiget; Carles Fernandez; Xavier Roca; Jordi Gonzalez | ||||
Title | Generation of Augmented Video Sequences Combining Behavioral Animation and Multi Object Tracking | Type | Journal Article | ||
Year | 2009 | Publication | Computer Animation and Virtual Worlds | Abbreviated Journal | |
Volume | 20 | Issue | 4 | Pages | 473–489 |
Keywords | |||||
Abstract | In this paper we present a novel approach to generate augmented video sequences in real-time, involving interactions between virtual and real agents in real scenarios. On the one hand, real agent motion is estimated by means of a multi-object tracking algorithm, which determines real objects' position over the scenario for each time step. On the other hand, virtual agents are provided with behavior models considering their interaction with the environment and with other agents. The resulting framework allows to generate video sequences involving behavior-based virtual agents that react to real agent behavior and has applications in education, simulation, and in the game and movie industries. We show the performance of the proposed approach in an indoor and outdoor scenario simulating human and vehicle agents. Copyright © 2009 John Wiley & Sons, Ltd.
We present a novel approach to generate augmented video sequences in real-time, involving interactions between virtual and real agents in real scenarios. On the one hand, real agent motion is estimated by means of a multi-object tracking algorithm, which determines real objects' position over the scenario for each time step. On the other hand, virtual agents are provided with behavior models considering their interaction with the environment and with other agents. © 2009 Wiley Periodicals, Inc. |
||||
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 | ISE | Approved | no | ||
Call Number | ISE @ ise @ BFR2009 | Serial | 1170 | ||
Permanent link to this record | |||||
Author | Javier Vazquez; C. Alejandro Parraga; Maria Vanrell; Ramon Baldrich | ||||
Title | Color Constancy Algorithms: Psychophysical Evaluation on a New Dataset | Type | Journal Article | ||
Year | 2009 | Publication | Journal of Imaging Science and Technology | Abbreviated Journal | |
Volume | 53 | Issue | 3 | Pages | 031105–9 |
Keywords | |||||
Abstract | The estimation of the illuminant of a scene from a digital image has been the goal of a large amount of research in computer vision. Color constancy algorithms have dealt with this problem by defining different heuristics to select a unique solution from within the feasible set. The performance of these algorithms has shown that there is still a long way to go to globally solve this problem as a preliminary step in computer vision. In general, performance evaluation has been done by comparing the angular error between the estimated chromaticity and the chromaticity of a canonical illuminant, which is highly dependent on the image dataset. Recently, some workers have used high-level constraints to estimate illuminants; in this case selection is based on increasing the performance on the subsequent steps of the systems. In this paper we propose a new performance measure, the perceptual angular error. It evaluates the performance of a color constancy algorithm according to the perceptual preferences of humans, or naturalness (instead of the actual optimal solution) and is independent of the visual task. We show the results of a new psychophysical experiment comparing solutions from three different color constancy algorithms. Our results show that in more than a half of the judgments the preferred solution is not the one closest to the optimal solution. Our experiments were performed on a new dataset of images acquired with a calibrated camera with an attached neutral grey sphere, which better copes with the illuminant variations of the scene. | ||||
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 | CIC | Approved | no | ||
Call Number | CAT @ cat @ VPV2009a | Serial | 1171 | ||
Permanent link to this record | |||||
Author | Antonio Clavelli; Dimosthenis Karatzas | ||||
Title | Text Segmentation in Colour Posters from the Spanish Civil War Era | Type | Conference Article | ||
Year | 2009 | Publication | 10th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
Volume | Issue | Pages | 181 - 185 | ||
Keywords | |||||
Abstract | The extraction of textual content from colour documents of a graphical nature is a complicated task. The text can be rendered in any colour, size and orientation while the existence of complex background graphics with repetitive patterns can make its localization and segmentation extremely difficult.
Here, we propose a new method for extracting textual content from such colour images that makes no assumption as to the size of the characters, their orientation or colour, while it is tolerant to characters that do not follow a straight baseline. We evaluate this method on a collection of documents with historical connotations: the Posters from the Spanish Civil War. |
||||
Address | Barcelona, Spain | ||||
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 | 1520-5363 | ISBN | 978-1-4244-4500-4 | Medium | |
Area | Expedition | Conference | ICDAR | ||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ ClK2009 | Serial | 1172 | ||
Permanent link to this record | |||||
Author | Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke | ||||
Title | A Recursive Embedding Approach to Median Graph Computation | Type | Conference Article | ||
Year | 2009 | Publication | 7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition | Abbreviated Journal | |
Volume | 5534 | Issue | Pages | 113–123 | |
Keywords | |||||
Abstract | The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches. | ||||
Address | Venice, Italy | ||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
Series Volume ![]() |
Series Issue | Edition | |||
ISSN | 0302-9743 | ISBN | 978-3-642-02123-7 | Medium | |
Area | Expedition | Conference | GBR | ||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ FKV2009 | Serial | 1173 | ||
Permanent link to this record | |||||
Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
Title | Median Graph Computation by means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subraph | Type | Conference Article | ||
Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
Volume | 5524 | Issue | Pages | 346–353 | |
Keywords | |||||
Abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present a new genetic algorithm for the median graph computation. A set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity, show that we obtain good approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
Address | Póvoa de Varzim, Portugal | ||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
Series Volume ![]() |
Series Issue | Edition | |||
ISSN | 0302-9743 | ISBN | 978-3-642-02171-8 | Medium | |
Area | Expedition | Conference | IbPRIA | ||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ FVS2009c | Serial | 1174 | ||
Permanent link to this record | |||||
Author | Albert Gordo; Ernest Valveny | ||||
Title | A rotation invariant page layout descriptor for document classification and retrieval | Type | Conference Article | ||
Year | 2009 | Publication | 10th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
Volume | Issue | Pages | 481–485 | ||
Keywords | |||||
Abstract | Document classification usually requires of structural features such as the physical layout to obtain good accuracy rates on complex documents. This paper introduces a descriptor of the layout and a distance measure based on the cyclic dynamic time warping which can be computed in O(n2). This descriptor is translation invariant and can be easily modified to be scale and rotation invariant. Experiments with this descriptor and its rotation invariant modification are performed on the Girona archives database and compared against another common layout distance, the minimum weight edge cover. The experiments show that these methods outperform the MWEC both in accuracy and speed, particularly on rotated documents. | ||||
Address | Barcelona, Spain | ||||
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 | 1520-5363 | ISBN | 978-1-4244-4500-4 | Medium | |
Area | Expedition | Conference | ICDAR | ||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ GoV2009a | Serial | 1175 | ||
Permanent link to this record | |||||
Author | Albert Gordo; Ernest Valveny | ||||
Title | The diagonal split: A pre-segmentation step for page layout analysis & classification | Type | Conference Article | ||
Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
Volume | 5524 | Issue | Pages | 290–297 | |
Keywords | |||||
Abstract | Document classification is an important task in all the processes related to document storage and retrieval. In the case of complex documents, structural features are needed to achieve a correct classification. Unfortunately, physical layout analysis is error prone. In this paper we present a pre-segmentation step based on a divide & conquer strategy that can be used to improve the page segmentation results, independently of the segmentation algorithm used. This pre-segmentation step is evaluated in classification and retrieval using the selective CRLA algorithm for layout segmentation together with a clustering based on the voronoi area diagram, and tested on two different databases, MARG and Girona Archives. | ||||
Address | Póvoa de Varzim, Portugal | ||||
Corporate Author | Thesis | ||||
Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
Language | Summary Language | Original Title | |||
Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
Series Volume ![]() |
Series Issue | Edition | |||
ISSN | 0302-9743 | ISBN | 978-3-642-02171-8 | Medium | |
Area | Expedition | Conference | IbPRIA | ||
Notes | DAG | Approved | no | ||
Call Number | DAG @ dag @ Gov2009b | Serial | 1176 | ||
Permanent link to this record |