Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

<< 1 2 3 4 5 6 7 8 9 10 >> [11–11]

List View

Citations

Details

	Records
	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Vocabulary Selection for Graph of Words Embedding			Type	Conference Article
	Year	2011	Publication	5th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	6669	Issue		Pages	216-223
	Keywords
	Abstract	The Graph of Words Embedding consists in mapping every graph in a given dataset to a feature vector by counting unary and binary relations between node attributes of the graph. It has been shown to perform well for graphs with discrete label alphabets. In this paper we extend the methodology to graphs with n-dimensional continuous attributes by selecting node representatives. We propose three different discretization procedures for the attribute space and experimentally evaluate the dependence on both the selector and the number of node representatives. In the context of graph classification, the experimental results reveal that on two out of three public databases the proposed extension achieves superior performance over a standard reference system.
	Address	Las Palmas de Gran Canaria. Spain
	Corporate Author				Thesis
	Publisher	Springer	Place of Publication	Berlin	Editor	Vitria, Jordi; Sanches, João Miguel Raposo; Hernández, Mario
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-21256-7	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2011b			Serial	1744
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Dimensionality Reduction for Graph of Words Embedding			Type	Conference Article
	Year	2011	Publication	8th IAPR-TC-15 International Workshop. Graph-Based Representations in Pattern Recognition	Abbreviated Journal
	Volume	6658	Issue		Pages	22-31
	Keywords
	Abstract	The Graph of Words Embedding consists in mapping every graph of a given dataset to a feature vector by counting unary and binary relations between node attributes of the graph. While it shows good properties in classification problems, it suffers from high dimensionality and sparsity. These two issues are addressed in this article. Two well-known techniques for dimensionality reduction, kernel principal component analysis (kPCA) and independent component analysis (ICA), are applied to the embedded graphs. We discuss their performance compared to the classification of the original vectors on three different public databases of graphs.
	Address	Münster, Germany
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Xiaoyi Jiang; Miquel Ferrer; Andrea Torsello
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-20843-0	Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2011a			Serial	1743
Permanent link to this record



	Author	Naveen Onkarappa; Angel Sappa
	Title	Space Variant Representations for Mobile Platform Vision Applications			Type	Conference Article
	Year	2011	Publication	14th International Conference on Computer Analysis of Images and Patterns	Abbreviated Journal
	Volume	6855	Issue	II	Pages	146-154
	Keywords
	Abstract	The log-polar space variant representation, motivated by biological vision, has been widely studied in the literature. Its data reduction and invariance properties made it useful in many vision applications. However, due to its nature, it fails in preserving features in the periphery. In the current work, as an attempt to overcome this problem, we propose a novel space-variant representation. It is evaluated and proved to be better than the log-polar representation in preserving the peripheral information, crucial for on-board mobile vision applications. The evaluation is performed by comparing log-polar and the proposed representation once they are used for estimating dense optical flow.
	Address	Seville, Spain
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	P. Real, D. Diaz, H. Molina, A. Berciano, W. Kropatsch
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-23677-8	Medium
	Area		Expedition		Conference	CAIP
	Notes	ADAS			Approved	no
	Call Number	NaS2011; ADAS @ adas @			Serial	1686
Permanent link to this record



	Author	Pierluigi Casale
	Title	Approximate Ensemble Methods for Physical Activity Recognition Applications			Type	Book Whole
	Year	2011	Publication	PhD Thesis, Universitat de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	The main interest of this thesis focuses on computational methodologies able to reduce the degree of complexity of learning algorithms and its application to physical activity recognition. Random Projections will be used to reduce the computational complexity in Multiple Classifier Systems. A new boosting algorithm and a new one-class classification methodology have been developed. In both cases, random projections are used for reducing the dimensionality of the problem and for generating diversity, exploiting in this way the benefits that ensembles of classifiers provide in terms of performances and stability. Moreover, the new one-class classification methodology, based on an ensemble strategy able to approximate a multidimensional convex-hull, has been proved to over-perform state-of-the-art one-class classification methodologies. The practical focus of the thesis is towards Physical Activity Recognition. A new hardware platform for wearable computing application has been developed and used for collecting data of activities of daily living allowing to study the optimal features set able to successful classify activities. Based on the classification methodologies developed and the study conducted on physical activity classification, a machine learning architecture capable to provide a continuous authentication mechanism for mobile-devices users has been worked out, as last part of the thesis. The system, based on a personalized classifier, states on the analysis of the characteristic gait patterns typical of each individual ensuring an unobtrusive and continuous authentication mechanism
	Address
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Oriol Pujol;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 @ Cas2011			Serial	1837
Permanent link to this record



	Author	Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; I. Bardaji; Horst Bunke
	Title	A Generic Framework for Median Graph Computation based on a Recursive Embedding Approach			Type	Journal Article
	Year	2011	Publication	Computer Vision and Image Understanding	Abbreviated Journal	CVIU
	Volume	115	Issue	7	Pages	919-928
	Keywords	Median Graph, Graph Embedding, Graph Matching, Structural Pattern Recognition
	Abstract	The median graph has been shown to be a good choice to obtain a represen- tative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of this paper is the generalization of this previ- ous method, proposing a generic recursive procedure that permits to recover the graph corresponding to a point in the vector space, introducing only the amount of approximation inherent to the use of graph matching algorithms. In order to evaluate the proposed method, we compare it with the set me- dian and with the other state-of-the-art embedding-based methods for the median graph computation. The experiments are carried out using four dif- ferent databases (one semi-artificial and three containing real-world data). Results show that with the proposed approach we can obtain better medi- ans, in terms of the sum of distances to the training graphs, than with the previous existing 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		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	IAM @ iam @ FKV2011			Serial	1831
Permanent link to this record



	Author	Maria Vanrell; Naila Murray; Robert Benavente; C. Alejandro Parraga; Xavier Otazu; Ramon Baldrich
	Title	Perception Based Representations for Computational Colour			Type	Conference Article
	Year	2011	Publication	3rd International Workshop on Computational Color Imaging	Abbreviated Journal
	Volume	6626	Issue		Pages	16-30
	Keywords	colour perception, induction, naming, psychophysical data, saliency, segmentation
	Abstract	The perceived colour of a stimulus is dependent on multiple factors stemming out either from the context of the stimulus or idiosyncrasies of the observer. The complexity involved in combining these multiple effects is the main reason for the gap between classical calibrated colour spaces from colour science and colour representations used in computer vision, where colour is just one more visual cue immersed in a digital image where surfaces, shadows and illuminants interact seemingly out of control. With the aim to advance a few steps towards bridging this gap we present some results on computational representations of colour for computer vision. They have been developed by introducing perceptual considerations derived from the interaction of the colour of a point with its context. We show some techniques to represent the colour of a point influenced by assimilation and contrast effects due to the image surround and we show some results on how colour saliency can be derived in real images. We outline a model for automatic assignment of colour names to image points directly trained on psychophysical data. We show how colour segments can be perceptually grouped in the image by imposing shading coherence in the colour space.
	Address	Milan, Italy
	Corporate Author				Thesis
	Publisher	Springer-Verlag	Place of Publication		Editor	Raimondo Schettini, Shoji Tominaga, Alain Trémeau
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-20403-6	Medium
	Area		Expedition		Conference	CCIW
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ VMB2011			Serial	1733
Permanent link to this record



	Author	Olivier Penacchio; C. Alejandro Parraga
	Title	What is the best criterion for an efficient design of retinal photoreceptor mosaics?			Type	Journal Article
	Year	2011	Publication	Perception	Abbreviated Journal	PER
	Volume	40	Issue		Pages	197
	Keywords
	Abstract	The proportions of L, M and S photoreceptors in the primate retina are arguably determined by evolutionary pressure and the statistics of the visual environment. Two information theory-based approaches have been recently proposed for explaining the asymmetrical spatial densities of photoreceptors in humans. In the first approach Garrigan et al (2010 PLoS ONE 6 e1000677), a model for computing the information transmitted by cone arrays which considers the differential blurring produced by the long-wavelength accommodation of the eye’s lens is proposed. Their results explain the sparsity of S-cones but the optimum depends weakly on the L:M cone ratio. In the second approach (Penacchio et al, 2010 Perception 39 ECVP Supplement, 101), we show that human cone arrays make the visual representation scale-invariant, allowing the total entropy of the signal to be preserved while decreasing individual neurons’ entropy in further retinotopic representations. This criterion provides a thorough description of the distribution of L:M cone ratios and does not depend on differential blurring of the signal by the lens. Here, we investigate the similarities and differences of both approaches when applied to the same database. Our results support a 2-criteria optimization in the space of cone ratios whose components are arguably important and mostly unrelated. [This work was partially funded by projects TIN2010-21771-C02-1 and Consolider-Ingenio 2010-CSD2007-00018 from the Spanish MICINN. CAP was funded by grant RYC-2007-00484]
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ PeP2011a			Serial	1719
Permanent link to this record



	Author	Antonio Hernandez; Carlo Gatta; Sergio Escalera; Laura Igual; Victoria Martin Yuste; Petia Radeva
	Title	Accurate and Robust Fully-Automatic QCA: Method and Numerical Validation			Type	Conference Article
	Year	2011	Publication	14th International Conference on Medical Image Computing and Computer Assisted Intervention	Abbreviated Journal
	Volume	14	Issue	3	Pages	496-503
	Keywords
	Abstract	The Quantitative Coronary Angiography (QCA) is a methodology used to evaluate the arterial diseases and, in particular, the degree of stenosis. In this paper we propose AQCA, a fully automatic method for vessel segmentation based on graph cut theory. Vesselness, geodesic paths and a new multi-scale edgeness map are used to compute a globally optimal artery segmentation. We evaluate the method performance in a rigorous numerical way on two datasets. The method can detect an artery with precision 92.9 +/- 5% and sensitivity 94.2 +/- 6%. The average absolute distance error between detected and ground truth centerline is 1.13 +/- 0.11 pixels (about 0.27 +/- 0.025 mm) and the absolute relative error in the vessel caliber estimation is 2.93% with almost no bias. Moreover, the method can discriminate between arteries and catheter with an accuracy of 96.4%.
	Address	Toronto, Canada
	Corporate Author				Thesis
	Publisher	Springer	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-23625-9	Medium
	Area		Expedition		Conference	MICCAI
	Notes	MILAB;HuPBA			Approved	no
	Call Number	Admin @ si @ HGE2011			Serial	1769
Permanent link to this record



	Author	Eduard Vazquez; Ramon Baldrich; Joost Van de Weijer; Maria Vanrell
	Title	Describing Reflectances for Colour Segmentation Robust to Shadows, Highlights and Textures			Type	Journal Article
	Year	2011	Publication	IEEE Transactions on Pattern Analysis and Machine Intelligence	Abbreviated Journal	TPAMI
	Volume	33	Issue	5	Pages	917-930
	Keywords
	Abstract	The segmentation of a single material reflectance is a challenging problem due to the considerable variation in image measurements caused by the geometry of the object, shadows, and specularities. The combination of these effects has been modeled by the dichromatic reflection model. However, the application of the model to real-world images is limited due to unknown acquisition parameters and compression artifacts. In this paper, we present a robust model for the shape of a single material reflectance in histogram space. The method is based on a multilocal creaseness analysis of the histogram which results in a set of ridges representing the material reflectances. The segmentation method derived from these ridges is robust to both shadow, shading and specularities, and texture in real-world images. We further complete the method by incorporating prior knowledge from image statistics, and incorporate spatial coherence by using multiscale color contrast information. Results obtained show that our method clearly outperforms state-of-the-art segmentation methods on a widely used segmentation benchmark, having as a main characteristic its excellent performance in the presence of shadows and highlights at low computational cost.
	Address	Los Alamitos; CA; USA;
	Corporate Author				Thesis
	Publisher	IEEE Computer Society	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0162-8828	ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ VBW2011			Serial	1715
Permanent link to this record



	Author	Jordi Roca; C. Alejandro Parraga; Maria Vanrell
	Title	Categorical Focal Colours are Structurally Invariant Under Illuminant Changes			Type	Conference Article
	Year	2011	Publication	European Conference on Visual Perception	Abbreviated Journal
	Volume		Issue		Pages	196
	Keywords
	Abstract	The visual system perceives the colour of surfaces approximately constant under changes of illumination. In this work, we investigate how stable is the perception of categorical \“focal\” colours and their interrelations with varying illuminants and simple chromatic backgrounds. It has been proposed that best examples of colour categories across languages cluster in small regions of the colour space and are restricted to a set of 11 basic terms (Kay and Regier, 2003 Proceedings of the National Academy of Sciences of the USA 100 9085\–9089). Following this, we developed a psychophysical paradigm that exploits the ability of subjects to reliably reproduce the most representative examples of each category, adjusting multiple test patches embedded in a coloured Mondrian. The experiment was run on a CRT monitor (inside a dark room) under various simulated illuminants. We modelled the recorded data for each subject and adapted state as a 3D interconnected structure (graph) in Lab space. The graph nodes were the subject\’s focal colours at each adaptation state. The model allowed us to get a better distance measure between focal structures under different illuminants. We found that perceptual focal structures tend to be preserved better than the structures of the physical \“ideal\” colours under illuminant changes.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title	Perception 40	Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	ECVP
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ RPV2011			Serial	1867
Permanent link to this record



	Author	David Fernandez; Josep Llados; Alicia Fornes
	Title	Handwritten Word Spotting in Old Manuscript Images Using a Pseudo-Structural Descriptor Organized in a Hash Structure			Type	Conference Article
	Year	2011	Publication	5th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	6669	Issue		Pages	628-635
	Keywords
	Abstract	There are lots of historical handwritten documents with information that can be used for several studies and projects. The Document Image Analysis and Recognition community is interested in preserving these documents and extracting all the valuable information from them. Handwritten word-spotting is the pattern classification task which consists in detecting handwriting word images. In this work, we have used a query-by-example formalism: we have matched an input image with one or multiple images from handwritten documents to determine the distance that might indicate a correspondence. We have developed an approach based in characteristic Loci Features stored in a hash structure. Document images of the marriage licences of the Cathedral of Barcelona are used as the benchmarking database.
	Address	Las Palmas de Gran Canaria. Spain
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Jordi Vitria; Joao Miguel Raposo; Mario Hernandez
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-21256-7	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ FLF2011			Serial	1742
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	Fadi Dornaika; Bogdan Raducanu
	Title	Subtle Facial Expression Recognition in Still Images and Videos			Type	Book Chapter
	Year	2011	Publication	Advances in Face Image Analysis: Techniques and Technologies	Abbreviated Journal
	Volume		Issue	14	Pages	259-277
	Keywords
	Abstract	This chapter addresses the recognition of basic facial expressions. It has three main contributions. First, the authors introduce a view- and texture independent schemes that exploits facial action parameters estimated by an appearance-based 3D face tracker. they represent the learned facial actions associated with different facial expressions by time series. Two dynamic recognition schemes are proposed: (1) the first is based on conditional predictive models and on an analysis-synthesis scheme, and (2) the second is based on examples allowing straightforward use of machine learning approaches. Second, the authors propose an efficient recognition scheme based on the detection of keyframes in videos. Third, the authors compare the dynamic scheme with a static one based on analyzing individual snapshots and show that in general the former performs better than the latter. The authors then provide evaluations of performance using Linear Discriminant Analysis (LDA), Non parametric Discriminant Analysis (NDA), and Support Vector Machines (SVM).
	Address
	Corporate Author				Thesis
	Publisher	IGI-Global	Place of Publication	New York, USA	Editor	Yu-Jin Zhang
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-1-6152-0991-0	Medium
	Area		Expedition		Conference
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ DoR2011			Serial	1751
Permanent link to this record



	Author	Partha Pratim Roy; Umapada Pal; Josep Llados
	Title	Document Seal Detection Using Ght and Character Proximity Graphs			Type	Journal Article
	Year	2011	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	44	Issue	6	Pages	1282-1295
	Keywords	Seal recognition; Graphical symbol spotting; Generalized Hough transform; Multi-oriented character recognition
	Abstract	This paper deals with automatic detection of seal (stamp) from documents with cluttered background. Seal detection involves a difficult challenge due to its multi-oriented nature, arbitrary shape, overlapping of its part with signature, noise, etc. Here, a seal object is characterized by scale and rotation invariant spatial feature descriptors computed from recognition result of individual connected components (characters). Scale and rotation invariant features are used in a Support Vector Machine (SVM) classifier to recognize multi-scale and multi-oriented text characters. The concept of generalized Hough transform (GHT) is used to detect the seal and a voting scheme is designed for finding possible location of the seal in a document based on the spatial feature descriptor of neighboring component pairs. The peak of votes in GHT accumulator validates the hypothesis to locate the seal in a document. Experiment is performed in an archive of historical documents of handwritten/printed English text. Experimental results show that the method is robust in locating seal instances of arbitrary shape and orientation in documents, and also efficient in indexing a collection of documents for retrieval purposes.
	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		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ RPL2011			Serial	1820
Permanent link to this record



	Author	Ariel Amato; Mikhail Mozerov; Andrew Bagdanov; Jordi Gonzalez
	Title	Accurate Moving Cast Shadow Suppression Based on Local Color Constancy detection			Type	Journal Article
	Year	2011	Publication	IEEE Transactions on Image Processing	Abbreviated Journal	TIP
	Volume	20	Issue	10	Pages	2954 - 2966
	Keywords
	Abstract	This paper describes a novel framework for detection and suppression of properly shadowed regions for most possible scenarios occurring in real video sequences. Our approach requires no prior knowledge about the scene, nor is it restricted to specific scene structures. Furthermore, the technique can detect both achromatic and chromatic shadows even in the presence of camouflage that occurs when foreground regions are very similar in color to shadowed regions. The method exploits local color constancy properties due to reflectance suppression over shadowed regions. To detect shadowed regions in a scene, the values of the background image are divided by values of the current frame in the RGB color space. We show how this luminance ratio can be used to identify segments with low gradient constancy, which in turn distinguish shadows from foreground. Experimental results on a collection of publicly available datasets illustrate the superior performance of our method compared with the most sophisticated, state-of-the-art shadow detection algorithms. These results show that our approach is robust and accurate over a broad range of shadow types and challenging video conditions.
	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	ISE			Approved	no
	Call Number	Admin @ si @ AMB2011			Serial	1716
Permanent link to this record