| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–11] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Isabelle Guyon; Kristin Bennett; Gavin Cawley; Hugo Jair Escalante; Sergio Escalera; Tin Kam Ho; Nuria Macia; Bisakha Ray; Mehreen Saeed; Alexander Statnikov; Evelyne Viegas | ||||
| Title | AutoML Challenge 2015: Design and First Results | Type | Conference Article | ||
| Year | 2015 | Publication | 32nd International Conference on Machine Learning, ICML workshop, JMLR proceedings ICML15 | Abbreviated Journal | |
| Volume | Issue | Pages | 1-8 | ||
| Keywords | AutoML Challenge; machine learning; model selection; meta-learning; repre- sentation learning; active learning | ||||
| Abstract | ChaLearn is organizing the Automatic Machine Learning (AutoML) contest 2015, which challenges participants to solve classi cation and regression problems without any human intervention. Participants' code is automatically run on the contest servers to train and test learning machines. However, there is no obligation to submit code; half of the prizes can be won by submitting prediction results only. Datasets of progressively increasing diculty are introduced throughout the six rounds of the challenge. (Participants can
enter the competition in any round.) The rounds alternate phases in which learners are tested on datasets participants have not seen (AutoML), and phases in which participants have limited time to tweak their algorithms on those datasets to improve performance (Tweakathon). This challenge will push the state of the art in fully automatic machine learning on a wide range of real-world problems. The platform will remain available beyond the termination of the challenge: http://codalab.org/AutoML. |
||||
| Address | Lille; France; July 2015 | ||||
| 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 | ICML | ||
| Notes | HuPBA;MILAB | Approved | no | ||
Call Number  |
Admin @ si @ GBC2015c | Serial | 2656 | ||
| Permanent link to this record | |||||
| Author | Lluis Garrido; M.Guerrieri; Laura Igual | ||||
| Title | Image Segmentation with Cage Active Contours | Type | Journal Article | ||
| Year | 2015 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 24 | Issue | 12 | Pages | 5557 - 5566 |
| Keywords | Level sets; Mean value coordinates; Parametrized active contours; level sets; mean value coordinates | ||||
| Abstract | In this paper, we present a framework for image segmentation based on parametrized active contours. The evolving contour is parametrized according to a reduced set of control points that form a closed polygon and have a clear visual interpretation. The parametrization, called mean value coordinates, stems from the techniques used in computer graphics to animate virtual models. Our framework allows to easily formulate region-based energies to segment an image. In particular, we present three different local region-based energy terms: 1) the mean model; 2) the Gaussian model; 3) and the histogram model. We show the behavior of our method on synthetic and real images and compare the performance with state-of-the-art level set methods. | ||||
| 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 | MILAB | Approved | no | ||
| Call Number |
Admin @ si @ GGI2015 | Serial | 2673 | ||
| Permanent link to this record | |||||
| Author | Suman Ghosh; Lluis Gomez; Dimosthenis Karatzas; Ernest Valveny | ||||
| Title | Efficient indexing for Query By String text retrieval | Type | Conference Article | ||
| Year | 2015 | Publication | 6th IAPR International Workshop on Camera Based Document Analysis and Recognition CBDAR2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 1236 - 1240 | ||
| Keywords | |||||
| Abstract | This paper deals with Query By String word spotting in scene images. A hierarchical text segmentation algorithm based on text specific selective search is used to find text regions. These regions are indexed per character n-grams present in the text region. An attribute representation based on Pyramidal Histogram of Characters (PHOC) is used to compare text regions with the query text. For generation of the index a similar attribute space based Pyramidal Histogram of character n-grams is used. These attribute models are learned using linear SVMs over the Fisher Vector [1] representation of the images along with the PHOC labels of the corresponding strings. | ||||
| Address | Nancy; France; August 2015 | ||||
| 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 | CBDAR | ||
| Notes | DAG; 600.077 | Approved | no | ||
| Call Number |
Admin @ si @ GGK2015 | Serial | 2693 | ||
| Permanent link to this record | |||||
| Author | Antoni Gurgui; Debora Gil; Enric Marti | ||||
| Title | Laplacian Unitary Domain for Texture Morphing | Type | Conference Article | ||
| Year | 2015 | Publication | Proceedings of the 10th International Conference on Computer Vision Theory and Applications VISIGRAPP2015 | Abbreviated Journal | |
| Volume | 1 | Issue | Pages | 693-699 | |
| Keywords | Facial; metamorphosis;LaplacianMorphing | ||||
| Abstract | Deformation of expressive textures is the gateway to realistic computer synthesis of expressions. By their good mathematical properties and flexible formulation on irregular meshes, most texture mappings rely on solutions to the Laplacian in the cartesian space. In the context of facial expression morphing, this approximation can be seen from the opposite point of view by neglecting the metric. In this paper, we use the properties of the Laplacian in manifolds to present a novel approach to warping expressive facial images in order to generate a morphing between them. | ||||
| Address | Munich; Germany; February 2015 | ||||
| Corporate Author | Thesis | ||||
| Publisher | SciTePress | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-989-758-089-5 | Medium | ||
| Area | Expedition | Conference | VISAPP | ||
| Notes | IAM; 600.075 | Approved | no | ||
| Call Number |
Admin @ si @ GGM2015 | Serial | 2614 | ||
| Permanent link to this record | |||||
| Author | Wenjuan Gong; Y.Huang; Jordi Gonzalez; Liang Wang | ||||
| Title | An Effective Solution to Double Counting Problem in Human Pose Estimation | Type | Miscellaneous | ||
| Year | 2015 | Publication | Arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Pose estimation; double counting problem; mix-ture of parts Model | ||||
| Abstract | The mixture of parts model has been successfully applied to solve the 2D
human pose estimation problem either as an explicitly trained body part model or as latent variables for pedestrian detection. Even in the era of massive applications of deep learning techniques, the mixture of parts model is still effective in solving certain problems, especially in the case with limited numbers of training samples. In this paper, we consider using the mixture of parts model for pose estimation, wherein a tree structure is utilized for representing relations between connected body parts. This strategy facilitates training and inferencing of the model but suffers from double counting problems, where one detected body part is counted twice due to lack of constrains among unconnected body parts. To solve this problem, we propose a generalized solution in which various part attributes are captured by multiple features so as to avoid the double counted problem. Qualitative and quantitative experimental results on a public available dataset demonstrate the effectiveness of our proposed method. An Effective Solution to Double Counting Problem in Human Pose Estimation – ResearchGate. Available from: http://www.researchgate.net/publication/271218491AnEffectiveSolutiontoDoubleCountingProbleminHumanPose_Estimation [accessed Oct 22, 2015]. |
||||
| 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; 600.078 | Approved | no | ||
| Call Number |
Admin @ si @ GHG2015 | Serial | 2590 | ||
| Permanent link to this record | |||||
| Author | Suman Ghosh; Ernest Valveny | ||||
| Title | Query by String word spotting based on character bi-gram indexing | Type | Conference Article | ||
| Year | 2015 | Publication | 13th International Conference on Document Analysis and Recognition ICDAR2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 881-885 | ||
| Keywords | |||||
| Abstract | In this paper we propose a segmentation-free query by string word spotting method. Both the documents and query strings are encoded using a recently proposed word representa- tion that projects images and strings into a common atribute space based on a pyramidal histogram of characters(PHOC). These attribute models are learned using linear SVMs over the Fisher Vector representation of the images along with the PHOC labels of the corresponding strings. In order to search through the whole page, document regions are indexed per character bi- gram using a similar attribute representation. On top of that, we propose an integral image representation of the document using a simplified version of the attribute model for efficient computation. Finally we introduce a re-ranking step in order to boost retrieval performance. We show state-of-the-art results for segmentation-free query by string word spotting in single-writer and multi-writer standard datasets | ||||
| Address | Nancy; France; August 2015 | ||||
| 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; 600.077 | Approved | no | ||
| Call Number |
Admin @ si @ GhV2015a | Serial | 2715 | ||
| Permanent link to this record | |||||
| Author | Suman Ghosh; Ernest Valveny | ||||
| Title | A Sliding Window Framework for Word Spotting Based on Word Attributes | Type | Conference Article | ||
| Year | 2015 | Publication | Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015 | Abbreviated Journal | |
| Volume | 9117 | Issue | Pages | 652-661 | |
| Keywords | Word spotting; Sliding window; Word attributes | ||||
| Abstract | In this paper we propose a segmentation-free approach to word spotting. Word images are first encoded into feature vectors using Fisher Vector. Then, these feature vectors are used together with pyramidal histogram of characters labels (PHOC) to learn SVM-based attribute models. Documents are represented by these PHOC based word attributes. To efficiently compute the word attributes over a sliding window, we propose to use an integral image representation of the document using a simplified version of the attribute model. Finally we re-rank the top word candidates using the more discriminative full version of the word attributes. We show state-of-the-art results for segmentation-free query-by-example word spotting in single-writer and multi-writer standard datasets. | ||||
| Address | Santiago de Compostela; June 2015 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | 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-319-19389-2 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | DAG; 600.077 | Approved | no | ||
| Call Number |
Admin @ si @ GhV2015b | Serial | 2716 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | Object Proposals for Text Extraction in the Wild | Type | Conference Article | ||
| Year | 2015 | Publication | 13th International Conference on Document Analysis and Recognition ICDAR2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 206 - 210 | ||
| Keywords | |||||
| Abstract | Object Proposals is a recent computer vision technique receiving increasing interest from the research community. Its main objective is to generate a relatively small set of bounding box proposals that are most likely to contain objects of interest. The use of Object Proposals techniques in the scene text understanding field is innovative. Motivated by the success of powerful while expensive techniques to recognize words in a holistic way, Object Proposals techniques emerge as an alternative to the traditional text detectors. In this paper we study to what extent the existing generic Object Proposals methods may be useful for scene text understanding. Also, we propose a new Object Proposals algorithm that is specifically designed for text and compare it with other generic methods in the state of the art. Experiments show that our proposal is superior in its ability of producing good quality word proposals in an efficient way. The source code of our method is made publicly available | ||||
| 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 | ICDAR | ||
| Notes | DAG; 600.077; 600.084; 601.197 | Approved | no | ||
| Call Number |
Admin @ si @ GoK2015 | Serial | 2691 | ||
| Permanent link to this record | |||||
| Author | Alejandro Gonzalez Alzate | ||||
| Title | Multi-modal Pedestrian Detection | Type | Book Whole | ||
| Year | 2015 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Pedestrian detection continues to be an extremely challenging problem in real scenarios, in which situations like illumination changes, noisy images, unexpected objects, uncontrolled scenarios and variant appearance of objects occur constantly. All these problems force the development of more robust detectors for relevant applications like vision-based autonomous vehicles, intelligent surveillance, and pedestrian tracking for behavior analysis. Most reliable vision-based pedestrian detectors base their decision on features extracted using a single sensor capturing complementary features, e.g., appearance, and texture. These features usually are extracted from the current frame, ignoring temporal information, or including it in a post process step e.g., tracking or temporal coherence. Taking into account these issues we formulate the following question: can we generate more robust pedestrian detectors by introducing new information sources in the feature extraction step?
In order to answer this question we develop different approaches for introducing new information sources to well-known pedestrian detectors. We start by the inclusion of temporal information following the Stacked Sequential Learning (SSL) paradigm which suggests that information extracted from the neighboring samples in a sequence can improve the accuracy of a base classifier. We then focus on the inclusion of complementary information from different sensors like 3D point clouds (LIDAR – depth), far infrared images (FIR), or disparity maps (stereo pair cameras). For this end we develop a multi-modal framework in which information from different sensors is used for increasing detection accuracy (by increasing information redundancy). Finally we propose a multi-view pedestrian detector, this multi-view approach splits the detection problem in n sub-problems. Each sub-problem will detect objects in a given specific view reducing in that way the variability problem faced when a single detectors is used for the whole problem. We show that these approaches obtain competitive results with other state-of-the-art methods but instead of design new features, we reuse existing ones boosting their performance. |
||||
| Address | November 2015 | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | David Vazquez;Antonio Lopez; | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-943427-7-6 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.076 | Approved | no | ||
| Call Number |
Admin @ si @ Gon2015 | Serial | 2706 | ||
| Permanent link to this record | |||||
| Author | Josep M. Gonfaus; Marco Pedersoli; Jordi Gonzalez; Andrea Vedaldi; Xavier Roca | ||||
| Title | Factorized appearances for object detection | Type | Journal Article | ||
| Year | 2015 | Publication | Computer Vision and Image Understanding | Abbreviated Journal | CVIU |
| Volume | 138 | Issue | Pages | 92–101 | |
| Keywords | Object recognition; Deformable part models; Learning and sharing parts; Discovering discriminative parts | ||||
| Abstract | Deformable object models capture variations in an object’s appearance that can be represented as image deformations. Other effects such as out-of-plane rotations, three-dimensional articulations, and self-occlusions are often captured by considering mixture of deformable models, one per object aspect. A more scalable approach is representing instead the variations at the level of the object parts, applying the concept of a mixture locally. Combining a few part variations can in fact cheaply generate a large number of global appearances.
A limited version of this idea was proposed by Yang and Ramanan [1], for human pose dectection. In this paper we apply it to the task of generic object category detection and extend it in several ways. First, we propose a model for the relationship between part appearances more general than the tree of Yang and Ramanan [1], which is more suitable for generic categories. Second, we treat part locations as well as their appearance as latent variables so that training does not need part annotations but only the object bounding boxes. Third, we modify the weakly-supervised learning of Felzenszwalb et al. and Girshick et al. [2], [3] to handle a significantly more complex latent structure. Our model is evaluated on standard object detection benchmarks and is found to improve over existing approaches, yielding state-of-the-art results for several object categories. |
||||
| 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; 600.063; 600.078 | Approved | no | ||
| Call Number |
Admin @ si @ GPG2015 | Serial | 2705 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; David Roche; Agnes Borras; Jesus Giraldo | ||||
| Title | Terminating Evolutionary Algorithms at their Steady State | Type | Journal Article | ||
| Year | 2015 | Publication | Computational Optimization and Applications | Abbreviated Journal | COA |
| Volume | 61 | Issue | 2 | Pages | 489-515 |
| Keywords | Evolutionary algorithms; Termination condition; Steady state; Differential evolution | ||||
| Abstract | Assessing the reliability of termination conditions for evolutionary algorithms (EAs) is of prime importance. An erroneous or weak stop criterion can negatively affect both the computational effort and the final result. We introduce a statistical framework for assessing whether a termination condition is able to stop an EA at its steady state, so that its results can not be improved anymore. We use a regression model in order to determine the requirements ensuring that a measure derived from EA evolving population is related to the distance to the optimum in decision variable space. Our framework is analyzed across 24 benchmark test functions and two standard termination criteria based on function fitness value in objective function space and EA population decision variable space distribution for the differential evolution (DE) paradigm. Results validate our framework as a powerful tool for determining the capability of a measure for terminating EA and the results also identify the decision variable space distribution as the best-suited for accurately terminating DE in real-world applications. | ||||
| 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 | 0926-6003 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | IAM; 600.044; 605.203; 600.060; 600.075 | Approved | no | ||
| Call Number |
Admin @ si @ GRB2015 | Serial | 2560 | ||
| Permanent link to this record | |||||
| Author | Hongxing Gao; Marçal Rusiñol; Dimosthenis Karatzas; Josep Llados; R.Jain; D.Doermann | ||||
| Title | Novel Line Verification for Multiple Instance Focused Retrieval in Document Collections | Type | Conference Article | ||
| Year | 2015 | Publication | 13th International Conference on Document Analysis and Recognition ICDAR2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 481-485 | ||
| Keywords | |||||
| Abstract | |||||
| Address | Nancy; France; August 2015 | ||||
| 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; 600.077; 601.223; 600.084; 600.061 | Approved | no | ||
| Call Number |
Admin @ si @ GRK2015 | Serial | 2683 | ||
| Permanent link to this record | |||||
| Author | Manuel Graña; Bogdan Raducanu | ||||
| Title | Special Issue on Bioinspired and knowledge based techniques and applications | Type | Journal Article | ||
| Year | 2015 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | Issue | Pages | 1-3 | ||
| Keywords | |||||
| Abstract | |||||
| 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 @ GrR2015 | Serial | 2598 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; F. Javier Sanchez; Gloria Fernandez Esparrach; Jorge Bernal | ||||
| Title | 3D Stable Spatio-temporal Polyp Localization in Colonoscopy Videos | Type | Book Chapter | ||
| Year | 2015 | Publication | Computer-Assisted and Robotic Endoscopy. Revised selected papers of Second International Workshop, CARE 2015, Held in Conjunction with MICCAI 2015 | Abbreviated Journal | |
| Volume | 9515 | Issue | Pages | 140-152 | |
| Keywords | Colonoscopy, Polyp Detection, Polyp Localization, Region Extraction, Watersheds | ||||
| Abstract | Computational intelligent systems could reduce polyp miss rate in colonoscopy for colon cancer diagnosis and, thus, increase the efficiency of the procedure. One of the main problems of existing polyp localization methods is a lack of spatio-temporal stability in their response. We propose to explore the response of a given polyp localization across temporal windows in order to select
those image regions presenting the highest stable spatio-temporal response. Spatio-temporal stability is achieved by extracting 3D watershed regions on the temporal window. Stability in localization response is statistically determined by analysis of the variance of the output of the localization method inside each 3D region. We have explored the benefits of considering spatio-temporal stability in two different tasks: polyp localization and polyp detection. Experimental results indicate an average improvement of 21:5% in polyp localization and 43:78% in polyp detection. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | 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 | CARE | ||
| Notes | IAM; MV; 600.075 | Approved | no | ||
| Call Number |
Admin @ si @ GSF2015 | Serial | 2733 | ||
| Permanent link to this record | |||||
| Author | Wenjuan Gong; W.Zhang; Jordi Gonzalez; Y.Ren; Z.Li | ||||
| Title | Enhanced Asymmetric Bilinear Model for Face Recognition | Type | Journal Article | ||
| Year | 2015 | Publication | International Journal of Distributed Sensor Networks | Abbreviated Journal | IJDSN |
| Volume | Issue | Pages | Article ID 218514 | ||
| Keywords | |||||
| Abstract | Bilinear models have been successfully applied to separate two factors, for example, pose variances and different identities in face recognition problems. Asymmetric model is a type of bilinear model which models a system in the most concise way. But seldom there are works exploring the applications of asymmetric bilinear model on face recognition problem with illumination changes. In this work, we propose enhanced asymmetric model for illumination-robust face recognition. Instead of initializing the factor probabilities randomly, we initialize them with nearest neighbor method and optimize them for the test data. Above that, we update the factor model to be identified. We validate the proposed method on a designed data sample and extended Yale B dataset. The experiment results show that the enhanced asymmetric models give promising results and good recognition accuracies. | ||||
| 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; 600.063; 600.078 | Approved | no | ||
| Call Number |
Admin @ si @ GZG2015 | Serial | 2592 | ||
| Permanent link to this record | |||||