| |
Records |
Links |
|
Author |
Jialuo Chen; M.A.Souibgui; Alicia Fornes; Beata Megyesi |
|
| |
Title |
A Web-based Interactive Transcription Tool for Encrypted Manuscripts |
Type |
Conference Article |
| |
Year |
2020 |
Publication |
3rd International Conference on Historical Cryptology |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
52-59 |
|
| |
Keywords |
|
|
| |
Abstract |
Manual transcription of handwritten text is a time consuming task. In the case of encrypted manuscripts, the recognition is even more complex due to the huge variety of alphabets and symbol sets. To speed up and ease this process, we present a web-based tool aimed to (semi)-automatically transcribe the encrypted sources. The user uploads one or several images of the desired encrypted document(s) as input, and the system returns the transcription(s). This process is carried out in an interactive fashion with
the user to obtain more accurate results. For discovering and testing, the developed web tool is freely available. |
|
| |
Address |
Virtual; June 2020 |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference  |
HistoCrypt |
|
| |
Notes |
DAG; 600.140; 602.230; 600.121 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CSF2020 |
Serial |
3447 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jialuo Chen; Mohamed Ali Souibgui; Alicia Fornes; Beata Megyesi |
|
| |
Title |
Unsupervised Alphabet Matching in Historical Encrypted Manuscript Images |
Type |
Conference Article |
| |
Year |
2021 |
Publication |
4th International Conference on Historical Cryptology |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
34-37 |
|
| |
Keywords |
|
|
| |
Abstract |
Historical ciphers contain a wide range ofsymbols from various symbol sets. Iden-tifying the cipher alphabet is a prerequi-site before decryption can take place andis a time-consuming process. In this workwe explore the use of image processing foridentifying the underlying alphabet in ci-pher images, and to compare alphabets be-tween ciphers. The experiments show thatciphers with similar alphabets can be suc-cessfully discovered through clustering. |
|
| |
Address |
Virtual; September 2021 |
|
| |
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 |
HistoCrypt |
|
| |
Notes |
DAG; 602.230; 600.140; 600.121 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CSF2021 |
Serial |
3617 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Giacomo Magnifico; Beata Megyesi; Mohamed Ali Souibgui; Jialuo Chen; Alicia Fornes |
|
| |
Title |
Lost in Transcription of Graphic Signs in Ciphers |
Type |
Conference Article |
| |
Year |
2022 |
Publication |
International Conference on Historical Cryptology (HistoCrypt 2022) |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
153-158 |
|
| |
Keywords |
transcription of ciphers; hand-written text recognition of symbols; graphic signs |
|
| |
Abstract |
Hand-written Text Recognition techniques with the aim to automatically identify and transcribe hand-written text have been applied to historical sources including ciphers. In this paper, we compare the performance of two machine learning architectures, an unsupervised method based on clustering and a deep learning method with few-shot learning. Both models are tested on seen and unseen data from historical ciphers with different symbol sets consisting of various types of graphic signs. We compare the models and highlight their differences in performance, with their advantages and shortcomings. |
|
| |
Address |
Amsterdam, Netherlands, June 20-22, 2022 |
|
| |
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 |
HystoCrypt |
|
| |
Notes |
DAG; 600.121; 600.162; 602.230; 600.140 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ MBS2022 |
Serial |
3731 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Carlos David Martinez Hinarejos; Josep Llados; Alicia Fornes; Francisco Casacuberta; Lluis de Las Heras; Joan Mas; Moises Pastor; Oriol Ramos Terrades; Joan Andreu Sanchez; Enrique Vidal; Fernando Vilariño |
|
| |
Title |
Context, multimodality, and user collaboration in handwritten text processing: the CoMUN-HaT project |
Type |
Conference Article |
| |
Year |
2016 |
Publication |
3rd IberSPEECH |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
Processing of handwritten documents is a task that is of wide interest for many
purposes, such as those related to preserve cultural heritage. Handwritten text recognition techniques have been successfully applied during the last decade to obtain transcriptions of handwritten documents, and keyword spotting techniques have been applied for searching specific terms in image collections of handwritten documents. However, results on transcription and indexing are far from perfect. In this framework, the use of new data sources arises as a new paradigm that will allow for a better transcription and indexing of handwritten documents. Three main different data sources could be considered: context of the document (style, writer, historical time, topics,. . . ), multimodal data (representations of the document in a different modality, such as the speech signal of the dictation of the text), and user feedback (corrections, amendments,. . . ). The CoMUN-HaT project aims at the integration of these different data sources into the transcription and indexing task for handwritten documents: the use of context derived from the analysis of the documents, how multimodality can aid the recognition process to obtain more accurate transcriptions (including transcription in a modern version of the language), and integration into a userin-the-loop assisted text transcription framework. This will be reflected in the construction of a transcription and indexing platform that can be used by both professional and nonprofessional users, contributing to crowd-sourcing activities to preserve cultural heritage and to obtain an accessible version of the involved corpus. |
|
| |
Address |
Lisboa; Portugal; November 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 |
IberSPEECH |
|
| |
Notes |
DAG; MV; 600.097;SIAI |
Approved |
no |
|
| |
Call Number |
Admin @ si @MLF2016 |
Serial |
2813 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Miquel Ferrer; Ernest Valveny; F. Serratosa |
|
| |
Title |
Median Graph Computation by means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subraph |
Type |
Conference Article |
| |
Year |
2009 |
Publication |
4th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
5524 |
Issue |
|
Pages |
346–353 |
|
| |
Keywords |
|
|
| |
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 a new genetic algorithm for the median graph computation. 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, show that we obtain good approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. |
|
| |
Address |
Póvoa de Varzim, Portugal |
|
| |
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-02171-8 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IbPRIA |
|
| |
Notes |
DAG |
Approved |
no |
|
| |
Call Number |
DAG @ dag @ FVS2009c |
Serial |
1174 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Albert Gordo; Ernest Valveny |
|
| |
Title |
The diagonal split: A pre-segmentation step for page layout analysis & classification |
Type |
Conference Article |
| |
Year |
2009 |
Publication |
4th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
5524 |
Issue |
|
Pages |
290–297 |
|
| |
Keywords |
|
|
| |
Abstract |
Document classification is an important task in all the processes related to document storage and retrieval. In the case of complex documents, structural features are needed to achieve a correct classification. Unfortunately, physical layout analysis is error prone. In this paper we present a pre-segmentation step based on a divide & conquer strategy that can be used to improve the page segmentation results, independently of the segmentation algorithm used. This pre-segmentation step is evaluated in classification and retrieval using the selective CRLA algorithm for layout segmentation together with a clustering based on the voronoi area diagram, and tested on two different databases, MARG and Girona Archives. |
|
| |
Address |
Póvoa de Varzim, Portugal |
|
| |
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-02171-8 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IbPRIA |
|
| |
Notes |
DAG |
Approved |
no |
|
| |
Call Number |
DAG @ dag @ Gov2009b |
Serial |
1176 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jon Almazan; Ernest Valveny; Alicia Fornes |
|
| |
Title |
Deforming the Blurred Shape Model for Shape Description and Recognition |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
5th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
6669 |
Issue |
|
Pages |
1-8 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents a new model for the description and recognition of distorted shapes, where the image is represented by a pixel density distribution based on the Blurred Shape Model combined with a non-linear image deformation model. This leads to an adaptive structure able to capture elastic deformations in shapes. This method has been evaluated using thee different datasets where deformations are present, showing the robustness and good performance of the new model. Moreover, we show that incorporating deformation and flexibility, the new model outperforms the BSM approach when classifying shapes with high variability of appearance. |
|
| |
Address |
Las Palmas de Gran Canaria. Spain |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer-Verlag |
Place of Publication |
Berlin |
Editor |
Jordi Vitria; Joao Miguel Raposo; Mario Hernandez |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IbPRIA |
|
| |
Notes |
DAG; |
Approved |
no |
|
| |
Call Number |
Admin @ si @ AVF2011 |
Serial |
1732 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Lluis Pere de las Heras; Gemma Sanchez |
|
| |
Title |
And-Or Graph Grammar for Architectural Floorplan Representation, Learning and Recognition. A Semantic, Structural and Hierarchical Model |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
5th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
6669 |
Issue |
|
Pages |
17-24 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents a syntactic model for architectural floor plan interpretation. A stochastic image grammar over an And-Or graph is inferred to represent the hierarchical, structural and semantic relations between elements of all possible floor plans. This grammar is augmented with three different probabilistic models, learnt from a training set, to account the frequency of that relations. Then, a Bottom-Up/Top-Down parser with a pruning strategy has been used for floor plan recognition. For a given input, the parser generates the most probable parse graph for that document. This graph not only contains the structural and semantic relations of its elements, but also its hierarchical composition, that allows to interpret the floor plan at different levels of abstraction. |
|
| |
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 |
978-3-642-21256-7 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IbPRIA |
|
| |
Notes |
DAG |
Approved |
no |
|
| |
Call Number |
Admin @ si @ HeS2011 |
Serial |
1736 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Anjan Dutta; Josep Llados; Umapada Pal |
|
| |
Title |
A Bag-of-Paths Based Serialized Subgraph Matching for Symbol Spotting in Line Drawings |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
5th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
6669 |
Issue |
|
Pages |
620-627 |
|
| |
Keywords |
|
|
| |
Abstract |
In this paper we propose an error tolerant subgraph matching algorithm based on bag-of-paths for solving the problem of symbol spotting in line drawings. Bag-of-paths is a factorized representation of graphs where the factorization is done by considering all the acyclic paths between each pair of connected nodes. Similar paths within the whole collection of documents are clustered and organized in a lookup table for efficient indexing. The lookup table contains the index key of each cluster and the corresponding list of locations as a single entry. The mean path of each of the clusters serves as the index key for each table entry. The spotting method is then formulated by a spatial voting scheme to the list of locations of the paths that are decided in terms of search of similar paths that compose the query symbol. Efficient indexing of common substructures helps to reduce the computational burden of usual graph based methods. The proposed method can also be seen as a way to serialize graphs which allows to reduce the complexity of the subgraph isomorphism. We have encoded the paths in terms of both attributed strings and turning functions, and presented a comparative results between them within the symbol spotting framework. Experimentations for matching different shape silhouettes are also reported and the method has been proved to work in noisy environment also. |
|
| |
Address |
Las Palmas de Gran Canaria. Spain |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer Berlin Heidelberg |
Place of Publication |
Berlin |
Editor |
Jordi Vitria; Joao Miguel Raposo; Mario Hernandez |
|
| |
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-21256-7 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IbPRIA |
|
| |
Notes |
DAG |
Approved |
no |
|
| |
Call Number |
Admin @ si @ DLP2011a |
Serial |
1738 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
David Fernandez; Josep Llados; Alicia Fornes |
|
| |
Title |
Handwritten Word Spotting in Old Manuscript Images Using a Pseudo-Structural Descriptor Organized in a Hash Structure |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
5th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
|
| |
Volume |
6669 |
Issue |
|
Pages |
628-635 |
|
| |
Keywords |
|
|
| |
Abstract |
There are lots of historical handwritten documents with information that can be used for several studies and projects. The Document Image Analysis and Recognition community is interested in preserving these documents and extracting all the valuable information from them. Handwritten word-spotting is the pattern classification task which consists in detecting handwriting word images. In this work, we have used a query-by-example formalism: we have matched an input image with one or multiple images from handwritten documents to determine the distance that might indicate a correspondence. We have developed an approach based in characteristic Loci Features stored in a hash structure. Document images of the marriage licences of the Cathedral of Barcelona are used as the benchmarking database. |
|
| |
Address |
Las Palmas de Gran Canaria. Spain |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
Jordi Vitria; Joao Miguel Raposo; Mario Hernandez |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
978-3-642-21256-7 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
IbPRIA |
|
| |
Notes |
DAG |
Approved |
no |
|
| |
Call Number |
Admin @ si @ FLF2011 |
Serial |
1742 |
|
| Permanent link to this record |
