| Home | [211–220] << 221 222 223 224 225 226 227 228 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Andreas Fischer; Volkmar Frinken; Horst Bunke; Ching Y. Suen | ||||
| Title | Improving HMM-Based Keyword Spotting with Character Language Models | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 506-510 | ||
| Keywords | |||||
| Abstract | Facing high error rates and slow recognition speed for full text transcription of unconstrained handwriting images, keyword spotting is a promising alternative to locate specific search terms within scanned document images. We have previously proposed a learning-based method for keyword spotting using character hidden Markov models that showed a high performance when compared with traditional template image matching. In the lexicon-free approach pursued, only the text appearance was taken into account for recognition. In this paper, we integrate character n-gram language models into the spotting system in order to provide an additional language context. On the modern IAM database as well as the historical George Washington database, we demonstrate that character language models significantly improve the spotting performance. | ||||
| Address | Washington; USA; August 2013 | ||||
| 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  |
1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.045; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ FFB2013 | Serial | 2295 | ||
| Permanent link to this record | |||||
| Author | Christophe Rigaud; Dimosthenis Karatzas; Joost Van de Weijer; Jean-Christophe Burie; Jean-Marc Ogier | ||||
| Title | An active contour model for speech balloon detection in comics | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1240-1244 | ||
| Keywords | |||||
| Abstract | Comic books constitute an important cultural heritage asset in many countries. Digitization combined with subsequent comic book understanding would enable a variety of new applications, including content-based retrieval and content retargeting. Document understanding in this domain is challenging as comics are semi-structured documents, combining semantically important graphical and textual parts. Few studies have been done in this direction. In this work we detail a novel approach for closed and non-closed speech balloon localization in scanned comic book pages, an essential step towards a fully automatic comic book understanding. The approach is compared with existing methods for closed balloon localization found in the literature and results are presented. | ||||
| Address | washington; USA; August 2013 | ||||
| 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 |
1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; CIC; 600.056 | Approved | no | ||
| Call Number | Admin @ si @ RKW2013a | Serial | 2260 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Xavier Otazu; Josep Llados | ||||
| Title | Show through cancellation and image enhancement by multiresolution contrast processing | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 200-204 | ||
| Keywords | |||||
| Abstract | Historical documents suffer from different types of degradation and noise such as background variation, uneven illumination or dark spots. In case of double-sided documents, another common problem is that the back side of the document usually interferes with the front side because of the transparency of the document or ink bleeding. This effect is called the show through phenomenon. Many methods are developed to solve these problems, and in the case of show-through, by scanning and matching both the front and back sides of the document. In contrast, our approach is designed to use only one side of the scanned document. We hypothesize that show-trough are low contrast components, while foreground components are high contrast ones. A Multiresolution Contrast (MC) decomposition is presented in order to estimate the contrast of features at different spatial scales. We cancel the show-through phenomenon by thresholding these low contrast components. This decomposition is also able to enhance the image removing shadowed areas by weighting spatial scales. Results show that the enhanced images improve the readability of the documents, allowing scholars both to recover unreadable words and to solve ambiguities. | ||||
| Address | Washington; USA; August 2013 | ||||
| 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 |
1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 602.006; 600.045; 600.061; 600.052;CIC | Approved | no | ||
| Call Number | Admin @ si @ FOL2013 | Serial | 2241 | ||
| Permanent link to this record | |||||
| Author | David Aldavert; Marçal Rusiñol; Ricardo Toledo; Josep Llados | ||||
| Title | Integrating Visual and Textual Cues for Query-by-String Word Spotting | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 511 - 515 | ||
| Keywords | |||||
| Abstract | In this paper, we present a word spotting framework that follows the query-by-string paradigm where word images are represented both by textual and visual representations. The textual representation is formulated in terms of character $n$-grams while the visual one is based on the bag-of-visual-words scheme. These two representations are merged together and projected to a sub-vector space. This transform allows to, given a textual query, retrieve word instances that were only represented by the visual modality. Moreover, this statistical representation can be used together with state-of-the-art indexation structures in order to deal with large-scale scenarios. The proposed method is evaluated using a collection of historical documents outperforming state-of-the-art performances. | ||||
| Address | Washington; USA; August 2013 | ||||
| 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 |
1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; ADAS; 600.045; 600.055; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ ART2013 | Serial | 2224 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Jordi Vitria; D. Gatica-Perez | ||||
| Title | You are Fired! Nonverbal Role Analysis in Competitive Meetings | Type | Conference Article | ||
| Year | 2009 | Publication | IEEE International Conference on Audio, Speech and Signal Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 1949–1952 | ||
| Keywords | |||||
| Abstract | This paper addresses the problem of social interaction analysis in competitive meetings, using nonverbal cues. For our study, we made use of ldquoThe Apprenticerdquo reality TV show, which features a competition for a real, highly paid corporate job. Our analysis is centered around two tasks regarding a person's role in a meeting: predicting the person with the highest status and predicting the fired candidates. The current study was carried out using nonverbal audio cues. Results obtained from the analysis of a full season of the show, representing around 90 minutes of audio data, are very promising (up to 85.7% of accuracy in the first case and up to 92.8% in the second case). Our approach is based only on the nonverbal interaction dynamics during the meeting without relying on the spoken words. | ||||
| Address | Taipei, Taiwan | ||||
| 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 |
1520-6149 | ISBN | 978-1-4244-2353-8 | Medium | |
| Area | Expedition | Conference | ICASSP | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ RVG2009 | Serial | 1154 | ||
| Permanent link to this record | |||||
| Author | Ferran Diego; Joan Serrat; Antonio Lopez | ||||
| Title | Joint spatio-temporal alignment of sequences | Type | Journal Article | ||
| Year | 2013 | Publication | IEEE Transactions on Multimedia | Abbreviated Journal | TMM |
| Volume | 15 | Issue | 6 | Pages | 1377-1387 |
| Keywords | video alignment | ||||
| Abstract | Video alignment is important in different areas of computer vision such as wide baseline matching, action recognition, change detection, video copy detection and frame dropping prevention. Current video alignment methods usually deal with a relatively simple case of fixed or rigidly attached cameras or simultaneous acquisition. Therefore, in this paper we propose a joint video alignment for bringing two video sequences into a spatio-temporal alignment. Specifically, the novelty of the paper is to formulate the video alignment to fold the spatial and temporal alignment into a single alignment framework. This simultaneously satisfies a frame-correspondence and frame-alignment similarity; exploiting the knowledge among neighbor frames by a standard pairwise Markov random field (MRF). This new formulation is able to handle the alignment of sequences recorded at different times by independent moving cameras that follows a similar trajectory, and also generalizes the particular cases that of fixed geometric transformation and/or linear temporal mapping. We conduct experiments on different scenarios such as sequences recorded simultaneously or by moving cameras to validate the robustness of the proposed approach. The proposed method provides the highest video alignment accuracy compared to the state-of-the-art methods on sequences recorded from vehicles driving along the same track at different times. | ||||
| 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 |
1520-9210 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ DSL2013; ADAS @ adas @ | Serial | 2228 | ||
| Permanent link to this record | |||||
| Author | Olivier Penacchio | ||||
| Title | Mixed Hodge Structures and Equivariant Sheaves on the Projective Plane | Type | Journal Article | ||
| Year | 2011 | Publication | Mathematische Nachrichten | Abbreviated Journal | MN |
| Volume | 284 | Issue | 4 | Pages | 526-542 |
| Keywords | Mixed Hodge structures, equivariant sheaves, MSC (2010) Primary: 14C30, Secondary: 14F05, 14M25 | ||||
| Abstract | We describe an equivalence of categories between the category of mixed Hodge structures and a category of equivariant vector bundles on a toric model of the complex projective plane which verify some semistability condition. We then apply this correspondence to define an invariant which generalizes the notion of R-split mixed Hodge structure and give calculations for the first group of cohomology of possibly non smooth or non-complete curves of genus 0 and 1. Finally, we describe some extension groups of mixed Hodge structures in terms of equivariant extensions of coherent sheaves. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | WILEY-VCH Verlag | Place of Publication | Editor | R. Mennicken | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
1522-2616 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ Pen2011 | Serial | 1721 | ||
| Permanent link to this record | |||||
| Author | Jose Manuel Alvarez; Ferran Diego; Joan Serrat; Antonio Lopez | ||||
| Title | Automatic Ground-truthing using video registration for on-board detection algorithms | Type | Conference Article | ||
| Year | 2009 | Publication | 16th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 4389 - 4392 | ||
| Keywords | |||||
| Abstract | Ground-truth data is essential for the objective evaluation of object detection methods in computer vision. Many works claim their method is robust but they support it with experiments which are not quantitatively assessed with regard some ground-truth. This is one of the main obstacles to properly evaluate and compare such methods. One of the main reasons is that creating an extensive and representative ground-truth is very time consuming, specially in the case of video sequences, where thousands of frames have to be labelled. Could such a ground-truth be generated, at least in part, automatically? Though it may seem a contradictory question, we show that this is possible for the case of video sequences recorded from a moving camera. The key idea is transferring existing frame segmentations from a reference sequence into another video sequence recorded at a different time on the same track, possibly under a different ambient lighting. We have carried out experiments on several video sequence pairs and quantitatively assessed the precision of the transformed ground-truth, which prove that our approach is not only feasible but also quite accurate. | ||||
| Address | Cairo, Egypt | ||||
| 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 |
1522-4880 | ISBN | 978-1-4244-5653-6 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ ADS2009 | Serial | 1201 | ||
| Permanent link to this record | |||||
| Author | Angel Sappa; Mohammad Rouhani | ||||
| Title | Efficient Distance Estimation for Fitting Implicit Quadric Surfaces | Type | Conference Article | ||
| Year | 2009 | Publication | 16th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 3521–3524 | ||
| Keywords | |||||
| Abstract | This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates the orthogonal orientation to the surface from the given point; then the shortest distance is directly estimated by intersecting the implicit surface with a line passing through the given point according to the estimated orthogonal orientation. The proposed orthogonal distance estimation is easily obtained without increasing computational complexity; hence it can be used in error minimization surface fitting frameworks. Comparisons of the proposed metric with previous approaches are provided to show both improvements in CPU time as well as in the accuracy of the obtained results. Surfaces fitted by using the proposed geometric distance estimation and state of the art metrics are presented to show the viability of the proposed approach. | ||||
| Address | Cairo, Egypt | ||||
| 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 |
1522-4880 | ISBN | 978-1-4244-5653-6 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ SaR2009 | Serial | 1232 | ||
| Permanent link to this record | |||||
| Author | Carlo Gatta; Petia Radeva | ||||
| Title | Bilateral Enhancers | Type | Conference Article | ||
| Year | 2009 | Publication | 16th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 3161-3165 | ||
| Keywords | |||||
| Abstract | Ten years ago the concept of bilateral filtering (BF) became popular in the image processing community. The core of the idea is to blend the effect of a spatial filter, as e.g. the Gaussian filter, with the effect of a filter that acts on image values. The two filters acts on orthogonal domains of a picture: the 2D lattice of the image support and the intensity (or color) domain. The BF approach is an intuitive way to blend these two filters giving rise to algorithms that perform difficult tasks requiring a relatively simple design. In this paper we extend the concept of BF, proposing the bilateral enhancers (BE). We show how to design proper functions to obtain an edge-preserving smoothing and a selective sharpening. Moreover, we show that the proposed algorithm can perform edge-preserving smoothing and selective sharpening simultaneously in a single filtering. | ||||
| Address | Cairo, Egypt | ||||
| 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 |
1522-4880 | ISBN | 978-1-4244-5653-6 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | MILAB | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ GaR2009b | Serial | 1243 | ||
| Permanent link to this record | |||||
| Author | Fernando Barrera; Felipe Lumbreras; Angel Sappa | ||||
| Title | Multimodal Template Matching based on Gradient and Mutual Information using Scale-Space | Type | Conference Article | ||
| Year | 2010 | Publication | 17th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 2749–2752 | ||
| Keywords | |||||
| Abstract | This paper presents the combined use of gradient and mutual information for infrared and intensity templates matching. We propose to joint: (i) feature matching in a multiresolution context and (ii) information propagation through scale-space representations. Our method consists in combining mutual information with a shape descriptor based on gradient, and propagate them following a coarse-to-fine strategy. The main contributions of this work are: to offer a theoretical formulation towards a multimodal stereo matching; to show that gradient and mutual information can be reinforced while they are propagated between consecutive levels; and to show that they are valid cost functions in multimodal template matchings. Comparisons are presented showing the improvements and viability of the proposed approach. | ||||
| Address | Hong-Kong | ||||
| 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 |
1522-4880 | ISBN | 978-1-4244-7992-4 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ BLS2010 | Serial | 1358 | ||
| Permanent link to this record | |||||
| Author | Mohammad Rouhani; Angel Sappa | ||||
| Title | A Fast accurate Implicit Polynomial Fitting Approach | Type | Conference Article | ||
| Year | 2010 | Publication | 17th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 1429–1432 | ||
| Keywords | |||||
| Abstract | This paper presents a novel hybrid approach that combines state of the art fitting algorithms: algebraic-based and geometric-based. It consists of two steps; first, the 3L algorithm is used as an initialization and then, the obtained result, is improved through a geometric approach. The adopted geometric approach is based on a distance estimation that avoids costly search for the real orthogonal distance. Experimental results are presented as well as quantitative comparisons. | ||||
| Address | Hong-Kong | ||||
| 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 |
1522-4880 | ISBN | 978-1-4244-7992-4 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ RoS2010b | Serial | 1359 | ||
| Permanent link to this record | |||||
| Author | Ekaterina Zaytseva; Jordi Vitria | ||||
| Title | A search based approach to non maximum suppression in face detection | Type | Conference Article | ||
| Year | 2012 | Publication | 19th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Poster
paper TA.P5.12 Face detectors typically produce a large number of false positives and this leads to the need to have a further non maximum suppression stage to eliminate multiple and spurious responses. This stage is based on considering spatial heuristics: true positive responses are selected by implicitly considering several restrictions on the spatial distribution of detector responses in natural images. In this paper we analyze the limitations of this approach and propose an efficient search method to overcome them. Results show how the application of this new non-maximum suppression approach to a simple face detector boosts its performance to state of the art results. |
||||
| Address | Orlando; USA; September 2012 | ||||
| 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 |
1522-4880 | ISBN | 978-1-4673-2534-9 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ ZaV2012 | Serial | 2060 | ||
| Permanent link to this record | |||||
| Author | Xavier Baro; Sergio Escalera; Jordi Vitria; Oriol Pujol; Petia Radeva | ||||
| Title | Traffic Sign Recognition Using Evolutionary Adaboost Detection and Forest-ECOC Classification | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transactions on Intelligent Transportation Systems | Abbreviated Journal | TITS |
| Volume | 10 | Issue | 1 | Pages | 113–126 |
| Keywords | |||||
| Abstract | The high variability of sign appearance in uncontrolled environments has made the detection and classification of road signs a challenging problem in computer vision. In this paper, we introduce a novel approach for the detection and classification of traffic signs. Detection is based on a boosted detectors cascade, trained with a novel evolutionary version of Adaboost, which allows the use of large feature spaces. Classification is defined as a multiclass categorization problem. A battery of classifiers is trained to split classes in an Error-Correcting Output Code (ECOC) framework. We propose an ECOC design through a forest of optimal tree structures that are embedded in the ECOC matrix. The novel system offers high performance and better accuracy than the state-of-the-art strategies and is potentially better in terms of noise, affine deformation, partial occlusions, and reduced illumination. | ||||
| 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 |
1524-9050 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR;MILAB;HuPBA;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ BEV2008 | Serial | 1116 | ||
| Permanent link to this record | |||||
| Author | Fadi Dornaika; Jose Manuel Alvarez; Angel Sappa; Antonio Lopez | ||||
| Title | A New Framework for Stereo Sensor Pose through Road Segmentation and Registration | Type | Journal Article | ||
| Year | 2011 | Publication | IEEE Transactions on Intelligent Transportation Systems | Abbreviated Journal | TITS |
| Volume | 12 | Issue | 4 | Pages | 954-966 |
| Keywords | road detection | ||||
| Abstract | This paper proposes a new framework for real-time estimation of the onboard stereo head's position and orientation relative to the road surface, which is required for any advanced driver-assistance application. This framework can be used with all road types: highways, urban, etc. Unlike existing works that rely on feature extraction in either the image domain or 3-D space, we propose a framework that directly estimates the unknown parameters from the stream of stereo pairs' brightness. The proposed approach consists of two stages that are invoked for every stereo frame. The first stage segments the road region in one monocular view. The second stage estimates the camera pose using a featureless registration between the segmented monocular road region and the other view in the stereo pair. This paper has two main contributions. The first contribution combines a road segmentation algorithm with a registration technique to estimate the online stereo camera pose. The second contribution solves the registration using a featureless method, which is carried out using two different optimization techniques: 1) the differential evolution algorithm and 2) the Levenberg-Marquardt (LM) algorithm. We provide experiments and evaluations of performance. The results presented show the validity of our proposed framework. | ||||
| 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 |
1524-9050 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ DAS2011; ADAS @ adas @ das2011a | Serial | 1833 | ||
| Permanent link to this record | |||||