| Home | [131–140] << 141 142 143 144 145 146 147 148 149 150 >> [151–160] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Agata Lapedriza; David Masip; David Sanchez | ||||
| Title | Emotions Classification using Facial Action Units Recognition | Type | Conference Article | ||
| Year | 2014 | Publication | 17th International Conference of the Catalan Association for Artificial Intelligence | Abbreviated Journal | |
| Volume | 269 | Issue | Pages | 55-64 | |
| Keywords | |||||
Abstract  |
In this work we build a system for automatic emotion classification from image sequences. We analyze subtle changes in facial expressions by detecting a subset of 12 representative facial action units (AUs). Then, we classify emotions based on the output of these AUs classifiers, i.e. the presence/absence of AUs. We base the AUs classification upon a set of spatio-temporal geometric and appearance features for facial representation, fusing them within the emotion classifier. A decision tree is trained for emotion classifying, making the resulting model easy to interpret by capturing the combination of AUs activation that lead to a particular emotion. For Cohn-Kanade database, the proposed system classifies 7 emotions with a mean accuracy of near 90%, attaining a similar recognition accuracy in comparison with non-interpretable models that are not based in AUs detection. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-61499-451-0 | Medium | ||
| Area | Expedition | Conference | CCIA | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ LMS2014 | Serial | 2622 | ||
| Permanent link to this record | |||||
| Author | Lorenzo Porzi; Markus Hofinger; Idoia Ruiz; Joan Serrat; Samuel Rota Bulo; Peter Kontschieder | ||||
| Title | Learning Multi-Object Tracking and Segmentation from Automatic Annotations | Type | Conference Article | ||
| Year | 2020 | Publication | 33rd IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 6845-6854 | ||
| Keywords | |||||
| Abstract |
In this work we contribute a novel pipeline to automatically generate training data, and to improve over state-of-the-art multi-object tracking and segmentation (MOTS) methods. Our proposed track mining algorithm turns raw street-level videos into high-fidelity MOTS training data, is scalable and overcomes the need of expensive and time-consuming manual annotation approaches. We leverage state-of-the-art instance segmentation results in combination with optical flow predictions, also trained on automatically harvested training data. Our second major contribution is MOTSNet – a deep learning, tracking-by-detection architecture for MOTS – deploying a novel mask-pooling layer for improved object association over time. Training MOTSNet with our automatically extracted data leads to significantly improved sMOTSA scores on the novel KITTI MOTS dataset (+1.9%/+7.5% on cars/pedestrians), and MOTSNet improves by +4.1% over previously best methods on the MOTSChallenge dataset. Our most impressive finding is that we can improve over previous best-performing works, even in complete absence of manually annotated MOTS training data. | ||||
| Address | virtual; June 2020 | ||||
| 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 | CVPR | ||
| Notes | ADAS; 600.124; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ PHR2020 | Serial | 3402 | ||
| Permanent link to this record | |||||
| Author | Sounak Dey; Anjan Dutta; Suman Ghosh; Ernest Valveny; Josep Llados; Umapada Pal | ||||
| Title | Learning Cross-Modal Deep Embeddings for Multi-Object Image Retrieval using Text and Sketch | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 916 - 921 | ||
| Keywords | |||||
| Abstract |
In this work we introduce a cross modal image retrieval system that allows both text and sketch as input modalities for the query. A cross-modal deep network architecture is formulated to jointly model the sketch and text input modalities as well as the the image output modality, learning a common embedding between text and images and between sketches and images. In addition, an attention model is used to selectively focus the attention on the different objects of the image, allowing for retrieval with multiple objects in the query. Experiments show that the proposed method performs the best in both single and multiple object image retrieval in standard datasets. | ||||
| Address | Beijing; China; August 2018 | ||||
| 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 | ICPR | ||
| Notes | DAG; 602.167; 602.168; 600.097; 600.084; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ DDG2018b | Serial | 3152 | ||
| Permanent link to this record | |||||
| Author | Frederic Sampedro; Sergio Escalera; Anna Domenech; Ignasi Carrio | ||||
| Title | A computational framework for cancer response assessment based on oncological PET-CT scans | Type | Journal Article | ||
| Year | 2014 | Publication | Computers in Biology and Medicine | Abbreviated Journal | CBM |
| Volume | 55 | Issue | Pages | 92–99 | |
| Keywords | Computer aided diagnosis; Nuclear medicine; Machine learning; Image processing; Quantitative analysis | ||||
| Abstract |
In this work we present a comprehensive computational framework to help in the clinical assessment of cancer response from a pair of time consecutive oncological PET-CT scans. In this scenario, the design and implementation of a supervised machine learning system to predict and quantify cancer progression or response conditions by introducing a novel feature set that models the underlying clinical context is described. Performance results in 100 clinical cases (corresponding to 200 whole body PET-CT scans) in comparing expert-based visual analysis and classifier decision making show up to 70% accuracy within a completely automatic pipeline and 90% accuracy when providing the system with expert-guided PET tumor segmentation masks. | ||||
| 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;MILAB | Approved | no | ||
| Call Number | Admin @ si @ SED2014 | Serial | 2606 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; R.Manmatha; Josep Llados; Alicia Fornes | ||||
| Title | Sequential Word Spotting in Historical Handwritten Documents | Type | Conference Article | ||
| Year | 2014 | Publication | 11th IAPR International Workshop on Document Analysis and Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 101 - 105 | ||
| Keywords | |||||
| Abstract |
In this work we present a handwritten word spotting approach that takes advantage of the a priori known order of appearance of the query words. Given an ordered sequence of query word instances, the proposed approach performs a
sequence alignment with the words in the target collection. Although the alignment is quite sparse, i.e. the number of words in the database is higher than the query set, the improvement in the overall performance is sensitively higher than isolated word spotting. As application dataset, we use a collection of handwritten marriage licenses taking advantage of the ordered index pages of family names. |
||||
| Address | Tours; Francia; April 2014 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-4799-3243-6 | Medium | ||
| Area | Expedition | Conference | DAS | ||
| Notes | DAG; 600.061; 600.056; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FML2014 | Serial | 2462 | ||
| Permanent link to this record | |||||
| Author | Daniel Hernandez; Lukas Schneider; Antonio Espinosa; David Vazquez; Antonio Lopez; Uwe Franke; Marc Pollefeys; Juan C. Moure | ||||
| Title | Slanted Stixels: Representing San Francisco's Steepest Streets} | Type | Conference Article | ||
| Year | 2017 | Publication | 28th British Machine Vision Conference | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
In this work we present a novel compact scene representation based on Stixels that infers geometric and semantic information. Our approach overcomes the previous rather restrictive geometric assumptions for Stixels by introducing a novel depth model to account for non-flat roads and slanted objects. Both semantic and depth cues are used jointly to infer the scene representation in a sound global energy minimization formulation. Furthermore, a novel approximation scheme is introduced that uses an extremely efficient over-segmentation. In doing so, the computational complexity of the Stixel inference algorithm is reduced significantly, achieving real-time computation capabilities with only a slight drop in accuracy. We evaluate the proposed approach in terms of semantic and geometric accuracy as well as run-time on four publicly available benchmark datasets. Our approach maintains accuracy on flat road scene datasets while improving substantially on a novel non-flat road dataset. | ||||
| Address | London; uk; September 2017 | ||||
| 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 | BMVC | ||
| Notes | ADAS; 600.118 | Approved | no | ||
| Call Number | ADAS @ adas @ HSE2017a | Serial | 2945 | ||
| Permanent link to this record | |||||
| Author | Jaime Moreno; Xavier Otazu | ||||
| Title | Image compression algorithm based on Hilbert scanning of embedded quadTrees: an introduction of the Hi-SET coder | Type | Conference Article | ||
| Year | 2011 | Publication | IEEE International Conference on Multimedia and Expo | Abbreviated Journal | |
| Volume | Issue | Pages | 1-6 | ||
| Keywords | |||||
| Abstract |
In this work we present an effective and computationally simple algorithm for image compression based on Hilbert Scanning of Embedded quadTrees (Hi-SET). It allows to represent an image as an embedded bitstream along a fractal function. Embedding is an important feature of modern image compression algorithms, in this way Salomon in [1, pg. 614] cite that another feature and perhaps a unique one is the fact of achieving the best quality for the number of bits input by the decoder at any point during the decoding. Hi-SET possesses also this latter feature. Furthermore, the coder is based on a quadtree partition strategy, that applied to image transformation structures such as discrete cosine or wavelet transform allows to obtain an energy clustering both in frequency and space. The coding algorithm is composed of three general steps, using just a list of significant pixels. The implementation of the proposed coder is developed for gray-scale and color image compression. Hi-SET compressed images are, on average, 6.20dB better than the ones obtained by other compression techniques based on the Hilbert scanning. Moreover, Hi-SET improves the image quality in 1.39dB and 1.00dB in gray-scale and color compression, respectively, when compared with JPEG2000 coder. | ||||
| 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 | 1945-7871 | ISBN | 978-1-61284-348-3 | Medium | |
| Area | Expedition | Conference | ICME | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ MoO2011a | Serial | 2176 | ||
| Permanent link to this record | |||||
| Author | Jaime Moreno; Xavier Otazu | ||||
| Title | Image coder based on Hilbert scanning of embedded quadTrees | Type | Conference Article | ||
| Year | 2011 | Publication | Data Compression Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 470-470 | ||
| Keywords | |||||
| Abstract |
In this work we present an effective and computationally simple algorithm for image compression based on Hilbert Scanning of Embedded quadTrees (Hi-SET). It allows to represent an image as an embedded bitstream along a fractal function. Embedding is an important feature of modern image compression algorithms, in this way Salomon in [1, pg. 614] cite that another feature and perhaps a unique one is the fact of achieving the best quality for the number of bits input by the decoder at any point during the decoding. Hi-SET possesses also this latter feature. Furthermore, the coder is based on a quadtree partition strategy, that applied to image transformation structures such as discrete cosine or wavelet transform allows to obtain an energy clustering both in frequency and space. The coding algorithm is composed of three general steps, using just a list of significant pixels. | ||||
| 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 | DCC | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ MoO2011b | Serial | 2177 | ||
| Permanent link to this record | |||||
| Author | Frederic Sampedro; Sergio Escalera; Anna Puig | ||||
| Title | Iterative Multiclass Multiscale Stacked Sequential Learning: definition and application to medical volume segmentation | Type | Journal Article | ||
| Year | 2014 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 46 | Issue | Pages | 1-10 | |
| Keywords | Machine learning; Sequential learning; Multi-class problems; Contextual learning; Medical volume segmentation | ||||
| Abstract |
In this work we present the iterative multi-class multi-scale stacked sequential learning framework (IMMSSL), a novel learning scheme that is particularly suited for medical volume segmentation applications. This model exploits the inherent voxel contextual information of the structures of interest in order to improve its segmentation performance results. Without any feature set or learning algorithm prior assumption, the proposed scheme directly seeks to learn the contextual properties of a region from the predicted classifications of previous classifiers within an iterative scheme. Performance results regarding segmentation accuracy in three two-class and multi-class medical volume datasets show a significant improvement with respect to state of the art alternatives. Due to its easiness of implementation and its independence of feature space and learning algorithm, the presented machine learning framework could be taken into consideration as a first choice in complex volume segmentation scenarios. | ||||
| 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;MILAB | Approved | no | ||
| Call Number | Admin @ si @ SEP2014 | Serial | 2550 | ||
| Permanent link to this record | |||||
| Author | Raul Gomez; Jaume Gibert; Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | Exploring Hate Speech Detection in Multimodal Publications | Type | Conference Article | ||
| Year | 2020 | Publication | IEEE Winter Conference on Applications of Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
In this work we target the problem of hate speech detection in multimodal publications formed by a text and an image. We gather and annotate a large scale dataset from Twitter, MMHS150K, and propose different models that jointly analyze textual and visual information for hate speech detection, comparing them with unimodal detection. We provide quantitative and qualitative results and analyze the challenges of the proposed task. We find that, even though images are useful for the hate speech detection task, current multimodal models cannot outperform models analyzing only text. We discuss why and open the field and the dataset for further research. | ||||
| Address | Aspen; March 2020 | ||||
| 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 | WACV | ||
| Notes | DAG; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ GGG2020a | Serial | 3280 | ||
| 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 | Pierluigi Casale; Oriol Pujol; Petia Radeva | ||||
| Title | Approximate polytope ensemble for one-class classification | Type | Journal Article | ||
| Year | 2014 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 47 | Issue | 2 | Pages | 854-864 |
| Keywords | One-class classification; Convex hull; High-dimensionality; Random projections; Ensemble learning | ||||
| Abstract |
In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, the decision whether a point belongs to the convex hull model in high dimensional spaces is approximated by means of random projections and an ensemble decision process. Finally, a tiling strategy is proposed in order to model non-convex structures. Experimental results show that the proposed strategy is significantly better than state of the art one-class classification methods on over 200 datasets. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ CPR2014a | Serial | 2469 | ||
| Permanent link to this record | |||||
| Author | Ferran Diego; Daniel Ponsa; Joan Serrat; Antonio Lopez | ||||
| Title | Video Alignment for Change Detection | Type | Journal Article | ||
| Year | 2011 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 20 | Issue | 7 | Pages | 1858-1869 |
| Keywords | video alignment | ||||
| Abstract |
In this work, we address the problem of aligning two video sequences. Such alignment refers to synchronization, i.e., the establishment of temporal correspondence between frames of the first and second video, followed by spatial registration of all the temporally corresponding frames. Video synchronization and alignment have been attempted before, but most often in the relatively simple cases of fixed or rigidly attached cameras and simultaneous acquisition. In addition, restrictive assumptions have been applied, including linear time correspondence or the knowledge of the complete trajectories of corresponding scene points; to some extent, these assumptions limit the practical applicability of any solutions developed. We intend to solve the more general problem of aligning video sequences recorded by independently moving cameras that follow similar trajectories, based only on the fusion of image intensity and GPS information. The novelty of our approach is to pose the synchronization as a MAP inference problem on a Bayesian network including the observations from these two sensor types, which have been proved complementary. Alignment results are presented in the context of videos recorded from vehicles driving along the same track at different times, for different road types. In addition, we explore two applications of the proposed video alignment method, both based on change detection between aligned videos. One is the detection of vehicles, which could be of use in ADAS. The other is online difference spotting videos of surveillance rounds. | ||||
| 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; IF | Approved | no | ||
| Call Number | DPS 2011; ADAS @ adas @ dps2011 | Serial | 1705 | ||
| Permanent link to this record | |||||
| Author | Fernando Vilariño; Panagiota Spyridonos; Jordi Vitria; Fernando Azpiroz; Petia Radeva | ||||
| Title | Cascade analysis for intestinal contraction detection | Type | Conference Article | ||
| Year | 2006 | Publication | 20th International Congress and exhibition Computer Assisted Radiology and Surgery | Abbreviated Journal | |
| Volume | Issue | Pages | 9-10 | ||
| Keywords | intestine video analysis, anisotropic features, support vector machine, cascade of classifiers | ||||
| Abstract |
In this work, we address the study of intestinal contractions in a novel approach based on a machine learning framework to process data from Wireless Capsule Video Endoscopy. Wireless endoscopy represents a unique way to visualize the intestine motility by creating long videos to visualize intestine dynamics. In this paper we argue that to analyze huge amount of wireless endoscopy data and define robust methods for contraction detection we should base our approach on sophisticated machine learning techniques. In particular, we propose a cascade of classifiers in order to remove different physiological phenomenon and obtain the motility pattern of small intestines. Our results show obtaining high specificity and sensitivity rates that highlight the high efficiency of the selected approach and support the feasibility of the proposed methodology in the automatic detection and analysis of intestine contractions. | ||||
| Address | Osaka (Japan) | ||||
| 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 | 800 | Expedition | Conference | CARS | |
| Notes | MV;OR;MILAB;SIAI | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ VSV2006a; IAM @ iam @ VSV2006h | Serial | 726 | ||
| Permanent link to this record | |||||
| Author | Andres Mafla; Ruben Tito; Sounak Dey; Lluis Gomez; Marçal Rusiñol; Ernest Valveny; Dimosthenis Karatzas | ||||
| Title | Real-time Lexicon-free Scene Text Retrieval | Type | Journal Article | ||
| Year | 2021 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 110 | Issue | Pages | 107656 | |
| Keywords | |||||
| Abstract |
In this work, we address the task of scene text retrieval: given a text query, the system returns all images containing the queried text. The proposed model uses a single shot CNN architecture that predicts bounding boxes and builds a compact representation of spotted words. In this way, this problem can be modeled as a nearest neighbor search of the textual representation of a query over the outputs of the CNN collected from the totality of an image database. Our experiments demonstrate that the proposed model outperforms previous state-of-the-art, while offering a significant increase in processing speed and unmatched expressiveness with samples never seen at training time. Several experiments to assess the generalization capability of the model are conducted in a multilingual dataset, as well as an application of real-time text spotting in videos. | ||||
| 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.121; 600.129; 601.338 | Approved | no | ||
| Call Number | Admin @ si @ MTD2021 | Serial | 3493 | ||
| Permanent link to this record | |||||