| Home | [191–200] << 201 202 203 204 205 206 207 208 209 210 >> [211–220] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Monica Piñol; Angel Sappa; Ricardo Toledo | ||||
| Title | MultiTable Reinforcement for Visual Object Recognition | Type | Conference Article | ||
| Year | 2012 | Publication | 4th International Conference on Signal and Image Processing | Abbreviated Journal | |
| Volume | 221 | Issue | Pages | 469-480 | |
| Keywords | |||||
Abstract  |
This paper presents a bag of feature based method for visual object recognition. Our contribution is focussed on the selection of the best feature descriptor. It is implemented by using a novel multi-table reinforcement learning method that selects among five of classical descriptors (i.e., Spin, SIFT, SURF, C-SIFT and PHOW) the one that best describes each image. Experimental results and comparisons are provided showing the improvements achieved with the proposed approach. | ||||
| Address | Coimbatore, India | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer India | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1876-1100 | ISBN | 978-81-322-0996-6 | Medium | |
| Area | Expedition | Conference | ICSIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ PST2012 | Serial | 2157 | ||
| Permanent link to this record | |||||
| Author | P. Ricaurte; C. Chilan; Cristhian A. Aguilera-Carrasco; Boris X. Vintimilla; Angel Sappa | ||||
| Title | Performance Evaluation of Feature Point Descriptors in the Infrared Domain | Type | Conference Article | ||
| Year | 2014 | Publication | 9th International Conference on Computer Vision Theory and Applications | Abbreviated Journal | |
| Volume | 1 | Issue | Pages | 545-550 | |
| Keywords | Infrared Imaging; Feature Point Descriptors | ||||
| Abstract |
This paper presents a comparative evaluation of classical feature point descriptors when they are used in the long-wave infrared spectral band. Robustness to changes in rotation, scaling, blur, and additive noise are evaluated using a state of the art framework. Statistical results using an outdoor image data set are presented together with a discussion about the differences with respect to the results obtained when images from the visible spectrum are considered. | ||||
| Address | Lisboa; Portugal; January 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 | Medium | |||
| Area | Expedition | Conference | VISAPP | ||
| Notes | ADAS; 600.055; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ RCA2014b | Serial | 2476 | ||
| Permanent link to this record | |||||
| Author | Angel Sappa; Rosa Herrero; Fadi Dornaika; David Geronimo; Antonio Lopez | ||||
| Title | Road Approximation in Euclidean and v-Disparity Space: A Comparative Study | Type | Conference Article | ||
| Year | 2007 | Publication | Computer Aided Systems Theory, | Abbreviated Journal | |
| Volume | 4739 | Issue | Pages | 1105–1112 | |
| Keywords | |||||
| Abstract |
This paper presents a comparative study between two road approximation techniques—planar surfaces—from stereo vision data. The first approach is carried out in the v-disparity space and is based on a voting scheme, the Hough transform. The second one consists in computing the best fitting plane for the whole 3D road data points, directly in the Euclidean space, by using least squares fitting. The comparative study is initially performed over a set of different synthetic surfaces
(e.g., plane, quadratic surface, cubic surface) digitized by a virtual stereo head; then real data obtained with a commercial stereo head are used. The comparative study is intended to be used as a criterion for fining the best technique according to the road geometry. Additionally, it highlights common problems driven from a wrong assumption about the scene’s prior knowledge. |
||||
| Address | Las Palmas de Gran Canaria (Spain) | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | EUROCAST | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ SHD2007b | Serial | 917 | ||
| Permanent link to this record | |||||
| Author | Angel Sappa; Rosa Herrero; Fadi Dornaika; David Geronimo; Antonio Lopez | ||||
| Title | Road Approximation in Euclidean and v-Disparity Space: A Comparative Study | Type | Conference Article | ||
| Year | 2007 | Publication | EUROCAST2007, Workshop on Cybercars and Intelligent Vehicles | Abbreviated Journal | |
| Volume | Issue | Pages | 368–369 | ||
| Keywords | |||||
| Abstract |
This paper presents a comparative study between two road approximation techniques—planar surfaces—from stereo vision data. The first approach is carried out in the v-disparity space and is based on a voting scheme, the Hough transform. The second one consists in computing the best fitting plane for the whole 3D road data points, directly in the Euclidean space, by using least squares fitting. The comparative study is initially performed over a set of different synthetic surfaces
(e.g., plane, quadratic surface, cubic surface) digitized by a virtual stereo head; then real data obtained with a commercial stereo head are used. The comparative study is intended to be used as a criterion for fining the best technique according to the road geometry. Additionally, it highlights common problems driven from a wrong assumption about the scene’s prior knowledge. |
||||
| Address | Las Palmas de Gran Canaria (Spain) | ||||
| 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 | ADAS @ adas @ SHD2007a | Serial | 936 | ||
| Permanent link to this record | |||||
| Author | Francesc Net; Marc Folia; Pep Casals; Lluis Gomez | ||||
| Title | Transductive Learning for Near-Duplicate Image Detection in Scanned Photo Collections | Type | Conference Article | ||
| Year | 2023 | Publication | 17th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | 14191 | Issue | Pages | 3-17 | |
| Keywords | Image deduplication; Near-duplicate images detection; Transductive Learning; Photographic Archives; Deep Learning | ||||
| Abstract |
This paper presents a comparative study of near-duplicate image detection techniques in a real-world use case scenario, where a document management company is commissioned to manually annotate a collection of scanned photographs. Detecting duplicate and near-duplicate photographs can reduce the time spent on manual annotation by archivists. This real use case differs from laboratory settings as the deployment dataset is available in advance, allowing the use of transductive learning. We propose a transductive learning approach that leverages state-of-the-art deep learning architectures such as convolutional neural networks (CNNs) and Vision Transformers (ViTs). Our approach involves pre-training a deep neural network on a large dataset and then fine-tuning the network on the unlabeled target collection with self-supervised learning. The results show that the proposed approach outperforms the baseline methods in the task of near-duplicate image detection in the UKBench and an in-house private dataset. | ||||
| Address | San Jose; CA; USA; August 2023 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ NFC2023 | Serial | 3859 | ||
| Permanent link to this record | |||||
| Author | Daniel Ponsa; Antonio Lopez | ||||
| Title | Variance reduction techniques in particle-based visual contour Tracking | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 42 | Issue | 11 | Pages | 2372–2391 |
| Keywords | Contour tracking; Active shape models; Kalman filter; Particle filter; Importance sampling; Unscented particle filter; Rao-Blackwellization; Partitioned sampling | ||||
| Abstract |
This paper presents a comparative study of three different strategies to improve the performance of particle filters, in the context of visual contour tracking: the unscented particle filter, the Rao-Blackwellized particle filter, and the partitioned sampling technique. The tracking problem analyzed is the joint estimation of the global and local transformation of the outline of a given target, represented following the active shape model approach. The main contributions of the paper are the novel adaptations of the considered techniques on this generic problem, and the quantitative assessment of their performance in extensive experimental work done. | ||||
| 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 | ADAS @ adas @ PoL2009a | Serial | 1168 | ||
| Permanent link to this record | |||||
| Author | Henry Velesaca; Patricia Suarez; Dario Carpio; Angel Sappa | ||||
| Title | Synthesized Image Datasets: Towards an Annotation-Free Instance Segmentation Strategy | Type | Conference Article | ||
| Year | 2021 | Publication | 16th International Symposium on Visual Computing | Abbreviated Journal | |
| Volume | 13017 | Issue | Pages | 131–143 | |
| Keywords | |||||
| Abstract |
This paper presents a complete pipeline to perform deep learning-based instance segmentation of different types of grains (e.g., corn, sunflower, soybeans, lentils, chickpeas, mote, and beans). The proposed approach consists of using synthesized image datasets for the training process, which are easily generated according to the category of the instance to be segmented. The synthesized imaging process allows generating a large set of well-annotated grain samples with high variability—as large and high as the user requires. Instance segmentation is performed through a popular deep learning based approach, the Mask R-CNN architecture, but any learning-based instance segmentation approach can be considered. Results obtained by the proposed pipeline show that the strategy of using synthesized image datasets for training instance segmentation helps to avoid the time-consuming image annotation stage, as well as to achieve higher intersection over union and average precision performances. Results obtained with different varieties of grains are shown, as well as comparisons with manually annotated images, showing both the simplicity of the process and the improvements in the performance. | ||||
| Address | Virtual; October 2021 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | ISVC | ||
| Notes | MSIAU | Approved | no | ||
| Call Number | Admin @ si @ VSC2021 | Serial | 3667 | ||
| Permanent link to this record | |||||
| Author | Maria Oliver; G. Haro; Mariella Dimiccoli; B. Mazin; C. Ballester | ||||
| Title | A Computational Model for Amodal Completion | Type | Journal Article | ||
| Year | 2016 | Publication | Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
| Volume | 56 | Issue | 3 | Pages | 511–534 |
| Keywords | Perception; visual completion; disocclusion; Bayesian model;relatability; Euler elastica | ||||
| Abstract |
This paper presents a computational model to recover the most likely interpretation
of the 3D scene structure from a planar image, where some objects may occlude others. The estimated scene interpretation is obtained by integrating some global and local cues and provides both the complete disoccluded objects that form the scene and their ordering according to depth. Our method first computes several distal scenes which are compatible with the proximal planar image. To compute these different hypothesized scenes, we propose a perceptually inspired object disocclusion method, which works by minimizing the Euler's elastica as well as by incorporating the relatability of partially occluded contours and the convexity of the disoccluded objects. Then, to estimate the preferred scene we rely on a Bayesian model and define probabilities taking into account the global complexity of the objects in the hypothesized scenes as well as the effort of bringing these objects in their relative position in the planar image, which is also measured by an Euler's elastica-based quantity. The model is illustrated with numerical experiments on, both, synthetic and real images showing the ability of our model to reconstruct the occluded objects and the preferred perceptual order among them. We also present results on images of the Berkeley dataset with provided figure-ground ground-truth labeling. |
||||
| 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; 601.235 | Approved | no | ||
| Call Number | Admin @ si @ OHD2016b | Serial | 2745 | ||
| Permanent link to this record | |||||
| Author | Maria Oliver; Gloria Haro; Mariella Dimiccoli; Baptiste Mazin; Coloma Ballester | ||||
| Title | A computational model of amodal completion | Type | Conference Article | ||
| Year | 2016 | Publication | SIAM Conference on Imaging Science | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
This paper presents a computational model to recover the most likely interpretation of the 3D scene structure from a planar image, where some objects may occlude others. The estimated scene interpretation is obtained by integrating some global and local cues and provides both the complete disoccluded objects that form the scene and their ordering according to depth. Our method first computes several distal scenes which are compatible with the proximal planar image. To compute these different hypothesized scenes, we propose a perceptually inspired object disocclusion method, which works by minimizing the Euler's elastica as well as by incorporating the relatability of partially occluded contours and the convexity of the disoccluded objects. Then, to estimate the preferred scene we rely on a Bayesian model and define probabilities taking into account the global complexity of the objects in the hypothesized scenes as well as the effort of bringing these objects in their relative position in the planar image, which is also measured by an Euler's elastica-based quantity. The model is illustrated with numerical experiments on, both, synthetic and real images showing the ability of our model to reconstruct the occluded objects and the preferred perceptual order among them. We also present results on images of the Berkeley dataset with provided figure-ground ground-truth labeling. | ||||
| Address | Albuquerque; New Mexico; USA; May 2016 | ||||
| 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 | IS | ||
| Notes | MILAB; 601.235 | Approved | no | ||
| Call Number | Admin @ si @OHD2016a | Serial | 2788 | ||
| Permanent link to this record | |||||
| Author | Fadi Dornaika; Angel Sappa | ||||
| Title | A Featureless and Stochastic Approach to On-board Stereo Vision System Pose | Type | Journal Article | ||
| Year | 2009 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 27 | Issue | 9 | Pages | 1382–1393 |
| Keywords | On-board stereo vision system; Pose estimation; Featureless approach; Particle filtering; Image warping | ||||
| Abstract |
This paper presents a direct and stochastic technique for real-time estimation of on-board stereo head’s position and orientation. Unlike existing works which rely on feature extraction either in the image domain or in 3D space, our proposed approach directly estimates the unknown parameters from the stream of stereo pairs’ brightness. The pose parameters are tracked using the particle filtering framework which implicitly enforces the smoothness constraints on the estimated parameters. The proposed technique can be used with a driver assistance applications as well as with augmented reality applications. Extended experiments on urban environments with different road geometries are presented. Comparisons with a 3D data-based approach are presented. Moreover, we provide a performance study aiming at evaluating the accuracy of the proposed approach. | ||||
| 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 | ADAS @ adas @ DoS2009b | Serial | 1152 | ||
| Permanent link to this record | |||||
| Author | Jorge Charco; Angel Sappa; Boris X. Vintimilla; Henry Velesaca | ||||
| Title | Camera pose estimation in multi-view environments: From virtual scenarios to the real world | Type | Journal Article | ||
| Year | 2021 | Publication | Image and Vision Computing | Abbreviated Journal | IVC |
| Volume | 110 | Issue | Pages | 104182 | |
| Keywords | |||||
| Abstract |
This paper presents a domain adaptation strategy to efficiently train network architectures for estimating the relative camera pose in multi-view scenarios. The network architectures are fed by a pair of simultaneously acquired images, hence in order to improve the accuracy of the solutions, and due to the lack of large datasets with pairs of overlapped images, a domain adaptation strategy is proposed. The domain adaptation strategy consists on transferring the knowledge learned from synthetic images to real-world scenarios. For this, the networks are firstly trained using pairs of synthetic images, which are captured at the same time by a pair of cameras in a virtual environment; and then, the learned weights of the networks are transferred to the real-world case, where the networks are retrained with a few real images. Different virtual 3D scenarios are generated to evaluate the relationship between the accuracy on the result and the similarity between virtual and real scenarios—similarity on both geometry of the objects contained in the scene as well as relative pose between camera and objects in the scene. Experimental results and comparisons are provided showing that the accuracy of all the evaluated networks for estimating the camera pose improves when the proposed domain adaptation strategy is used, highlighting the importance on the similarity between virtual-real 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 | MSIAU; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ CSV2021 | Serial | 3577 | ||
| Permanent link to this record | |||||
| Author | Mohammad Rouhani; Angel Sappa; E. Boyer | ||||
| Title | Implicit B-Spline Surface Reconstruction | Type | Journal Article | ||
| Year | 2015 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 24 | Issue | 1 | Pages | 22 - 32 |
| Keywords | |||||
| Abstract |
This paper presents a fast and flexible curve, and surface reconstruction technique based on implicit B-spline. This representation does not require any parameterization and it is locally supported. This fact has been exploited in this paper to propose a reconstruction technique through solving a sparse system of equations. This method is further accelerated to reduce the dimension to the active control lattice. Moreover, the surface smoothness and user interaction are allowed for controlling the surface. Finally, a novel weighting technique has been introduced in order to blend small patches and smooth them in the overlapping regions. The whole framework is very fast and efficient and can handle large cloud of points with very low computational cost. The experimental results show the flexibility and accuracy of the proposed algorithm to describe objects with complex topologies. Comparisons with other fitting methods highlight the superiority of the proposed approach in the presence of noise and missing data. | ||||
| 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 | ADAS; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ RSB2015 | Serial | 2541 | ||
| Permanent link to this record | |||||
| Author | Francesc Tous; Agnes Borras; Robert Benavente; Ramon Baldrich; Maria Vanrell; Josep Llados | ||||
| Title | Textual Descriptors for browsing people by visual appearence. | Type | Conference Article | ||
| Year | 2002 | Publication | 5è. Congrés Català d’Intel·ligència Artificial CCIA | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Image retrieval, textual descriptors, colour naming, colour normalization, graph matching. | ||||
| Abstract |
This paper presents a first approach to build colour and structural descriptors for information retrieval on a people database. Queries are formulated in terms of their appearance that allows to seek people wearing specific clothes of a given colour name or texture. Descriptors are automatically computed by following three essential steps. A colour naming labelling from pixel properties. A region seg- mentation step based on colour properties of pixels combined with edge information. And a high level step that models the region arrangements in order to build clothes structure. Results are tested on large set of images from real scenes taken at the entrance desk of a building. | ||||
| 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;CIC | Approved | no | ||
| Call Number | CAT @ cat @ TBB2002a | Serial | 287 | ||
| Permanent link to this record | |||||
| Author | Francesc Tous; Agnes Borras; Robert Benavente; Ramon Baldrich; Maria Vanrell; Josep Llados | ||||
| Title | Textual Descriptions for Browsing People by Visual Apperance. | Type | Book Chapter | ||
| Year | 2002 | Publication | Lecture Notes in Artificial Intelligence | Abbreviated Journal | |
| Volume | 2504 | Issue | Pages | 419-429 | |
| Keywords | |||||
| Abstract |
This paper presents a first approach to build colour and structural descriptors for information retrieval on a people database. Queries are formulated in terms of their appearance that allows to seek people wearing specific clothes of a given colour name or texture. Descriptors are automatically computed by following three essential steps. A colour naming labelling from pixel properties. A region seg- mentation step based on colour properties of pixels combined with edge information. And a high level step that models the region arrangements in order to build clothes structure. Results are tested on large set of images from real scenes taken at the entrance desk of a building | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG;CIC | Approved | no | ||
| Call Number | CAT @ cat @ TBB2002b | Serial | 319 | ||
| Permanent link to this record | |||||
| Author | Henry Velesaca; Raul Mira; Patricia Suarez; Christian X. Larrea; Angel Sappa | ||||
| Title | Deep Learning Based Corn Kernel Classification | Type | Conference Article | ||
| Year | 2020 | Publication | 1st International Workshop and Prize Challenge on Agriculture-Vision: Challenges & Opportunities for Computer Vision in Agriculture | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
This paper presents a full pipeline to classify sample sets of corn kernels. The proposed approach follows a segmentation-classification scheme. The image segmentation is performed through a well known deep learningbased approach, the Mask R-CNN architecture, while the classification is performed hrough a novel-lightweight network specially designed for this task—good corn kernel, defective corn kernel and impurity categories are considered. As a second contribution, a carefully annotated multitouching corn kernel dataset has been generated. This dataset has been used for training the segmentation and the classification modules. Quantitative evaluations have been
performed and comparisons with other approaches are provided showing improvements with the proposed pipeline. |
||||
| Address | Virtual CVPR | ||||
| 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 | CVPRW | ||
| Notes | MSIAU; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ VMS2020 | Serial | 3430 | ||
| Permanent link to this record | |||||