| Home | << 1 2 3 4 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
| Title | Median graph: A new exact algorithm using a distance based on the maximum common subgraph | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 30 | Issue | 5 | Pages | 579–588 |
| Keywords | |||||
| Abstract | Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
Publisher  |
Elsevier Science Inc. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ FVS2009a | Serial | 1114 | ||
| Permanent link to this record | |||||
| Author | Fadi Dornaika; Angel Sappa | ||||
| Title | Instantaneous 3D motion from image derivatives using the Least Trimmed Square Regression | Type | Journal Article | ||
| Year | 2009 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 30 | Issue | 5 | Pages | 535–543 |
| Keywords | |||||
| Abstract | This paper presents a new technique to the instantaneous 3D motion estimation. The main contributions are as follows. First, we show that the 3D camera or scene velocity can be retrieved from image derivatives only assuming that the scene contains a dominant plane. Second, we propose a new robust algorithm that simultaneously provides the Least Trimmed Square solution and the percentage of inliers-the non-contaminated data. Experiments on both synthetic and real image sequences demonstrated the effectiveness of the developed method. Those experiments show that the new robust approach can outperform classical robust schemes. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier Science Inc. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ DoS2009a | Serial | 1115 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; Petia Radeva | ||||
| Title | Inhibition of false landmarks | Type | Journal Article | ||
| Year | 2006 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 27 | Issue | 9 | Pages | 1022-1030 |
| Keywords | |||||
| Abstract | Corners and junctions are landmarks characterized by the lack of differentiability in the unit tangent to the image level curve. Detectors based on differential operators are not, by their own definition, the best posed as they require a higher degree of differentiability to yield a reliable response. We argue that a corner detector should be based on the degree of continuity of the tangent vector to the image level sets, work on the image domain and need no assumptions on neither the image local structure nor the particular geometry of the corner/junction. An operator measuring the degree of differentiability of the projection matrix on the image gradient fulfills the above requirements. Because using smoothing kernels leads to corner misplacement, we suggest an alternative fake response remover based on the receptive field inhibition of spurious details. The combination of both orientation discontinuity detection and noise inhibition produce our inhibition orientation energy (IOE) landmark locator. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier Science Inc. | Place of Publication | New York, NY, USA | Editor | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | IAM;MILAB | Approved | no | ||
| Call Number | IAM @ iam @ GiR2006 | Serial | 1529 | ||
| Permanent link to this record | |||||
| Author | Ernest Valveny; Enric Marti | ||||
| Title | A model for image generation and symbol recognition through the deformation of lineal shapes | Type | Journal Article | ||
| Year | 2003 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 24 | Issue | 15 | Pages | 2857-2867 |
| Keywords | |||||
| Abstract | We describe a general framework for the recognition of distorted images of lineal shapes, which relies on three items: a model to represent lineal shapes and their deformations, a model for the generation of distorted binary images and the combination of both models in a common probabilistic framework, where the generation of deformations is related to an internal energy, and the generation of binary images to an external energy. Then, recognition consists in the minimization of a global energy function, performed by using the EM algorithm. This general framework has been applied to the recognition of hand-drawn lineal symbols in graphic documents. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier Science Inc. | Place of Publication | New York, NY, USA | Editor | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; IAM | Approved | no | ||
| Call Number | IAM @ iam @ VAM2003 | Serial | 1653 | ||
| Permanent link to this record | |||||
| Author | David Sanchez-Mendoza; David Masip; Agata Lapedriza | ||||
| Title | Emotion recognition from mid-level features | Type | Journal Article | ||
| Year | 2015 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 67 | Issue | Part 1 | Pages | 66–74 |
| Keywords | Facial expression; Emotion recognition; Action units; Computer vision | ||||
| Abstract | In this paper we present a study on the use of Action Units as mid-level features for automatically recognizing basic and subtle emotions. We propose a representation model based on mid-level facial muscular movement features. We encode these movements dynamically using the Facial Action Coding System, and propose to use these intermediate features based on Action Units (AUs) to classify emotions. AUs activations are detected fusing a set of spatiotemporal geometric and appearance features. The algorithm is validated in two applications: (i) the recognition of 7 basic emotions using the publicly available Cohn-Kanade database, and (ii) the inference of subtle emotional cues in the Newscast database. In this second scenario, we consider emotions that are perceived cumulatively in longer periods of time. In particular, we Automatically classify whether video shoots from public News TV channels refer to Good or Bad news. To deal with the different video lengths we propose a Histogram of Action Units and compute it using a sliding window strategy on the frame sequences. Our approach achieves accuracies close to human perception. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier B.V. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ SML2015 | Serial | 2746 | ||
| Permanent link to this record | |||||
| Author | Pedro Martins; Paulo Carvalho; Carlo Gatta | ||||
| Title | On the completeness of feature-driven maximally stable extremal regions | Type | Journal Article | ||
| Year | 2016 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 74 | Issue | Pages | 9-16 | |
| Keywords | Local features; Completeness; Maximally Stable Extremal Regions | ||||
| Abstract | By definition, local image features provide a compact representation of the image in which most of the image information is preserved. This capability offered by local features has been overlooked, despite being relevant in many application scenarios. In this paper, we analyze and discuss the performance of feature-driven Maximally Stable Extremal Regions (MSER) in terms of the coverage of informative image parts (completeness). This type of features results from an MSER extraction on saliency maps in which features related to objects boundaries or even symmetry axes are highlighted. These maps are intended to be suitable domains for MSER detection, allowing this detector to provide a better coverage of informative image parts. Our experimental results, which were based on a large-scale evaluation, show that feature-driven MSER have relatively high completeness values and provide more complete sets than a traditional MSER detection even when sets of similar cardinality are considered. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier B.V. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | LAMP;MILAB; | Approved | no | ||
| Call Number | Admin @ si @ MCG2016 | Serial | 2748 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Agnes Borras; Josep Llados | ||||
| Title | Relational Indexing of Vectorial Primitives for Symbol Spotting in Line-Drawing Images | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 3 | Pages | 188–201 |
| Keywords | Document image analysis and recognition, Graphics recognition, Symbol spotting ,Vectorial representations, Line-drawings | ||||
| Abstract | This paper presents a symbol spotting approach for indexing by content a database of line-drawing images. As line-drawings are digital-born documents designed by vectorial softwares, instead of using a pixel-based approach, we present a spotting method based on vector primitives. Graphical symbols are represented by a set of vectorial primitives which are described by an off-the-shelf shape descriptor. A relational indexing strategy aims to retrieve symbol locations into the target documents by using a combined numerical-relational description of 2D structures. The zones which are likely to contain the queried symbol are validated by a Hough-like voting scheme. In addition, a performance evaluation framework for symbol spotting in graphical documents is proposed. The presented methodology has been evaluated with a benchmarking set of architectural documents achieving good performance results. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RBL2010 | Serial | 1177 | ||
| Permanent link to this record | |||||
| Author | Jose Antonio Rodriguez; Florent Perronnin; Gemma Sanchez; Josep Llados | ||||
| Title | Unsupervised writer adaptation of whole-word HMMs with application to word-spotting | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 8 | Pages | 742–749 |
| Keywords | Word-spotting; Handwriting recognition; Writer adaptation; Hidden Markov model; Document analysis | ||||
| Abstract | In this paper we propose a novel approach for writer adaptation in a handwritten word-spotting task. The method exploits the fact that the semi-continuous hidden Markov model separates the word model parameters into (i) a codebook of shapes and (ii) a set of word-specific parameters.
Our main contribution is to employ this property to derive writer-specific word models by statistically adapting an initial universal codebook to each document. This process is unsupervised and does not even require the appearance of the keyword(s) in the searched document. Experimental results show an increase in performance when this adaptation technique is applied. To the best of our knowledge, this is the first work dealing with adaptation for word-spotting. The preliminary version of this paper obtained an IBM Best Student Paper Award at the 19th International Conference on Pattern Recognition. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RPS2010 | Serial | 1290 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | Re-coding ECOCs without retraining | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 7 | Pages | 555–562 |
| Keywords | |||||
| Abstract | A standard way to deal with multi-class categorization problems is by the combination of binary classifiers in a pairwise voting procedure. Recently, this classical approach has been formalized in the Error-Correcting Output Codes (ECOC) framework. In the ECOC framework, the one-versus-one coding demonstrates to achieve higher performance than the rest of coding designs. The binary problems that we train in the one-versus-one strategy are significantly smaller than in the rest of designs, and usually easier to be learnt, taking into account the smaller overlapping between classes. However, a high percentage of the positions coded by zero of the coding matrix, which implies a high sparseness degree, does not codify meta-class membership information. In this paper, we show that using the training data we can redefine without re-training, in a problem-dependent way, the one-versus-one coding matrix so that the new coded information helps the system to increase its generalization capability. Moreover, the new re-coding strategy is generalized to be applied over any binary code. The results over several UCI Machine Learning repository data sets and two real multi-class problems show that performance improvements can be obtained re-coding the classical one-versus-one and Sparse random designs compared to different state-of-the-art ECOC configurations. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010e | Serial | 1338 | ||
| Permanent link to this record | |||||
| Author | Josep Llados; Horst Bunke; Enric Marti | ||||
| Title | Finding rotational symmetries by cyclic string matching | Type | Journal Article | ||
| Year | 1997 | Publication | Pattern recognition letters | Abbreviated Journal | PRL |
| Volume | 18 | Issue | 14 | Pages | 1435-1442 |
| Keywords | Rotational symmetry; Reflectional symmetry; String matching | ||||
| Abstract | Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG;IAM; | Approved | no | ||
| Call Number | IAM @ iam @ LBM1997a | Serial | 1562 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; David Masip; Eloi Puertas; Petia Radeva; Oriol Pujol | ||||
| Title | Online Error-Correcting Output Codes | Type | Journal Article | ||
| Year | 2011 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 32 | Issue | 3 | Pages | 458-467 |
| Keywords | |||||
| Abstract | IF JCR CCIA 1.303 2009 54/103
This article proposes a general extension of the error correcting output codes framework to the online learning scenario. As a result, the final classifier handles the addition of new classes independently of the base classifier used. In particular, this extension supports the use of both online example incremental and batch classifiers as base learners. The extension of the traditional problem independent codings one-versus-all and one-versus-one is introduced. Furthermore, two new codings are proposed, unbalanced online ECOC and a problem dependent online ECOC. This last online coding technique takes advantage of the problem data for minimizing the number of dichotomizers used in the ECOC framework while preserving a high accuracy. These techniques are validated on an online setting of 11 data sets from UCI database and applied to two real machine vision applications: traffic sign recognition and face recognition. As a result, the online ECOC techniques proposed provide a feasible and robust way for handling new classes using any base classifier. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | North Holland | Editor | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;OR;HuPBA;MV | Approved | no | ||
| Call Number | Admin @ si @ EMP2011 | Serial | 1714 | ||
| Permanent link to this record | |||||
| Author | Carles Fernandez; Pau Baiget; Xavier Roca; Jordi Gonzalez | ||||
| Title | Augmenting Video Surveillance Footage with Virtual Agents for Incremental Event Evaluation | Type | Journal Article | ||
| Year | 2011 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 32 | Issue | 6 | Pages | 878–889 |
| Keywords | |||||
| Abstract | The fields of segmentation, tracking and behavior analysis demand for challenging video resources to test, in a scalable manner, complex scenarios like crowded environments or scenes with high semantics. Nevertheless, existing public databases cannot scale the presence of appearing agents, which would be useful to study long-term occlusions and crowds. Moreover, creating these resources is expensive and often too particularized to specific needs. We propose an augmented reality framework to increase the complexity of image sequences in terms of occlusions and crowds, in a scalable and controllable manner. Existing datasets can be increased with augmented sequences containing virtual agents. Such sequences are automatically annotated, thus facilitating evaluation in terms of segmentation, tracking, and behavior recognition. In order to easily specify the desired contents, we propose a natural language interface to convert input sentences into virtual agent behaviors. Experimental tests and validation in indoor, street, and soccer environments are provided to show the feasibility of the proposed approach in terms of robustness, scalability, and semantics. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ FBR2011b | Serial | 1723 | ||
| Permanent link to this record | |||||
| Author | Miguel Angel Bautista; Sergio Escalera; Xavier Baro; Petia Radeva; Jordi Vitria; Oriol Pujol | ||||
| Title | Minimal Design of Error-Correcting Output Codes | Type | Journal Article | ||
| Year | 2011 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 33 | Issue | 6 | Pages | 693-702 |
| Keywords | Multi-class classification; Error-correcting output codes; Ensemble of classifiers | ||||
| Abstract | IF JCR CCIA 1.303 2009 54/103
The classification of large number of object categories is a challenging trend in the pattern recognition field. In literature, this is often addressed using an ensemble of classifiers. In this scope, the Error-correcting output codes framework has demonstrated to be a powerful tool for combining classifiers. However, most state-of-the-art ECOC approaches use a linear or exponential number of classifiers, making the discrimination of a large number of classes unfeasible. In this paper, we explore and propose a minimal design of ECOC in terms of the number of classifiers. Evolutionary computation is used for tuning the parameters of the classifiers and looking for the best minimal ECOC code configuration. The results over several public UCI datasets and different multi-class computer vision problems show that the proposed methodology obtains comparable (even better) results than state-of-the-art ECOC methodologies with far less number of dichotomizers. |
||||
| 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 | 0167-8655 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB; OR;HuPBA;MV | Approved | no | ||
| Call Number | Admin @ si @ BEB2011a | Serial | 1800 | ||
| Permanent link to this record | |||||
| Author | Albert Clapes; Miguel Reyes; Sergio Escalera | ||||
| Title | Multi-modal User Identification and Object Recognition Surveillance System | Type | Journal Article | ||
| Year | 2013 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 34 | Issue | 7 | Pages | 799-808 |
| Keywords | Multi-modal RGB-Depth data analysis; User identification; Object recognition; Intelligent surveillance; Visual features; Statistical learning | ||||
| Abstract | We propose an automatic surveillance system for user identification and object recognition based on multi-modal RGB-Depth data analysis. We model a RGBD environment learning a pixel-based background Gaussian distribution. Then, user and object candidate regions are detected and recognized using robust statistical approaches. The system robustly recognizes users and updates the system in an online way, identifying and detecting new actors in the scene. Moreover, segmented objects are described, matched, recognized, and updated online using view-point 3D descriptions, being robust to partial occlusions and local 3D viewpoint rotations. Finally, the system saves the historic of user–object assignments, being specially useful for surveillance scenarios. The system has been evaluated on a novel data set containing different indoor/outdoor scenarios, objects, and users, showing accurate recognition and better performance than standard state-of-the-art approaches. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | HUPBA; 600.046; 605.203;MILAB | Approved | no | ||
| Call Number | Admin @ si @ CRE2013 | Serial | 2248 | ||
| Permanent link to this record | |||||
| Author | Mohamed Ali Souibgui; Alicia Fornes; Yousri Kessentini; Beata Megyesi | ||||
| Title | Few shots are all you need: A progressive learning approach for low resource handwritten text recognition | Type | Journal Article | ||
| Year | 2022 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 160 | Issue | Pages | 43-49 | |
| Keywords | |||||
| Abstract | Handwritten text recognition in low resource scenarios, such as manuscripts with rare alphabets, is a challenging problem. In this paper, we propose a few-shot learning-based handwriting recognition approach that significantly reduces the human annotation process, by requiring only a few images of each alphabet symbols. The method consists of detecting all the symbols of a given alphabet in a textline image and decoding the obtained similarity scores to the final sequence of transcribed symbols. Our model is first pretrained on synthetic line images generated from an alphabet, which could differ from the alphabet of the target domain. A second training step is then applied to reduce the gap between the source and the target data. Since this retraining would require annotation of thousands of handwritten symbols together with their bounding boxes, we propose to avoid such human effort through an unsupervised progressive learning approach that automatically assigns pseudo-labels to the unlabeled data. The evaluation on different datasets shows that our model can lead to competitive results with a significant reduction in human effort. The code will be publicly available in the following repository: https://github.com/dali92002/HTRbyMatching | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.121; 600.162; 602.230 | Approved | no | ||
| Call Number | Admin @ si @ SFK2022 | Serial | 3736 | ||
| Permanent link to this record | |||||