| Home | [81–90] << 91 92 93 94 95 96 97 98 99 100 >> [101–110] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Marçal Rusiñol; David Aldavert; Ricardo Toledo; Josep Llados | ||||
| Title | Browsing Heterogeneous Document Collections by a Segmentation-Free Word Spotting Method | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 63-67 | ||
| Keywords | |||||
| Abstract | In this paper, we present a segmentation-free word spotting method that is able to deal with heterogeneous document image collections. We propose a patch-based framework where patches are represented by a bag-of-visual-words model powered by SIFT descriptors. A later refinement of the feature vectors is performed by applying the latent semantic indexing technique. The proposed method performs well on both handwritten and typewritten historical document images. We have also tested our method on documents written in non-Latin scripts. | ||||
| Address | Beijing, China | ||||
| 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 | ICDAR | ||
| Notes | DAG;ADAS | Approved | no | ||
| Call Number | Admin @ si @ RAT2011 | Serial | 1788 | ||
| Permanent link to this record | |||||
| Author | Volkmar Frinken; Andreas Fischer; Horst Bunke; Alicia Fornes | ||||
| Title | Co-training for Handwritten Word Recognition | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 314-318 | ||
| Keywords | |||||
| Abstract | To cope with the tremendous variations of writing styles encountered between different individuals, unconstrained automatic handwriting recognition systems need to be trained on large sets of labeled data. Traditionally, the training data has to be labeled manually, which is a laborious and costly process. Semi-supervised learning techniques offer methods to utilize unlabeled data, which can be obtained cheaply in large amounts in order, to reduce the need for labeled data. In this paper, we propose the use of Co-Training for improving the recognition accuracy of two weakly trained handwriting recognition systems. The first one is based on Recurrent Neural Networks while the second one is based on Hidden Markov Models. On the IAM off-line handwriting database we demonstrate a significant increase of the recognition accuracy can be achieved with Co-Training for single word recognition. | ||||
| Address | Beijing, China | ||||
| 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 | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ FFB2011 | Serial | 1789 | ||
| Permanent link to this record | |||||
| Author | Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados; Thierry Brouard | ||||
| Title | Subgraph Spotting Through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 870-874 | ||
| Keywords | |||||
| Abstract | We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a relational data structure is mandatory. Our proposed method accomplishes subgraph spotting through graph embedding. We achieve automatic indexation of a graph repository during off-line learning phase, where we (i) break the graphs into 2-node sub graphs (a.k.a. cliques of order 2), which are primitive building-blocks of a graph, (ii) embed the 2-node sub graphs into feature vectors by employing our recently proposed explicit graph embedding technique, (iii) cluster the feature vectors in classes by employing a classic agglomerative clustering technique, (iv) build an index for the graph repository and (v) learn a Bayesian network classifier. The subgraph spotting is achieved during the on-line querying phase, where we (i) break the query graph into 2-node sub graphs, (ii) embed them into feature vectors, (iii) employ the Bayesian network classifier for classifying the query 2-node sub graphs and (iv) retrieve the respective graphs by looking-up in the index of the graph repository. The graphs containing all query 2-node sub graphs form the set of result graphs for the query. Finally, we employ the adjacency matrix of each result graph along with a score function, for spotting the query graph in it. The proposed subgraph spotting method is equally applicable to a wide range of domains, offering ease of query by example (QBE) and granularity of focused retrieval. Experimental results are presented for graphs generated from two repositories of electronic and architectural document images. | ||||
| Address | Beijing, China | ||||
| 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-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ LRL2011 | Serial | 1790 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Umapada Pal | ||||
| Title | Symbol Spotting in Line Drawings Through Graph Paths Hashing | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 982-986 | ||
| Keywords | |||||
| Abstract | In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can be efficiently represented by graphs, which ease the accurate localization of the model symbol. Graph paths are the factorized substructures of graphs which enable robust recognition even in the presence of noise and distortion. In our framework, the entire database of the graphical documents is indexed in hash tables by the locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. The spotting method is formulated by a spatial voting scheme to the list of locations of the paths that are decided during the hash table lookup process. We perform detailed experiments with various dataset of line drawings and the results demonstrate the effectiveness and efficiency of the technique. | ||||
| Address | Beijing, China | ||||
| 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-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DLP2011b | Serial | 1791 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; Joan Mas; Gemma Sanchez; Ernest Valveny | ||||
| Title | Wall Patch-Based Segmentation in Architectural Floorplans | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1270-1274 | ||
| Keywords | |||||
| Abstract | Segmentation of architectural floor plans is a challenging task, mainly because of the large variability in the notation between different plans. In general, traditional techniques, usually based on analyzing and grouping structural primitives obtained by vectorization, are only able to handle a reduced range of similar notations. In this paper we propose an alternative patch-based segmentation approach working at pixel level, without need of vectorization. The image is divided into a set of patches and a set of features is extracted for every patch. Then, each patch is assigned to a visual word of a previously learned vocabulary and given a probability of belonging to each class of objects. Finally, a post-process assigns the final label for every pixel. This approach has been applied to the detection of walls on two datasets of architectural floor plans with different notations, achieving high accuracy rates. | ||||
| Address | Beiging, China | ||||
| 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-0-7695-4520-2 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ HMS2011a | Serial | 1792 | ||
| Permanent link to this record | |||||
| Author | Dimosthenis Karatzas; Sergi Robles; Joan Mas; Farshad Nourbakhsh; Partha Pratim Roy | ||||
| Title | ICDAR 2011 Robust Reading Competition – Challege 1: Reading Text in Born-Digital Images (Web and Email) | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1485-1490 | ||
| Keywords | |||||
| Abstract | This paper presents the results of the first Challenge of ICDAR 2011 Robust Reading Competition. Challenge 1 is focused on the extraction of text from born-digital images, specifically from images found in Web pages and emails. The challenge was organized in terms of three tasks that look at different stages of the process: text localization, text segmentation and word recognition. In this paper we present the results of the challenge for all three tasks, and make an open call for continuous participation outside the context of ICDAR 2011. | ||||
| Address | Beijing, China | ||||
| 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-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ KRM2011 | Serial | 1793 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Anjan Dutta; Albert Gordo; Josep Llados | ||||
| Title | The ICDAR 2011 Music Scores Competition: Staff Removal and Writer Identification | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1511-1515 | ||
| Keywords | |||||
| Abstract | In the last years, there has been a growing interest in the analysis of handwritten music scores. In this sense, our goal has been to foster the interest in the analysis of handwritten music scores by the proposal of two different competitions: Staff removal and Writer Identification. Both competitions have been tested on the CVC-MUSCIMA database: a ground-truth of handwritten music score images. This paper describes the competition details, including the dataset and ground-truth, the evaluation metrics, and a short description of the participants, their methods, and the obtained results. | ||||
| Address | Beijing, China | ||||
| 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-0-7695-4520-2 | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ FDG2011b | Serial | 1794 | ||
| Permanent link to this record | |||||
| Author | Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados | ||||
| Title | Plausibility-Graphs for Symbol Spotting in Graphical Documents | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Graph representation of graphical documents often suffers from noise viz. spurious nodes and spurios edges of graph and their discontinuity etc. 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 | Bethlehem; PA; USA; August 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication |
Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GREC | ||
| Notes | DAG; 600.045; 600.056; 600.061; 601.152 | Approved | no | ||
| Call Number | Admin @ si @ BDJ2013 | Serial | 2360 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera | ||||
| Title | Multi-Modal Human Behaviour Analysis from Visual Data Sources | Type | Journal | ||
| Year | 2013 | Publication | ERCIM News journal | Abbreviated Journal | ERCIM |
| Volume | 95 | Issue | Pages | 21-22 | |
| Keywords | |||||
| Abstract | The Human Pose Recovery and Behaviour Analysis group (HuPBA), University of Barcelona, is developing a line of research on multi-modal analysis of humans in visual data. The novel technology is being applied in several scenarios with high social impact, including sign language recognition, assisted technology and supported diagnosis for the elderly and people with mental/physical disabilities, fitness conditioning, and Human Computer Interaction. | ||||
| 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 | 0926-4981 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ Esc2013 | Serial | 2361 | ||
| Permanent link to this record | |||||
| Author | Xavier Carrillo; E Fernandez-Nofrerias; Francesco Ciompi; O. Rodriguez-Leor; Petia Radeva; Neus Salvatella; Oriol Pujol; J. Mauri; A. Bayes | ||||
| Title | Changes in Radial Artery Volume Assessed Using Intravascular Ultrasound: A Comparison of Two Vasodilator Regimens in Transradial Coronary Intervention | Type | Journal Article | ||
| Year | 2011 | Publication | Journal of Invasive Cardiology | Abbreviated Journal | JOIC |
| Volume | 23 | Issue | 10 | Pages | 401-404 |
| Keywords | radial; vasodilator treatment; percutaneous coronary intervention; IVUS; volumetric IVUS analysis | ||||
| Abstract | OBJECTIVES:
This study used intravascular ultrasound (IVUS) to evaluate radial artery volume changes after intraarterial administration of nitroglycerin and/or verapamil. BACKGROUND: Radial artery spasm, which is associated with radial artery size, is the main limitation of the transradial approach in percutaneous coronary interventions (PCI). METHODS: This prospective, randomized study compared the effect of two intra-arterial vasodilator regimens on radial artery volume: 0.2 mg of nitroglycerin plus 2.5 mg of verapamil (Group 1; n = 15) versus 2.5 mg of verapamil alone (Group 2; n = 15). Radial artery lumen volume was assessed using IVUS at two time points: at baseline (5 minutes after sheath insertion) and post-vasodilator (1 minute after drug administration). The luminal volume of the radial artery was computed using ECOC Random Fields (ECOC-RF), a technique used for automatic segmentation of luminal borders in longitudinal cut images from IVUS sequences. RESULTS: There was a significant increase in arterial lumen volume in both groups, with an increase from 451 ± 177 mm³ to 508 ± 192 mm³ (p = 0.001) in Group 1 and from 456 ± 188 mm³ to 509 ± 170 mm³ (p = 0.001) in Group 2. There were no significant differences between the groups in terms of absolute volume increase (58 mm³ versus 53 mm³, respectively; p = 0.65) or in relative volume increase (14% versus 20%, respectively; p = 0.69). CONCLUSIONS: Administration of nitroglycerin plus verapamil or verapamil alone to the radial artery resulted in similar increases in arterial lumen volume according to ECOC-RF IVUS measurements. |
||||
| 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;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ CFC2011 | Serial | 1797 | ||
| Permanent link to this record | |||||
| Author | Francesco Ciompi; A. Palaioroutas; M. Loeve; Oriol Pujol; Petia Radeva; H. Tiddens; M. de Bruijne | ||||
| Title | Lung Tissue Classification in Severe Advanced Cystic Fibrosis from CT Scans | Type | Conference Article | ||
| Year | 2011 | Publication | In MICCAI 2011 4th International Workshop on Pulmonary Image Analysis | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Toronto, Canada | ||||
| 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 | PIA | ||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ CPL2011 | Serial | 1798 | ||
| Permanent link to this record | |||||
| Author | Simone Balocco; Carlo Gatta; Xavier Carrillo; F. Mauri; Petia Radeva | ||||
| Title | Plaque Type, Plaque Burden and Wall Shear Stress Relation in Coronary Arteries Assessed by X-ray Angiography and Intravascular Ultrasound: a Qualitative Study | Type | Conference Article | ||
| Year | 2011 | Publication | 14th International Symposium on Applied Sciences in Biomedical and Communication Technologies | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | In this paper, we present a complete framework that automatically provides fluid-dynamic and plaque analysis from IVUS and Angiographic sequences. Such framework is used to analyze, in three coronary arteries, the relation between wall shear stress with type and amount of plaque. Preliminary qualitative results show an inverse relation between the wall shear stress and the plaque burden, which is confirmed by the fact that the plaque growth is higher on the wall having concave curvature. Regarding the plaque type it was observed that regions having low shear stress are predominantly fibro-lipidic while the heavy calcifications are in general located in areas of the vessel having high WSS. | ||||
| 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-4503-0913-4 | Medium | ||
| Area | Expedition | Conference | ISABEL | ||
| Notes | MILAB | Approved | no | ||
| Call Number | Admin @ si @ BGC2011b | Serial | 1799 | ||
| Permanent link to this record | |||||
| Author | Miguel Angel Bautista; Sergio Escalera; Xavier Baro; Petia Radeva; Jordi Vitria; Oriol Pujol | ||||
| Title | Minimal Design of Error-Correcting Output Codes | Type | Journal Article | ||
| Year | 2011 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 33 | Issue | 6 | Pages | 693-702 |
| Keywords | Multi-class classification; Error-correcting output codes; Ensemble of classifiers | ||||
| Abstract | IF JCR CCIA 1.303 2009 54/103
The classification of large number of object categories is a challenging trend in the pattern recognition field. In literature, this is often addressed using an ensemble of classifiers. In this scope, the Error-correcting output codes framework has demonstrated to be a powerful tool for combining classifiers. However, most state-of-the-art ECOC approaches use a linear or exponential number of classifiers, making the discrimination of a large number of classes unfeasible. In this paper, we explore and propose a minimal design of ECOC in terms of the number of classifiers. Evolutionary computation is used for tuning the parameters of the classifiers and looking for the best minimal ECOC code configuration. The results over several public UCI datasets and different multi-class computer vision problems show that the proposed methodology obtains comparable (even better) results than state-of-the-art ECOC methodologies with far less number of dichotomizers. |
||||
| 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 | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB; OR;HuPBA;MV | Approved | no | ||
| Call Number | Admin @ si @ BEB2011a | Serial | 1800 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Xavier Baro; Oriol Pujol; Jordi Vitria; Petia Radeva | ||||
| Title | Traffic-Sign Recognition Systems | Type | Book Whole | ||
| Year | 2011 | Publication | SpringerBriefs in Computer Science | Abbreviated Journal | |
| Volume | Issue | Pages | 5-13 | ||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer London | 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-4471-2244-9 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB; OR;HuPBA;MV | Approved | no | ||
| Call Number | Admin @ si @ EBP2011 | Serial | 1801 | ||
| Permanent link to this record | |||||
| Author | Carlo Gatta; Eloi Puertas; Oriol Pujol | ||||
| Title | Multi-Scale Stacked Sequential Learning | Type | Journal Article | ||
| Year | 2011 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 44 | Issue | 10-11 | Pages | 2414-2416 |
| Keywords | Stacked sequential learning; Multiscale; Multiresolution; Contextual classification | ||||
| Abstract | One of the most widely used assumptions in supervised learning is that data is independent and identically distributed. This assumption does not hold true in many real cases. Sequential learning is the discipline of machine learning that deals with dependent data such that neighboring examples exhibit some kind of relationship. In the literature, there are different approaches that try to capture and exploit this correlation, by means of different methodologies. In this paper we focus on meta-learning strategies and, in particular, the stacked sequential learning approach. The main contribution of this work is two-fold: first, we generalize the stacked sequential learning. This generalization reflects the key role of neighboring interactions modeling. Second, we propose an effective and efficient way of capturing and exploiting sequential correlations that takes into account long-range interactions by means of a multi-scale pyramidal decomposition of the predicted labels. Additionally, this new method subsumes the standard stacked sequential learning approach. We tested the proposed method on two different classification tasks: text lines classification in a FAQ data set and image classification. Results on these tasks clearly show that our approach outperforms the standard stacked sequential learning. Moreover, we show that the proposed method allows to control the trade-off between the detail and the desired range of the interactions. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication |
Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ GPP2011 | Serial | 1802 | ||
| Permanent link to this record | |||||