| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–20] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Cesar Isaza; Joaquin Salas; Bogdan Raducanu | ||||
| Title | Toward the Detection of Urban Infrastructures Edge Shadows | Type | Conference Article | ||
| Year | 2010 | Publication | 12th International Conference on Advanced Concepts for Intelligent Vision Systems | Abbreviated Journal | |
| Volume | 6474 | Issue  |
I | Pages | 30–37 |
| Keywords | |||||
| Abstract | In this paper, we propose a novel technique to detect the shadows cast by urban infrastructure, such as buildings, billboards, and traffic signs, using a sequence of images taken from a fixed camera. In our approach, we compute two different background models in parallel: one for the edges and one for the reflected light intensity. An algorithm is proposed to train the system to distinguish between moving edges in general and edges that belong to static objects, creating an edge background model. Then, during operation, a background intensity model allow us to separate between moving and static objects. Those edges included in the moving objects and those that belong to the edge background model are subtracted from the current image edges. The remaining edges are the ones cast by urban infrastructure. Our method is tested on a typical crossroad scene and the results show that the approach is sound and promising. | ||||
| Address | Sydney, Australia | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | eds. Blanc–Talon et al | |
| 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-17687-6 | Medium | |
| Area | Expedition | Conference | ACIVS | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ ISR2010 | Serial | 1458 | ||
| Permanent link to this record | |||||
| Author | Susana Alvarez; Anna Salvatella; Maria Vanrell; Xavier Otazu | ||||
| Title | Low-dimensional and Comprehensive Color Texture Description | Type | Journal Article | ||
| Year | 2012 | Publication | Computer Vision and Image Understanding | Abbreviated Journal | CVIU |
| Volume | 116 | Issue |
I | Pages | 54-67 |
| Keywords | |||||
| Abstract | Image retrieval can be dealt by combining standard descriptors, such as those of MPEG-7, which are defined independently for each visual cue (e.g. SCD or CLD for Color, HTD for texture or EHD for edges).
A common problem is to combine similarities coming from descriptors representing different concepts in different spaces. In this paper we propose a color texture description that bypasses this problem from its inherent definition. It is based on a low dimensional space with 6 perceptual axes. Texture is described in a 3D space derived from a direct implementation of the original Julesz’s Texton theory and color is described in a 3D perceptual space. This early fusion through the blob concept in these two bounded spaces avoids the problem and allows us to derive a sparse color-texture descriptor that achieves similar performance compared to MPEG-7 in image retrieval. Moreover, our descriptor presents comprehensive qualities since it can also be applied either in segmentation or browsing: (a) a dense image representation is defined from the descriptor showing a reasonable performance in locating texture patterns included in complex images; and (b) a vocabulary of basic terms is derived to build an intermediate level descriptor in natural language improving browsing by bridging semantic gap |
||||
| 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 | 1077-3142 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CAT;CIC | Approved | no | ||
| Call Number | Admin @ si @ ASV2012 | Serial | 1827 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; Debora Gil ; Aura Hernandez-Sabate | ||||
| Title | Error Analysis for Lucas-Kanade Based Schemes | Type | Conference Article | ||
| Year | 2012 | Publication | 9th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
| Volume | 7324 | Issue |
I | Pages | 184-191 |
| Keywords | Optical flow, Confidence measure, Lucas-Kanade, Cardiac Magnetic Resonance | ||||
| Abstract | Optical flow is a valuable tool for motion analysis in medical imaging sequences. A reliable application requires determining the accuracy of the computed optical flow. This is a main challenge given the absence of ground truth in medical sequences. This paper presents an error analysis of Lucas-Kanade schemes in terms of intrinsic design errors and numerical stability of the algorithm. Our analysis provides a confidence measure that is naturally correlated to the accuracy of the flow field. Our experiments show the higher predictive value of our confidence measure compared to existing measures. | ||||
| Address | Aveiro, Portugal | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag Berlin Heidelberg | Place of Publication | Editor | ||
| Language | english | Summary Language | Original Title | ||
| Series Editor | Campilho, Aurélio and Kamel, Mohamed | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | LNCS |
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-31294-6 | Medium | |
| Area | Expedition | Conference | ICIAR | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ MGH2012a | Serial | 1899 | ||
| Permanent link to this record | |||||
| Author | Fernando Barrera; Felipe Lumbreras; Angel Sappa | ||||
| Title | Evaluation of Similarity Functions in Multimodal Stereo | Type | Conference Article | ||
| Year | 2012 | Publication | 9th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
| Volume | 7324 | Issue |
I | Pages | 320-329 |
| Keywords | Aveiro, Portugal | ||||
| Abstract | This paper presents an evaluation framework for multimodal stereo matching, which allows to compare the performance of four similarity functions. Additionally, it presents details of a multimodal stereo head that supply thermal infrared and color images, as well as, aspects of its calibration and rectification. The pipeline includes a novel method for the disparity selection, which is suitable for evaluating the similarity functions. Finally, a benchmark for comparing different initializations of the proposed framework is presented. Similarity functions are based on mutual information, gradient orientation and scale space representations. Their evaluation is performed using two metrics: i) disparity error, and ii) number of correct matches on planar regions. In addition to the proposed evaluation, the current paper also shows that 3D sparse representations can be recovered from such a multimodal stereo head. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-31294-6 | Medium | |
| Area | Expedition | Conference | ICIAR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | BLS2012a | Serial | 2014 | ||
| Permanent link to this record | |||||
| Author | Miguel Oliveira; Angel Sappa; V. Santos | ||||
| Title | Color Correction using 3D Gaussian Mixture Models | Type | Conference Article | ||
| Year | 2012 | Publication | 9th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
| Volume | 7324 | Issue |
I | Pages | 97-106 |
| Keywords | |||||
| Abstract | The current paper proposes a novel color correction approach based on a probabilistic segmentation framework by using 3D Gaussian Mixture Models. Regions are used to compute local color correction functions, which are then combined to obtain the final corrected image. The proposed approach is evaluated using both a recently published metric and two large data sets composed of seventy images. The evaluation is performed by comparing our algorithm with eight well known color correction algorithms. Results show that the proposed approach is the highest scoring color correction method. Also, the proposed single step 3D color space probabilistic segmentation reduces processing time over similar approaches. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 10.1007/978-3-642-31295-3_12 | Medium | |
| Area | Expedition | Conference | ICIAR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ OSS2012a | Serial | 2015 | ||
| Permanent link to this record | |||||
| Author | Juan Ramon Terven Salinas; Bogdan Raducanu; Maria Elena Meza-de-Luna; Joaquin Salas | ||||
| Title | Head-gestures mirroring detection in dyadic social linteractions with computer vision-based wearable devices | Type | Journal Article | ||
| Year | 2016 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | 175 | Issue |
B | Pages | 866–876 |
| Keywords | Head gestures recognition; Mirroring detection; Dyadic social interaction analysis; Wearable devices | ||||
| Abstract | During face-to-face human interaction, nonverbal communication plays a fundamental role. A relevant aspect that takes part during social interactions is represented by mirroring, in which a person tends to mimic the non-verbal behavior (head and body gestures, vocal prosody, etc.) of the counterpart. In this paper, we introduce a computer vision-based system to detect mirroring in dyadic social interactions with the use of a wearable platform. In our context, mirroring is inferred as simultaneous head noddings displayed by the interlocutors. Our approach consists of the following steps: (1) facial features extraction; (2) facial features stabilization; (3) head nodding recognition; and (4) mirroring detection. Our system achieves a mirroring detection accuracy of 72% on a custom mirroring dataset. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | LAMP; 600.072; 600.068; | Approved | no | ||
| Call Number | Admin @ si @ TRM2016 | Serial | 2721 | ||
| Permanent link to this record | |||||
| Author | Monica Piñol; Angel Sappa; Ricardo Toledo | ||||
| Title | Adaptive Feature Descriptor Selection based on a Multi-Table Reinforcement Learning Strategy | Type | Journal Article | ||
| Year | 2015 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | 150 | Issue |
A | Pages | 106–115 |
| Keywords | Reinforcement learning; Q-learning; Bag of features; Descriptors | ||||
| Abstract | This paper presents and evaluates a framework to improve the performance of visual object classification methods, which are based on the usage of image feature descriptors as inputs. The goal of the proposed framework is to learn the best descriptor for each image in a given database. This goal is reached by means of a reinforcement learning process using the minimum information. The visual classification system used to demonstrate the proposed framework is based on a bag of features scheme, and the reinforcement learning technique is implemented through the Q-learning approach. The behavior of the reinforcement learning with different state definitions is evaluated. Additionally, a method that combines all these states is formulated in order to select the optimal state. Finally, the chosen actions are obtained from the best set of image descriptors in the literature: PHOW, SIFT, C-SIFT, SURF and Spin. Experimental results using two public databases (ETH and COIL) are provided showing both the validity of the proposed approach and comparisons with state of the art. In all the cases the best results are obtained with 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; 600.055; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ PST2015 | Serial | 2473 | ||
| Permanent link to this record | |||||
| Author | Francisco Alvaro; Francisco Cruz; Joan Andreu Sanchez; Oriol Ramos Terrades; Jose Miguel Benedi | ||||
| Title | Structure Detection and Segmentation of Documents Using 2D Stochastic Context-Free Grammars | Type | Journal Article | ||
| Year | 2015 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | 150 | Issue |
A | Pages | 147-154 |
| Keywords | document image analysis; stochastic context-free grammars; text classi cation features | ||||
| Abstract | In this paper we de ne a bidimensional extension of Stochastic Context-Free Grammars for structure detection and segmentation of images of documents.
Two sets of text classi cation features are used to perform an initial classi cation of each zone of the page. Then, the document segmentation is obtained as the most likely hypothesis according to a stochastic grammar. We used a dataset of historical marriage license books to validate this approach. We also tested several inference algorithms for Probabilistic Graphical Models and the results showed that the proposed grammatical model outperformed the other methods. Furthermore, grammars also provide the document structure along with its segmentation. |
||||
| 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; 601.158; 600.077; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ ACS2015 | Serial | 2531 | ||
| Permanent link to this record | |||||
| Author | Daniel Sanchez; Miguel Angel Bautista; Sergio Escalera | ||||
| Title | HuPBA 8k+: Dataset and ECOC-GraphCut based Segmentation of Human Limbs | Type | Journal Article | ||
| Year | 2015 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | 150 | Issue |
A | Pages | 173–188 |
| Keywords | Human limb segmentation; ECOC; Graph-Cuts | ||||
| Abstract | Human multi-limb segmentation in RGB images has attracted a lot of interest in the research community because of the huge amount of possible applications in fields like Human-Computer Interaction, Surveillance, eHealth, or Gaming. Nevertheless, human multi-limb segmentation is a very hard task because of the changes in appearance produced by different points of view, clothing, lighting conditions, occlusions, and number of articulations of the human body. Furthermore, this huge pose variability makes the availability of large annotated datasets difficult. In this paper, we introduce the HuPBA8k+ dataset. The dataset contains more than 8000 labeled frames at pixel precision, including more than 120000 manually labeled samples of 14 different limbs. For completeness, the dataset is also labeled at frame-level with action annotations drawn from an 11 action dictionary which includes both single person actions and person-person interactive actions. Furthermore, we also propose a two-stage approach for the segmentation of human limbs. In a first stage, human limbs are trained using cascades of classifiers to be split in a tree-structure way, which is included in an Error-Correcting Output Codes (ECOC) framework to define a body-like probability map. This map is used to obtain a binary mask of the subject by means of GMM color modelling and GraphCuts theory. In a second stage, we embed a similar tree-structure in an ECOC framework to build a more accurate set of limb-like probability maps within the segmented user mask, that are fed to a multi-label GraphCut procedure to obtain final multi-limb segmentation. The methodology is tested on the novel HuPBA8k+ dataset, showing performance improvements in comparison to state-of-the-art approaches. In addition, a baseline of standard action recognition methods for the 11 actions categories of the novel dataset is also provided. | ||||
| 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 @ SBE2015 | Serial | 2552 | ||
| Permanent link to this record | |||||
| Author | David Guillamet; Jordi Vitria | ||||
| Title | Evaluation of distance metrics for recognition based on non-negative matrix factorization | Type | Journal Article | ||
| Year | 2003 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 24 | Issue |
9-10 | Pages | 1599 –1605 |
| Keywords | |||||
| Abstract | IF: 0.809 | ||||
| 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 | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ GuV2003b | Serial | 380 | ||
| Permanent link to this record | |||||
| Author | Judit Martinez; F. Thomas | ||||
| Title | Efficient Computation of Local Geometric Moments | Type | Journal Article | ||
| Year | 2002 | Publication | IEEE Transactions on Image Porcessing, (IF: 2.553) | Abbreviated Journal | |
| Volume | 11 | Issue |
9 | Pages | 1102-1111 |
| Keywords | |||||
| Abstract | |||||
| 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 | Approved | no | |||
| Call Number | Admin @ si @ MaT2002 | Serial | 271 | ||
| Permanent link to this record | |||||
| Author | Jose Antonio Rodriguez; Florent Perronnin | ||||
| Title | Handwritten word-spotting using hidden Markov models and universal vocabularies | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 42 | Issue |
9 | Pages | 2103-2116 |
| Keywords | Word-spotting; Hidden Markov model; Score normalization; Universal vocabulary; Handwriting recognition | ||||
| Abstract | Handwritten word-spotting is traditionally viewed as an image matching task between one or multiple query word-images and a set of candidate word-images in a database. This is a typical instance of the query-by-example paradigm. In this article, we introduce a statistical framework for the word-spotting problem which employs hidden Markov models (HMMs) to model keywords and a Gaussian mixture model (GMM) for score normalization. We explore the use of two types of HMMs for the word modeling part: continuous HMMs (C-HMMs) and semi-continuous HMMs (SC-HMMs), i.e. HMMs with a shared set of Gaussians. We show on a challenging multi-writer corpus that the proposed statistical framework is always superior to a traditional matching system which uses dynamic time warping (DTW) for word-image distance computation. A very important finding is that the SC-HMM is superior when labeled training data is scarce—as low as one sample per keyword—thanks to the prior information which can be incorporated in the shared set of Gaussians. | ||||
| 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 | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | Approved | no | |||
| Call Number | Admin @ si @ RoP2009 | Serial | 1053 | ||
| 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 | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
| Title | Median Graphs: A Genetic Approach based on New Theoretical Properties | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 42 | Issue |
9 | Pages | 2003–2012 |
| Keywords | Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition | ||||
| Abstract | Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
| 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 | DAG @ dag @ FVS2009b | Serial | 1167 | ||
| Permanent link to this record | |||||
| Author | Oriol Ramos Terrades; Ernest Valveny; Salvatore Tabbone | ||||
| Title | Optimal Classifier Fusion in a Non-Bayesian Probabilistic Framework | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 31 | Issue |
9 | Pages | 1630–1644 |
| Keywords | |||||
| Abstract | The combination of the output of classifiers has been one of the strategies used to improve classification rates in general purpose classification systems. Some of the most common approaches can be explained using the Bayes' formula. In this paper, we tackle the problem of the combination of classifiers using a non-Bayesian probabilistic framework. This approach permits us to derive two linear combination rules that minimize misclassification rates under some constraints on the distribution of classifiers. In order to show the validity of this approach we have compared it with other popular combination rules from a theoretical viewpoint using a synthetic data set, and experimentally using two standard databases: the MNIST handwritten digit database and the GREC symbol database. Results on the synthetic data set show the validity of the theoretical approach. Indeed, results on real data show that the proposed methods outperform other common combination schemes. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RVT2009 | Serial | 1220 | ||
| Permanent link to this record | |||||