Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	1351–1365 of 3413 records found matching your query (RSS):

Search & Display Options

Select All Deselect All

[81–90] << 91 92 93 94 95 96 97 98 99 100 >> [101–110]

List View

Citations

Details

	Records
	Author	Sounak Dey; Anjan Dutta; Suman Ghosh; Ernest Valveny; Josep Llados
	Title	Aligning Salient Objects to Queries: A Multi-modal and Multi-object Image Retrieval Framework			Type	Conference Article
	Year	2018	Publication	14th Asian Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	In this paper we propose an approach for multi-modal image retrieval in multi-labelled images. A multi-modal deep network architecture is formulated to jointly model sketches and text as input query modalities into a common embedding space, which is then further aligned with the image feature space. Our architecture also relies on a salient object detection through a supervised LSTM-based visual attention model learned from convolutional features. Both the alignment between the queries and the image and the supervision of the attention on the images are obtained by generalizing the Hungarian Algorithm using different loss functions. This permits encoding the object-based features and its alignment with the query irrespective of the availability of the co-occurrence of different objects in the training set. We validate the performance of our approach on standard single/multi-object datasets, showing state-of-the art performance in every dataset.
	Address	Perth; Australia; December 2018
	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	ACCV
	Notes	DAG; 600.097; 600.121; 600.129			Approved	no
	Call Number	Admin @ si @ DDG2018a			Serial	3151
Permanent link to this record



	Author	Lasse Martensson; Ekta Vats; Anders Hast; Alicia Fornes
	Title	In Search of the Scribe: Letter Spotting as a Tool for Identifying Scribes in Large Handwritten Text Corpora			Type	Journal
	Year	2019	Publication	Journal for Information Technology Studies as a Human Science	Abbreviated Journal	HUMAN IT
	Volume	14	Issue	2	Pages	95-120
	Keywords	Scribal attribution/ writer identification; digital palaeography; word spotting; mediaeval charters; mediaeval manuscripts
	Abstract	In this article, a form of the so-called word spotting-method is used on a large set of handwritten documents in order to identify those that contain script of similar execution. The point of departure for the investigation is the mediaeval Swedish manuscript Cod. Holm. D 3. The main scribe of this manuscript has yet not been identified in other documents. The current attempt aims at localising other documents that display a large degree of similarity in the characteristics of the script, these being possible candidates for being executed by the same hand. For this purpose, the method of word spotting has been employed, focusing on individual letters, and therefore the process is referred to as letter spotting in the article. In this process, a set of ‘g’:s, ‘h’:s and ‘k’:s have been selected as templates, and then a search has been made for close matches among the mediaeval Swedish charters. The search resulted in a number of charters that displayed great similarities with the manuscript D 3. The used letter spotting method thus proofed to be a very efficient sorting tool localising similar script samples.
	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; 600.097; 600.140; 600.121			Approved	no
	Call Number	Admin @ si @ MVH2019			Serial	3234
Permanent link to this record



	Author	Thanh Ha Do; Oriol Ramos Terrades; Salvatore Tabbone
	Title	DSD: document sparse-based denoising algorithm			Type	Journal Article
	Year	2019	Publication	Pattern Analysis and Applications	Abbreviated Journal	PAA
	Volume	22	Issue	1	Pages	177–186
	Keywords	Document denoising; Sparse representations; Sparse dictionary learning; Document degradation models
	Abstract	In this paper, we present a sparse-based denoising algorithm for scanned documents. This method can be applied to any kind of scanned documents with satisfactory results. Unlike other approaches, the proposed approach encodes noise documents through sparse representation and visual dictionary learning techniques without any prior noise model. Moreover, we propose a precision parameter estimator. Experiments on several datasets demonstrate the robustness of the proposed approach compared to the state-of-the-art methods on document denoising.
	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; 600.097; 600.140; 600.121			Approved	no
	Call Number	Admin @ si @ DRT2019			Serial	3254
Permanent link to this record



	Author	Arnau Baro; Jialuo Chen; Alicia Fornes; Beata Megyesi
	Title	Towards a generic unsupervised method for transcription of encoded manuscripts			Type	Conference Article
	Year	2019	Publication	3rd International Conference on Digital Access to Textual Cultural Heritage	Abbreviated Journal
	Volume		Issue		Pages	73-78
	Keywords	A. Baró, J. Chen, A. Fornés, B. Megyesi.
	Abstract	Historical ciphers, a special type of manuscripts, contain encrypted information, important for the interpretation of our history. The first step towards decipherment is to transcribe the images, either manually or by automatic image processing techniques. Despite the improvements in handwritten text recognition (HTR) thanks to deep learning methodologies, the need of labelled data to train is an important limitation. Given that ciphers often use symbol sets across various alphabets and unique symbols without any transcription scheme available, these supervised HTR techniques are not suitable to transcribe ciphers. In this paper we propose an un-supervised method for transcribing encrypted manuscripts based on clustering and label propagation, which has been successfully applied to community detection in networks. We analyze the performance on ciphers with various symbol sets, and discuss the advantages and drawbacks compared to supervised HTR methods.
	Address	Brussels; May 2019
	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	DATeCH
	Notes	DAG; 600.097; 600.140; 600.121			Approved	no
	Call Number	Admin @ si @ BCF2019			Serial	3276
Permanent link to this record



	Author	Alicia Fornes; Veronica Romero; Arnau Baro; Juan Ignacio Toledo; Joan Andreu Sanchez; Enrique Vidal; Josep Llados
	Title	ICDAR2017 Competition on Information Extraction in Historical Handwritten Records			Type	Conference Article
	Year	2017	Publication	14th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	1389-1394
	Keywords
	Abstract	The extraction of relevant information from historical handwritten document collections is one of the key steps in order to make these manuscripts available for access and searches. In this competition, the goal is to detect the named entities and assign each of them a semantic category, and therefore, to simulate the filling in of a knowledge database. This paper describes the dataset, the tasks, the evaluation metrics, the participants methods and the results.
	Address	Kyoto; Japan; November 2017
	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	ICDAR
	Notes	DAG; 600.097; 601.225; 600.121			Approved	no
	Call Number	Admin @ si @ FRB2017			Serial	3052
Permanent link to this record



	Author	Juan Ignacio Toledo; Sounak Dey; Alicia Fornes; Josep Llados
	Title	Handwriting Recognition by Attribute embedding and Recurrent Neural Networks			Type	Conference Article
	Year	2017	Publication	14th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	1038-1043
	Keywords
	Abstract	Handwriting recognition consists in obtaining the transcription of a text image. Recent word spotting methods based on attribute embedding have shown good performance when recognizing words. However, they are holistic methods in the sense that they recognize the word as a whole (i.e. they find the closest word in the lexicon to the word image). Consequently, these kinds of approaches are not able to deal with out of vocabulary words, which are common in historical manuscripts. Also, they cannot be extended to recognize text lines. In order to address these issues, in this paper we propose a handwriting recognition method that adapts the attribute embedding to sequence learning. Concretely, the method learns the attribute embedding of patches of word images with a convolutional neural network. Then, these embeddings are presented as a sequence to a recurrent neural network that produces the transcription. We obtain promising results even without the use of any kind of dictionary or language model
	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	ICDAR
	Notes	DAG; 600.097; 601.225; 600.121			Approved	no
	Call Number	Admin @ si @ TDF2017			Serial	3055
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes
	Title	Error-tolerant coarse-to-fine matching model for hierarchical graphs			Type	Conference Article
	Year	2017	Publication	11th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition	Abbreviated Journal
	Volume	10310	Issue		Pages	107-117
	Keywords	Graph matching; Hierarchical graph; Graph-based representation; Coarse-to-fine matching
	Abstract	Graph-based representations are effective tools to capture structural information from visual elements. However, retrieving a query graph from a large database of graphs implies a high computational complexity. Moreover, these representations are very sensitive to noise or small changes. In this work, a novel hierarchical graph representation is designed. Using graph clustering techniques adapted from graph-based social media analysis, we propose to generate a hierarchy able to deal with different levels of abstraction while keeping information about the topology. For the proposed representations, a coarse-to-fine matching method is defined. These approaches are validated using real scenarios such as classification of colour images and handwritten word spotting.
	Address	Anacapri; Italy; May 2017
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor	Pasquale Foggia; Cheng-Lin Liu; Mario Vento
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ RLF2017a			Serial	2951
Permanent link to this record



	Author	Pau Riba; Anjan Dutta; Josep Llados; Alicia Fornes; Sounak Dey
	Title	Improving Information Retrieval in Multiwriter Scenario by Exploiting the Similarity Graph of Document Terms			Type	Conference Article
	Year	2017	Publication	14th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	475-480
	Keywords	document terms; information retrieval; affinity graph; graph of document terms; multiwriter; graph diffusion
	Abstract	Information Retrieval (IR) is the activity of obtaining information resources relevant to a questioned information. It usually retrieves a set of objects ranked according to the relevancy to the needed fact. In document analysis, information retrieval receives a lot of attention in terms of symbol and word spotting. However, through decades the community mostly focused either on printed or on single writer scenario, where the state-of-the-art results have achieved reasonable performance on the available datasets. Nevertheless, the existing algorithms do not perform accordingly on multiwriter scenario. A graph representing relations between a set of objects is a structure where each node delineates an individual element and the similarity between them is represented as a weight on the connecting edge. In this paper, we explore different analytics of graphs constructed from words or graphical symbols, such as diffusion, shortest path, etc. to improve the performance of information retrieval methods in multiwriter scenario
	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	ICDAR
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ RDL2017a			Serial	3053
Permanent link to this record



	Author	Anjan Dutta; Pau Riba; Josep Llados; Alicia Fornes
	Title	Pyramidal Stochastic Graphlet Embedding for Document Pattern Classification			Type	Conference Article
	Year	2017	Publication	14th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	33-38
	Keywords	graph embedding; hierarchical graph representation; graph clustering; stochastic graphlet embedding; graph classification
	Abstract	Document pattern classification methods using graphs have received a lot of attention because of its robust representation paradigm and rich theoretical background. However, the way of preserving and the process for delineating documents with graphs introduce noise in the rendition of underlying data, which creates instability in the graph representation. To deal with such unreliability in representation, in this paper, we propose Pyramidal Stochastic Graphlet Embedding (PSGE). Given a graph representing a document pattern, our method first computes a graph pyramid by successively reducing the base graph. Once the graph pyramid is computed, we apply Stochastic Graphlet Embedding (SGE) for each level of the pyramid and combine their embedded representation to obtain a global delineation of the original graph. The consideration of pyramid of graphs rather than just a base graph extends the representational power of the graph embedding, which reduces the instability caused due to noise and distortion. When plugged with support vector machine, our proposed PSGE has outperformed the state-of-the-art results in recognition of handwritten words as well as graphical symbols
	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	ICDAR
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ DRL2017			Serial	3054
Permanent link to this record



	Author	Arnau Baro; Pau Riba; Jorge Calvo-Zaragoza; Alicia Fornes
	Title	Optical Music Recognition by Recurrent Neural Networks			Type	Conference Article
	Year	2017	Publication	14th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages	25-26
	Keywords	Optical Music Recognition; Recurrent Neural Network; Long Short-Term Memory
	Abstract	Optical Music Recognition is the task of transcribing a music score into a machine readable format. Many music scores are written in a single staff, and therefore, they could be treated as a sequence. Therefore, this work explores the use of Long Short-Term Memory (LSTM) Recurrent Neural Networks for reading the music score sequentially, where the LSTM helps in keeping the context. For training, we have used a synthetic dataset of more than 40000 images, labeled at primitive level
	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	ICDAR
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ BRC2017			Serial	3056
Permanent link to this record



	Author	Pau Riba; Anjan Dutta; Josep Llados; Alicia Fornes
	Title	Graph-based deep learning for graphics classification			Type	Conference Article
	Year	2017	Publication	12th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages	29-30
	Keywords
	Abstract	Graph-based representations are a common way to deal with graphics recognition problems. However, previous works were mainly focused on developing learning-free techniques. The success of deep learning frameworks have proved that learning is a powerful tool to solve many problems, however it is not straightforward to extend these methodologies to non euclidean data such as graphs. On the other hand, graphs are a good representational structure for graphical entities. In this work, we present some deep learning techniques that have been proposed in the literature for graph-based representations and we show how they can be used in graphics recognition problems
	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	GREC
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ RDL2017b			Serial	3058
Permanent link to this record



	Author	Arnau Baro; Pau Riba; Alicia Fornes
	Title	A Starting Point for Handwritten Music Recognition			Type	Conference Article
	Year	2018	Publication	1st International Workshop on Reading Music Systems	Abbreviated Journal
	Volume		Issue		Pages	5-6
	Keywords	Optical Music Recognition; Long Short-Term Memory; Convolutional Neural Networks; MUSCIMA++; CVCMUSCIMA
	Abstract	In the last years, the interest in Optical Music Recognition (OMR) has reawakened, especially since the appearance of deep learning. However, there are very few works addressing handwritten scores. In this work we describe a full OMR pipeline for handwritten music scores by using Convolutional and Recurrent Neural Networks that could serve as a baseline for the research community.
	Address	Paris; France; September 2018
	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	WORMS
	Notes	DAG; 600.097; 601.302; 601.330; 600.121			Approved	no
	Call Number	Admin @ si @ BRF2018			Serial	3223
Permanent link to this record



	Author	Arnau Baro; Pau Riba; Jorge Calvo-Zaragoza; Alicia Fornes
	Title	Optical Music Recognition by Long Short-Term Memory Networks			Type	Book Chapter
	Year	2018	Publication	Graphics Recognition. Current Trends and Evolutions	Abbreviated Journal
	Volume	11009	Issue		Pages	81-95
	Keywords	Optical Music Recognition; Recurrent Neural Network; Long ShortTerm Memory
	Abstract	Optical Music Recognition refers to the task of transcribing the image of a music score into a machine-readable format. Many music scores are written in a single staff, and therefore, they could be treated as a sequence. Therefore, this work explores the use of Long Short-Term Memory (LSTM) Recurrent Neural Networks for reading the music score sequentially, where the LSTM helps in keeping the context. For training, we have used a synthetic dataset of more than 40000 images, labeled at primitive level. The experimental results are promising, showing the benefits of our approach.
	Address
	Corporate Author				Thesis
	Publisher	Springer	Place of Publication		Editor	A. Fornes, B. Lamiroy
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-030-02283-9	Medium
	Area		Expedition		Conference	GREC
	Notes	DAG; 600.097; 601.302; 601.330; 600.121			Approved	no
	Call Number	Admin @ si @ BRC2018			Serial	3227
Permanent link to this record



	Author	Arnau Baro; Pau Riba; Jorge Calvo-Zaragoza; Alicia Fornes
	Title	From Optical Music Recognition to Handwritten Music Recognition: a Baseline			Type	Journal Article
	Year	2019	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	123	Issue		Pages	1-8
	Keywords
	Abstract	Optical Music Recognition (OMR) is the branch of document image analysis that aims to convert images of musical scores into a computer-readable format. Despite decades of research, the recognition of handwritten music scores, concretely the Western notation, is still an open problem, and the few existing works only focus on a specific stage of OMR. In this work, we propose a full Handwritten Music Recognition (HMR) system based on Convolutional Recurrent Neural Networks, data augmentation and transfer learning, that can serve as a baseline for the research community.
	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; 600.097; 601.302; 601.330; 600.140; 600.121			Approved	no
	Call Number	Admin @ si @ BRC2019			Serial	3275
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes
	Title	Hierarchical graphs for coarse-to-fine error tolerant matching			Type	Journal Article
	Year	2020	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	134	Issue		Pages	116-124
	Keywords	Hierarchical graph representation; Coarse-to-fine graph matching; Graph-based retrieval
	Abstract	During the last years, graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their ability to capture both structural and appearance-based information. Thus, they provide a greater representational power than classical statistical frameworks. However, graph-based representations leads to high computational complexities usually dealt by graph embeddings or approximated matching techniques. Despite their representational power, they are very sensitive to noise and small variations of the input image. With the aim to cope with the time complexity and the variability present in the generated graphs, in this paper we propose to construct a novel hierarchical graph representation. Graph clustering techniques adapted from social media analysis have been used in order to contract a graph at different abstraction levels while keeping information about the topology. Abstract nodes attributes summarise information about the contracted graph partition. For the proposed representations, a coarse-to-fine matching technique is defined. Hence, small graphs are used as a filtering before more accurate matching methods are applied. This approach has been validated in real scenarios such as classification of colour images or retrieval of handwritten words (i.e. word spotting).
	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; 600.097; 601.302; 603.057; 600.140; 600.121			Approved	no
	Call Number	Admin @ si @ RLF2020			Serial	3349
Permanent link to this record