Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	241–255 of 3413 records found matching your query (RSS):

Search & Display Options

Select All Deselect All

[1–10] << 11 12 13 14 15 16 17 18 19 20 >> [21–30]

List View

Citations

Details

	Records
	Author	Jaume Gibert; Ernest Valveny; Oriol Ramos Terrades; Horst Bunke
	Title	Multiple Classifiers for Graph of Words Embedding			Type	Conference Article
	Year	2011	Publication	10th International Conference on Multiple Classifier Systems	Abbreviated Journal
	Volume	6713	Issue		Pages	36-45
	Keywords
	Abstract	During the last years, there has been an increasing interest in applying the multiple classifier framework to the domain of structural pattern recognition. Constructing base classifiers when the input patterns are graph based representations is not an easy problem. In this work, we make use of the graph embedding methodology in order to construct different feature vector representations for graphs. The graph of words embedding assigns a feature vector to every graph by counting unary and binary relations between node representatives and combining these pieces of information into a single vector. Selecting different node representatives leads to different vectorial representations and therefore to different base classifiers that can be combined. We experimentally show how this methodology significantly improves the classification of graphs with respect to single base classifiers.
	Address	Napoles, Italy
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Carlo Sansone; Josef Kittler; Fabio Roli
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-21556-8	Medium
	Area		Expedition		Conference	MCS
	Notes	DAG			Approved	no
	Call Number	Admin @ si @GVR2011			Serial	1745
Permanent link to this record



	Author	Pierluigi Casale; Oriol Pujol; Petia Radeva
	Title	Approximate Convex Hulls Family for One-Class Cassification			Type	Conference Article
	Year	2011	Publication	10th International Workshop on Multiple Classifier Systems	Abbreviated Journal
	Volume	6713	Issue		Pages	106-115
	Keywords
	Abstract	In this work, a new method for one-class classification based on the Convex Hull geometric structure is proposed. The new method creates a family of convex hulls able to fit the geometrical shape of the training points. The increased computational cost due to the creation of the convex hull in multiple dimensions is circumvented using random projections. This provides an approximation of the original structure with multiple bi-dimensional views. In the projection planes, a mechanism for noisy points rejection has also been elaborated and evaluated. Results show that the approach performs considerably well with respect to the state the art in one-class classification.
	Address	Napoli, Italy
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Carlo Sansone; Josef Kittler; Fabio Roli
	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-21556-8	Medium
	Area		Expedition		Conference	MCS
	Notes	MILAB;HuPBA			Approved	no
	Call Number	Admin @ si @ CPR2011b			Serial	1761
Permanent link to this record



	Author	Miguel Angel Bautista; Oriol Pujol; Xavier Baro; Sergio Escalera
	Title	Introducing the Separability Matrix for Error Correcting Output Codes Coding			Type	Conference Article
	Year	2011	Publication	10th International conference on Multiple Classifier Systems	Abbreviated Journal
	Volume	6713	Issue		Pages	227-236
	Keywords
	Abstract	Error Correcting Output Codes (ECOC) have demonstrate to be a powerful tool for treating multi-class problems. Nevertheless, predefined ECOC designs may not benefit from Error-correcting principles for particular multi-class data. In this paper, we introduce the Separability matrix as a tool to study and enhance designs for ECOC coding. In addition, a novel problem-dependent coding design based on the Separability matrix is tested over a wide set of challenging multi-class problems, obtaining very satisfactory results.
	Address	Napoles, Italy
	Corporate Author				Thesis
	Publisher	Springer-Verlag Berlin Heidelberg	Place of Publication		Editor	Carlo Sansone; Josef Kittler; Fabio Roli
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-21556-8	Medium
	Area		Expedition		Conference	MCS
	Notes	MILAB; OR;HuPBA;MV			Approved	no
	Call Number	Admin @ si @ BPB2011a			Serial	1771
Permanent link to this record



	Author	Eloi Puertas; Sergio Escalera; Oriol Pujol
	Title	Multi-Class Multi-Scale Stacked Sequential Learning			Type	Conference Article
	Year	2011	Publication	10th International Conference on Multiple Classifier Systems	Abbreviated Journal
	Volume	6713	Issue		Pages	197-206
	Keywords
	Abstract
	Address	Napoles, Italy
	Corporate Author				Thesis
	Publisher	Springer	Place of Publication		Editor	Carlo Sansone; Josef Kittler; Fabio Roli
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	MCS
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ PEP2011b			Serial	1772
Permanent link to this record



	Author	Miguel Angel Bautista; Oriol Pujol; Xavier Baro; Sergio Escalera
	Title	Introducing the Separability Matrix for Error Correcting Output Codes Coding			Type	Conference Article
	Year	2011	Publication	10th International Conference on Multiple Classifier Systems	Abbreviated Journal
	Volume	6713	Issue		Pages	227-236
	Keywords
	Abstract	Error Correcting Output Codes (ECOC) have demonstrate to be a powerful tool for treating multi-class problems. Nevertheless, predefined ECOC designs may not benefit from Error-correcting principles for particular multi-class data. In this paper, we introduce the Separability matrix as a tool to study and enhance designs for ECOC coding. In addition, a novel problem-dependent coding design based on the Separability matrix is tested over a wide set of challenging multi-class problems, obtaining very satisfactory results.
	Address	Napoles, Italy
	Corporate Author				Thesis
	Publisher	Springer-Verlag Berlin, Heidelberg	Place of Publication		Editor	Carlo Sansone; Josef Kittler; Fabio Roli
	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-21556-8	Medium
	Area		Expedition		Conference	MCS
	Notes	MILAB; OR;HuPBA;MV			Approved	no
	Call Number	Admin @ si @ BPB2011b			Serial	1887
Permanent link to this record



	Author	Adriana Romero
	Title	Assisting the training of deep neural networks with applications to computer vision			Type	Book Whole
	Year	2015	Publication	PhD Thesis, Universitat de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep learning has recently been enjoying an increasing popularity due to its success in solving challenging tasks. In particular, deep learning has proven to be effective in a large variety of computer vision tasks, such as image classification, object recognition and image parsing. Contrary to previous research, which required engineered feature representations, designed by experts, in order to succeed, deep learning attempts to learn representation hierarchies automatically from data. More recently, the trend has been to go deeper with representation hierarchies. Learning (very) deep representation hierarchies is a challenging task, which involves the optimization of highly non-convex functions. Therefore, the search for algorithms to ease the learning of (very) deep representation hierarchies from data is extensive and ongoing. In this thesis, we tackle the challenging problem of easing the learning of (very) deep representation hierarchies. We present a hyper-parameter free, off-the-shelf, simple and fast unsupervised algorithm to discover hidden structure from the input data by enforcing a very strong form of sparsity. We study the applicability and potential of the algorithm to learn representations of varying depth in a handful of applications and domains, highlighting the ability of the algorithm to provide discriminative feature representations that are able to achieve top performance. Yet, while emphasizing the great value of unsupervised learning methods when labeled data is scarce, the recent industrial success of deep learning has revolved around supervised learning. Supervised learning is currently the focus of many recent research advances, which have shown to excel at many computer vision tasks. Top performing systems often involve very large and deep models, which are not well suited for applications with time or memory limitations. More in line with the current trends, we engage in making top performing models more efficient, by designing very deep and thin models. Since training such very deep models still appears to be a challenging task, we introduce a novel algorithm that guides the training of very thin and deep models by hinting their intermediate representations. Very deep and thin models trained by the proposed algorithm end up extracting feature representations that are comparable or even better performing than the ones extracted by large state-of-the-art models, while compellingly reducing the time and memory consumption of the model.
	Address	October 2015
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Carlo Gatta;Petia Radeva
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ Rom2015			Serial	2707
Permanent link to this record



	Author	Jaume Garcia; Debora Gil; Aura Hernandez-Sabate
	Title	Endowing Canonical Geometries to Cardiac Structures			Type	Book Chapter
	Year	2010	Publication	Statistical Atlases And Computational Models Of The Heart	Abbreviated Journal
	Volume	6364	Issue		Pages	124-133
	Keywords
	Abstract	International conference on Cardiac electrophysiological simulation challenge In this paper, we show that canonical (shape-based) geometries can be endowed to cardiac structures using tubular coordinates defined over their medial axis. We give an analytic formulation of these geometries by means of B-Splines. Since B-Splines present vector space structure PCA can be applied to their control points and statistical models relating boundaries and the interior of the anatomical structures can be derived. We demonstrate the applicability in two cardiac structures, the 3D Left Ventricular volume, and the 2D Left-Right ventricle set in 2D Short Axis view.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin / Heidelberg	Place of Publication		Editor	Camara, O.; Pop, M.; Rhode, K.; Sermesant, M.; Smith, N.; Young, A.
	Language		Summary Language		Original Title
	Series Editor		Series Title	Lecture Notes in Computer Science	Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ GGH2010b			Serial	1515
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta
	Title	Large-scale Graph Indexing using Binary Embeddings of Node Contexts			Type	Conference Article
	Year	2015	Publication	10th IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition	Abbreviated Journal
	Volume	9069	Issue		Pages	208-217
	Keywords	Graph matching; Graph indexing; Application in document analysis; Word spotting; Binary embedding
	Abstract	Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations in terms of feature vectors. Retrieving a query graph from a large dataset of graphs has the drawback of the high computational complexity required to compare the query and the target graphs. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. In this paper we propose a fast indexation formalism for graph retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Hence, each attribute counts the length of a walk of order k originated in a vertex with label l. Each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in a handwritten word spotting scenario in images of historical documents.
	Address	Beijing; China; May 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor	C.-L.Liu; B.Luo; W.G.Kropatsch; J.Cheng
	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-18223-0	Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG; 600.061; 602.006; 600.077			Approved	no
	Call Number	Admin @ si @ RLF2015a			Serial	2618
Permanent link to this record



	Author	Arash Akbarinia
	Title	Computational Model of Visual Perception: From Colour to Form			Type	Book Whole
	Year	2017	Publication	PhD Thesis, Universitat Autonoma de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	The original idea of this project was to study the role of colour in the challenging task of object recognition. We started by extending previous research on colour naming showing that it is feasible to capture colour terms through parsimonious ellipsoids. Although, the results of our model exceeded state-of-the-art in two benchmark datasets, we realised that the two phenomena of metameric lights and colour constancy must be addressed prior to any further colour processing. Our investigation of metameric pairs reached the conclusion that they are infrequent in real world scenarios. Contrary to that, the illumination of a scene often changes dramatically. We addressed this issue by proposing a colour constancy model inspired by the dynamical centre-surround adaptation of neurons in the visual cortex. This was implemented through two overlapping asymmetric Gaussians whose variances and heights are adjusted according to the local contrast of pixels. We complemented this model with a generic contrast-variant pooling mechanism that inversely connect the percentage of pooled signal to the local contrast of a region. The results of our experiments on four benchmark datasets were indeed promising: the proposed model, although simple, outperformed even learning-based approaches in many cases. Encouraged by the success of our contrast-variant surround modulation, we extended this approach to detect boundaries of objects. We proposed an edge detection model based on the first derivative of the Gaussian kernel. We incorporated four types of surround: full, far, iso- and orthogonal-orientation. Furthermore, we accounted for the pooling mechanism at higher cortical areas and the shape feedback sent to lower areas. Our results in three benchmark datasets showed significant improvement over non-learning algorithms. To summarise, we demonstrated that biologically-inspired models offer promising solutions to computer vision problems, such as, colour naming, colour constancy and edge detection. We believe that the greatest contribution of this Ph.D dissertation is modelling the concept of dynamic surround modulation that shows the significance of contrast-variant surround integration. The models proposed here are grounded on only a portion of what we know about the human visual system. Therefore, it is only natural to complement them accordingly in future works.
	Address	October 2017
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	C. Alejandro Parraga
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-84-945373-4-9	Medium
	Area		Expedition		Conference
	Notes	NEUROBIT			Approved	no
	Call Number	Admin @ si @ Akb2017			Serial	3019
Permanent link to this record



	Author	Fadi Dornaika; Bogdan Raducanu; Alireza Bosaghzadeh
	Title	Facial expression recognition based on multi observations with application to social robotics			Type	Book Chapter
	Year	2015	Publication	Emotional and Facial Expressions: Recognition, Developmental Differences and Social Importance	Abbreviated Journal
	Volume		Issue		Pages	153-166
	Keywords
	Abstract	Human-robot interaction is a hot topic nowadays in the social robotics community. One crucial aspect is represented by the affective communication which comes encoded through the facial expressions. In this chapter, we propose a novel approach for facial expression recognition, which exploits an efficient and adaptive graph-based label propagation (semi-supervised mode) in a multi-observation framework. The facial features are extracted using an appearance-based 3D face tracker, viewand texture independent. Our method has been extensively tested on the CMU dataset, and has been conveniently compared with other methods for graph construction. With the proposed approach, we developed an application for an AIBO robot, in which it mirrors the recognized facial expression.
	Address
	Corporate Author				Thesis
	Publisher	Nova Science publishers	Place of Publication		Editor	Bruce Flores
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ DRB2015			Serial	2720
Permanent link to this record



	Author	Pau Riba; Alicia Fornes; Josep Llados
	Title	Towards the Alignment of Handwritten Music Scores			Type	Conference Article
	Year	2015	Publication	11th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	It is very common to find different versions of the same music work in archives of Opera Theaters. These differences correspond to modifications and annotations from the musicians. From the musicologist point of view, these variations are very interesting and deserve study. This paper explores the alignment of music scores as a tool for automatically detecting the passages that contain such differences. Given the difficulties in the recognition of handwritten music scores, our goal is to align the music scores and at the same time, avoid the recognition of music elements as much as possible. After removing the staff lines, braces and ties, the bar lines are detected. Then, the bar units are described as a whole using the Blurred Shape Model. The bar units alignment is performed by using Dynamic Time Warping. The analysis of the alignment path is used to detect the variations in the music scores. The method has been evaluated on a subset of the CVC-MUSCIMA dataset, showing encouraging results.
	Address	Nancy; France; August 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor	Bart Lamiroy; Rafael Dueire Lins
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-319-52158-9	Medium
	Area		Expedition		Conference	GREC
	Notes	DAG			Approved	no
	Call Number	Admin @ si @			Serial	2874
Permanent link to this record



	Author	Pau Riba; Alicia Fornes; Josep Llados
	Title	Towards the Alignment of Handwritten Music Scores			Type	Book Chapter
	Year	2017	Publication	International Workshop on Graphics Recognition. GREC 2015.Graphic Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	9657	Issue		Pages	103-116
	Keywords	Optical Music Recognition; Handwritten Music Scores; Dynamic Time Warping alignment
	Abstract	It is very common to nd dierent versions of the same music work in archives of Opera Theaters. These dierences correspond to modications and annotations from the musicians. From the musicologist point of view, these variations are very interesting and deserve study. This paper explores the alignment of music scores as a tool for automatically detecting the passages that contain such dierences. Given the diculties in the recognition of handwritten music scores, our goal is to align the music scores and at the same time, avoid the recognition of music elements as much as possible. After removing the sta lines, braces and ties, the bar lines are detected. Then, the bar units are described as a whole using the Blurred Shape Model. The bar units alignment is performed by using Dynamic Time Warping. The analysis of the alignment path is used to detect the variations in the music scores. The method has been evaluated on a subset of the CVC-MUSCIMA dataset, showing encouraging results.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Bart Lamiroy; R Dueire Lins
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-319-52158-9	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.097; 602.006; 600.121			Approved	no
	Call Number	Admin @ si @ RFL2017			Serial	2955
Permanent link to this record



	Author	Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal
	Title	A Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	7-11
	Keywords	Product graph; Dual edge graph; Subgraph matching; Random walks; Graph kernel
	Abstract	Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal with noisy information of vectorized graphical documents, we consider a dual edge graph representation on the original graph representing the graphical information and the product graph is computed between the dual edge graphs of the pattern graph and the target graph. The dual edge graph with redundant edges is helpful for efficient and tolerating encoding of the structural information of the graphical documents. The adjacency matrix of the product graph locates the pair of similar edges of two operand graphs and exponentiating the adjacency matrix finds similar random walks of greater lengths. Nodes joining similar random walks between two graphs are found by combining different weighted exponentials of adjacency matrices. An experimental investigation reveals that the recall obtained by this approach is quite encouraging.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.077			Approved	no
	Call Number	Admin @ si @ DLB2014			Serial	2698
Permanent link to this record



	Author	Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados
	Title	Hierarchical Plausibility-Graphs for Symbol Spotting in Graphical Documents			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	25-37
	Keywords
	Abstract	Graph representation of graphical documents often suffers from noise such as spurious nodes and edges, and their discontinuity. 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
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 600.056; 600.061; 600.077			Approved	no
	Call Number	Admin @ si @ BDJ2014			Serial	2699
Permanent link to this record



	Author	Marçal Rusiñol; Dimosthenis Karatzas; Josep Llados
	Title	Spotting Graphical Symbols in Camera-Acquired Documents in Real Time			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	3-10
	Keywords
	Abstract	In this paper we present a system devoted to spot graphical symbols in camera-acquired document images. The system is based on the extraction and further matching of ORB compact local features computed over interest key-points. Then, the FLANN indexing framework based on approximate nearest neighbor search allows to efficiently match local descriptors between the captured scene and the graphical models. Finally, the RANSAC algorithm is used in order to compute the homography between the spotted symbol and its appearance in the document image. The proposed approach is efficient and is able to work in real time.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 600.055; 600.061; 600.077			Approved	no
	Call Number	Admin @ si @ RKL2014			Serial	2700
Permanent link to this record