| Records |
| Author |
Dani Rowe; Jordi Gonzalez; Marco Pedersoli; Juan J. Villanueva |
| Title |
On Tracking Inside Groups |
Type |
Journal Article |
| Year |
2010 |
Publication |
Machine Vision and Applications |
Abbreviated Journal |
MVA |
| Volume |
21 |
Issue |
2 |
Pages  |
113–127 |
| Keywords |
|
| Abstract |
This work develops a new architecture for multiple-target tracking in unconstrained dynamic scenes, which consists of a detection level which feeds a two-stage tracking system. A remarkable characteristic of the system is its ability to track several targets while they group and split, without using 3D information. Thus, special attention is given to the feature-selection and appearance-computation modules, and to those modules involved in tracking through groups. The system aims to work as a stand-alone application in complex and dynamic scenarios. No a-priori knowledge about either the scene or the targets, based on a previous training period, is used. Hence, the scenario is completely unknown beforehand. Successful tracking has been demonstrated in well-known databases of both indoor and outdoor scenarios. Accurate and robust localisations have been yielded during long-term target merging and occlusions. |
| 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 |
0932-8092 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ISE |
Approved |
no |
| Call Number |
ISE @ ise @ RGP2010 |
Serial |
1158 |
| 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 |
Jose Manuel Alvarez; Antonio Lopez |
| Title |
Photometric Invariance by Machine Learning |
Type |
Book Chapter |
| Year |
2012 |
Publication |
Color in Computer Vision: Fundamentals and Applications |
Abbreviated Journal |
|
| Volume |
7 |
Issue |
|
Pages |
113-134 |
| Keywords |
road detection |
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
iConcept Press Ltd |
Place of Publication |
|
Editor |
Theo Gevers, Arjan Gijsenij, Joost van de Weijer, Jan-Mark Geusebroek |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-0-470-89084-4 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ AlL2012 |
Serial |
2186 |
| Permanent link to this record |
| |
|
| |
| Author |
Miguel Oliveira; Victor Santos; Angel Sappa; P. Dias; A. Moreira |
| Title |
Incremental texture mapping for autonomous driving |
Type |
Journal Article |
| Year |
2016 |
Publication |
Robotics and Autonomous Systems |
Abbreviated Journal |
RAS |
| Volume |
84 |
Issue |
|
Pages |
113-128 |
| Keywords |
Scene reconstruction; Autonomous driving; Texture mapping |
| Abstract |
Autonomous vehicles have a large number of on-board sensors, not only for providing coverage all around the vehicle, but also to ensure multi-modality in the observation of the scene. Because of this, it is not trivial to come up with a single, unique representation that feeds from the data given by all these sensors. We propose an algorithm which is capable of mapping texture collected from vision based sensors onto a geometric description of the scenario constructed from data provided by 3D sensors. The algorithm uses a constrained Delaunay triangulation to produce a mesh which is updated using a specially devised sequence of operations. These enforce a partial configuration of the mesh that avoids bad quality textures and ensures that there are no gaps in the texture. Results show that this algorithm is capable of producing fine quality textures. |
| 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; 600.086 |
Approved |
no |
| Call Number |
Admin @ si @ OSS2016b |
Serial |
2912 |
| Permanent link to this record |
| |
|
| |
| Author |
Joel Barajas; Jaume Garcia; Karla Lizbeth Caballero; Francesc Carreras; Sandra Pujades; Petia Radeva |
| Title |
Correction of Misalignment Artifacts Among 2-D Cardiac MR Images in 3-D Space |
Type |
Conference Article |
| Year |
2006 |
Publication |
1st International Wokshop on Computer Vision for Intravascular and Intracardiac Imaging (CVII’06) |
Abbreviated Journal |
|
| Volume |
3217 |
Issue |
|
Pages |
114-121 |
| Keywords |
|
| Abstract |
Cardiac Magnetic Resonance images offer the opportunity to study the heart in detail. One of the main issues in its modelling is to create an accurate 3-D reconstruction of the left ventricle from 2-D views. A first step to achieve this goal is the correct registration among the different image planes due to patient movements. In this article, we present an accurate method to correct displacement artifacts using the Normalized Mutual Information. Here, the image views are treated as planes in order to diminish the approximation error caused by the association of a certain thickness, and moved simultaneously to avoid any kind of bias in the alignment process. This method has been validated using real and syntectic plane displacements, yielding promising results. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
Copenhagen (Denmark) |
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-3-540-22977-3 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
IAM;MILAB |
Approved |
no |
| Call Number |
IAM @ iam @ BGC2006 |
Serial |
1485 |
| Permanent link to this record |
| |
|
| |
| Author |
Angel Sappa; Boris X. Vintimilla |
| Title |
Edge Point Linking by Means of Global and Local Schemes |
Type |
Book Chapter |
| Year |
2008 |
Publication |
in Signal Processing for Image Enhancement and Multimedia Processing |
Abbreviated Journal |
|
| Volume |
11 |
Issue |
|
Pages |
115–125 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer |
Place of Publication |
|
Editor |
E. Damiani |
| 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 @ SaV2008 |
Serial |
938 |
| Permanent link to this record |
| |
|
| |
| Author |
Carme Julia; Felipe Lumbreras; Angel Sappa |
| Title |
A Factorization-based Approach to Photometric Stereo |
Type |
Journal Article |
| Year |
2011 |
Publication |
International Journal of Imaging Systems and Technology |
Abbreviated Journal |
IJIST |
| Volume |
21 |
Issue |
1 |
Pages |
115-119 |
| Keywords |
|
| Abstract |
This article presents an adaptation of a factorization technique to tackle the photometric stereo problem. That is to recover the surface normals and reflectance of an object from a set of images obtained under different lighting conditions. The main contribution of the proposed approach is to consider pixels in shadow and saturated regions as missing data, in order to reduce their influence to the result. Concretely, an adapted Alternation technique is used to deal with missing data. Experimental results considering both synthetic and real images show the viability of the proposed factorization-based strategy. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 115–119, 2011. |
| 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 |
Admin @ si @ JLS2011; ADAS @ adas @ |
Serial |
1711 |
| Permanent link to this record |
| |
|
| |
| Author |
Pau Riba; Josep Llados; Alicia Fornes |
| Title |
Hierarchical graphs for coarse-to-fine error tolerant matching |
Type |
Journal Article |
| Year |
2020 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
134 |
Issue |
|
Pages |
116-124 |
| Keywords |
Hierarchical graph representation; Coarse-to-fine graph matching; Graph-based retrieval |
| Abstract |
During the last years, graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their ability to capture both structural and appearance-based information. Thus, they provide a greater representational power than classical statistical frameworks. However, graph-based representations leads to high computational complexities usually dealt by graph embeddings or approximated matching techniques. Despite their representational power, they are very sensitive to noise and small variations of the input image. With the aim to cope with the time complexity and the variability present in the generated graphs, in this paper we propose to construct a novel hierarchical graph representation. Graph clustering techniques adapted from social media analysis have been used in order to contract a graph at different abstraction levels while keeping information about the topology. Abstract nodes attributes summarise information about the contracted graph partition. For the proposed representations, a coarse-to-fine matching technique is defined. Hence, small graphs are used as a filtering before more accurate matching methods are applied. This approach has been validated in real scenarios such as classification of colour images or retrieval of handwritten words (i.e. word spotting). |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG; 600.097; 601.302; 603.057; 600.140; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ RLF2020 |
Serial |
3349 |
| Permanent link to this record |
| |
|
| |
| Author |
Sergio Escalera; Oriol Pujol; Petia Radeva |
| Title |
Loss-Weighted Decoding for Error-Correcting Output Coding |
Type |
Conference Article |
| Year |
2008 |
Publication |
3rd International Conference on Computer Vision Theory and Applications, |
Abbreviated Journal |
|
| Volume |
2 |
Issue |
|
Pages |
117–122 |
| Keywords |
|
| Abstract |
|
| Address |
Madeira (Portugal) |
| 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 |
VISAPP |
| Notes |
MILAB;HuPBA |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ EPR2008a |
Serial |
964 |
| Permanent link to this record |
| |
|
| |
| Author |
Michal Drozdzal; Laura Igual; Petia Radeva; Jordi Vitria; C. Malagelada; Fernando Azpiroz |
| Title |
Aligning Endoluminal Scene Sequences in Wireless Capsule Endoscopy |
Type |
Conference Article |
| Year |
2010 |
Publication |
IEEE Computer Society Workshop on Mathematical Methods in Biomedical Image Analysis |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
117–124 |
| Keywords |
|
| Abstract |
Intestinal motility analysis is an important examination in detection of various intestinal malfunctions. One of the big challenges of automatic motility analysis is how to compare sequence of images and extract dynamic paterns taking into account the high deformability of the intestine wall as well as the capsule motion. From clinical point of view the ability to align endoluminal scene sequences will help to find regions of similar intestinal activity and in this way will provide a valuable information on intestinal motility problems. This work, for first time, addresses the problem of aligning endoluminal sequences taking into account motion and structure of the intestine. To describe motility in the sequence, we propose different descriptors based on the Sift Flow algorithm, namely: (1) Histograms of Sift Flow Directions to describe the flow course, (2) Sift Descriptors to represent image intestine structure and (3) Sift Flow Magnitude to quantify intestine deformation. We show that the merge of all three descriptors provides robust information on sequence description in terms of motility. Moreover, we develop a novel methodology to rank the intestinal sequences based on the expert feedback about relevance of the results. The experimental results show that the selected descriptors are useful in the alignment and similarity description and the proposed method allows the analysis of the WCE. |
| Address |
San Francisco; CA; USA; June 2010 |
| 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 |
2160-7508 |
ISBN |
978-1-4244-7029-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
MMBIA |
| Notes |
OR;MILAB;MV |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ DIR2010 |
Serial |
1316 |
| Permanent link to this record |
| |
|
| |
| Author |
Nuria Cirera; Alicia Fornes; Volkmar Frinken; Josep Llados |
| Title |
Hybrid grammar language model for handwritten historical documents recognition |
Type |
Conference Article |
| Year |
2013 |
Publication |
6th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
| Volume |
7887 |
Issue |
|
Pages |
117-124 |
| Keywords |
|
| Abstract |
In this paper we present a hybrid language model for the recognition of handwritten historical documents with a structured syntactical layout. Using a hidden Markov model-based recognition framework, a word-based grammar with a closed dictionary is enhanced by a character sequence recognition method. This allows to recognize out-of-dictionary words in controlled parts of the recognition, while keeping a closed vocabulary restriction for other parts. While the current status is work in progress, we can report an improvement in terms of character error rate. |
| Address |
Madeira; Portugal; June 2013 |
| 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-38627-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
IbPRIA |
| Notes |
DAG; 602.006; 600.045; 600.061 |
Approved |
no |
| Call Number |
Admin @ si @ CFF2013 |
Serial |
2292 |
| Permanent link to this record |
| |
|
| |
| Author |
Mark Philip Philipsen; Jacob Velling Dueholm; Anders Jorgensen; Sergio Escalera; Thomas B. Moeslund |
| Title |
Organ Segmentation in Poultry Viscera Using RGB-D |
Type |
Journal Article |
| Year |
2018 |
Publication |
Sensors |
Abbreviated Journal |
SENS |
| Volume |
18 |
Issue |
1 |
Pages |
117 |
| Keywords |
semantic segmentation; RGB-D; random forest; conditional random field; 2D; 3D; CNN |
| Abstract |
We present a pattern recognition framework for semantic segmentation of visual structures, that is, multi-class labelling at pixel level, and apply it to the task of segmenting organs in the eviscerated viscera from slaughtered poultry in RGB-D images. This is a step towards replacing the current strenuous manual inspection at poultry processing plants. Features are extracted from feature maps such as activation maps from a convolutional neural network (CNN). A random forest classifier assigns class probabilities, which are further refined by utilizing context in a conditional random field. The presented method is compatible with both 2D and 3D features, which allows us to explore the value of adding 3D and CNN-derived features. The dataset consists of 604 RGB-D images showing 151 unique sets of eviscerated viscera from four different perspectives. A mean Jaccard index of 78.11% is achieved across the four classes of organs by using features derived from 2D, 3D and a CNN, compared to 74.28% using only basic 2D image features. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
HUPBA; no proj |
Approved |
no |
| Call Number |
Admin @ si @ PVJ2018 |
Serial |
3072 |
| Permanent link to this record |
| |
|
| |
| Author |
Joan Mas; Gemma Sanchez; Josep Llados |
| Title |
SSP: Sketching slide Presentations, a Syntactic Approach |
Type |
Book Chapter |
| Year |
2010 |
Publication |
Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers |
Abbreviated Journal |
|
| Volume |
6020 |
Issue |
|
Pages |
118-129 |
| Keywords |
|
| Abstract |
The design of a slide presentation is a creative process. In this process first, humans visualize in their minds what they want to explain. Then, they have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize a slide presentation from a sketch. A slide may be seen as a graphical document or a diagram where its elements are placed in a particular spatial arrangement. To describe and recognize slides a syntactic approach is proposed. This approach is based on an Adjacency Grammar and a parsing methodology to cope with this kind of grammars. The experimental evaluation shows the performance of our methodology from a qualitative and a quantitative point of view. Six different slides containing different number of symbols, from 4 to 7, have been given to the users and they have drawn them without restrictions in the order of the elements. The quantitative results give an idea on how suitable is our methodology to describe and recognize the different elements in a slide. |
| Address |
|
| 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-13727-3 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
MSL2010 |
Serial |
2405 |
| Permanent link to this record |
| |
|
| |
| Author |
Pichao Wang; Wanqing Li; Philip Ogunbona; Jun Wan; Sergio Escalera |
| Title |
RGB-D-based Human Motion Recognition with Deep Learning: A Survey |
Type |
Journal Article |
| Year |
2018 |
Publication |
Computer Vision and Image Understanding |
Abbreviated Journal |
CVIU |
| Volume |
171 |
Issue |
|
Pages |
118-139 |
| Keywords |
Human motion recognition; RGB-D data; Deep learning; Survey |
| Abstract |
Human motion recognition is one of the most important branches of human-centered research activities. In recent years, motion recognition based on RGB-D data has attracted much attention. Along with the development in artificial intelligence, deep learning techniques have gained remarkable success in computer vision. In particular, convolutional neural networks (CNN) have achieved great success for image-based tasks, and recurrent neural networks (RNN) are renowned for sequence-based problems. Specifically, deep learning methods based on the CNN and RNN architectures have been adopted for motion recognition using RGB-D data. In this paper, a detailed overview of recent advances in RGB-D-based motion recognition is presented. The reviewed methods are broadly categorized into four groups, depending on the modality adopted for recognition: RGB-based, depth-based, skeleton-based and RGB+D-based. As a survey focused on the application of deep learning to RGB-D-based motion recognition, we explicitly discuss the advantages and limitations of existing techniques. Particularly, we highlighted the methods of encoding spatial-temporal-structural information inherent in video sequence, and discuss potential directions for future research. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
HUPBA; no proj |
Approved |
no |
| Call Number |
Admin @ si @ WLO2018 |
Serial |
3123 |
| Permanent link to this record |
| |
|
| |
| Author |
Thanh Nam Le; Muhammad Muzzamil Luqman; Anjan Dutta; Pierre Heroux; Christophe Rigaud; Clement Guerin; Pasquale Foggia; Jean Christophe Burie; Jean Marc Ogier; Josep Llados; Sebastien Adam |
| Title |
Subgraph spotting in graph representations of comic book images |
Type |
Journal Article |
| Year |
2018 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
112 |
Issue |
|
Pages |
118-124 |
| Keywords |
Attributed graph; Region adjacency graph; Graph matching; Graph isomorphism; Subgraph isomorphism; Subgraph spotting; Graph indexing; Graph retrieval; Query by example; Dataset and comic book images |
| Abstract |
Graph-based representations are the most powerful data structures for extracting, representing and preserving the structural information of underlying data. Subgraph spotting is an interesting research problem, especially for studying and investigating the structural information based content-based image retrieval (CBIR) and query by example (QBE) in image databases. In this paper we address the problem of lack of freely available ground-truthed datasets for subgraph spotting and present a new dataset for subgraph spotting in graph representations of comic book images (SSGCI) with its ground-truth and evaluation protocol. Experimental results of two state-of-the-art methods of subgraph spotting are presented on the new SSGCI dataset. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG; 600.097; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ LLD2018 |
Serial |
3150 |
| Permanent link to this record |
