Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[41–50] << 51 52 53 54 55 56 57 58 59 60 >> [61–70]

List View

Citations

Details

	Records
	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	Asma Bensalah; Pau Riba; Alicia Fornes; Josep Llados
	Title	Shoot less and Sketch more: An Efficient Sketch Classification via Joining Graph Neural Networks and Few-shot Learning			Type	Conference Article
	Year	2019	Publication	13th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages	80-85
	Keywords	Sketch classification; Convolutional Neural Network; Graph Neural Network; Few-shot learning
	Abstract	With the emergence of the touchpad devices and drawing tablets, a new era of sketching started afresh. However, the recognition of sketches is still a tough task due to the variability of the drawing styles. Moreover, in some application scenarios there is few labelled data available for training, which imposes a limitation for deep learning architectures. In addition, in many cases there is a need to generate models able to adapt to new classes. In order to cope with these limitations, we propose a method based on few-shot learning and graph neural networks for classifying sketches aiming for an efficient neural model. We test our approach with several databases of sketches, showing promising results.
	Address	Sydney; Australia; September 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	GREC
	Notes	DAG; 600.140; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ BRF2019			Serial	3354
Permanent link to this record



	Author	Pau Torras; Mohamed Ali Souibgui; Jialuo Chen; Alicia Fornes
	Title	A Transcription Is All You Need: Learning to Align through Attention			Type	Conference Article
	Year	2021	Publication	14th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume	12916	Issue		Pages	141–146
	Keywords
	Abstract	Historical ciphered manuscripts are a type of document where graphical symbols are used to encrypt their content instead of regular text. Nowadays, expert transcriptions can be found in libraries alongside the corresponding manuscript images. However, those transcriptions are not aligned, so these are barely usable for training deep learning-based recognition methods. To solve this issue, we propose a method to align each symbol in the transcript of an image with its visual representation by using an attention-based Sequence to Sequence (Seq2Seq) model. The core idea is that, by learning to recognise symbols sequence within a cipher line image, the model also identifies their position implicitly through an attention mechanism. Thus, the resulting symbol segmentation can be later used for training algorithms. The experimental evaluation shows that this method is promising, especially taking into account the small size of the cipher dataset.
	Address	Virtual; September 2021
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	GREC
	Notes	DAG; 602.230; 600.140; 600.121			Approved	no
	Call Number	Admin @ si @ TSC2021			Serial	3619
Permanent link to this record



	Author	Oscar Amoros; Sergio Escalera; Anna Puig
	Title	Adaboost GPU-based Classifier for Direct Volume Rendering			Type	Conference Article
	Year	2011	Publication	International Conference on Computer Graphics Theory and Applications	Abbreviated Journal
	Volume		Issue		Pages	215-219
	Keywords
	Abstract	In volume visualization, the voxel visibitity and materials are carried out through an interactive editing of Transfer Function. In this paper, we present a two-level GPU-based labeling method that computes in times of rendering a set of labeled structures using the Adaboost machine learning classifier. In a pre-processing step, Adaboost trains a binary classifier from a pre-labeled dataset and, in each sample, takes into account a set of features. This binary classifier is a weighted combination of weak classifiers, which can be expressed as simple decision functions estimated on a single feature values. Then, at the testing stage, each weak classifier is independently applied on the features of a set of unlabeled samples. We propose an alternative representation of these classifiers that allow a GPU-based parallelizated testing stage embedded into the visualization pipeline. The empirical results confirm the OpenCL-based classification of biomedical datasets as a tough problem where an opportunity for further research emerges.
	Address	Algarve, Portugal
	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	GRAPP
	Notes	MILAB; HuPBA			Approved	no
	Call Number	Admin @ si @ AEP2011			Serial	1774
Permanent link to this record



	Author	Mikhail Mozerov; Ariel Amato; Xavier Roca
	Title	Occlusion Handling in Trinocular Stereo using Composite Disparity Space Image			Type	Conference Article
	Year	2009	Publication	19th International Conference on Computer Graphics and Vision	Abbreviated Journal
	Volume		Issue		Pages	69–73
	Keywords
	Abstract	In this paper we propose a method that smartly improves occlusion handling in stereo matching using trinocular stereo. The main idea is based on the assumption that any occluded region in a matched stereo pair (middle-left images) in general is not occluded in the opposite matched pair (middle-right images). Then two disparity space images (DSI) can be merged in one composite DSI. The proposed integration differs from the known approach that uses a cumulative cost. A dense disparity map is obtained with a global optimization algorithm using the proposed composite DSI. The experimental results are evaluated on the Middlebury data set, showing high performance of the proposed algorithm especially in the occluded regions. One of the top positions in the rank of the Middlebury website confirms the performance of our method to be competitive with the best stereo matching.
	Address	Moscow (Russia)
	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-5-317-02975-3	Medium
	Area		Expedition		Conference	GRAPHICON
	Notes	ISE			Approved	no
	Call Number	ISE @ ise @ MAR2009b			Serial	1207
Permanent link to this record



	Author	Lei Kang; Juan Ignacio Toledo; Pau Riba; Mauricio Villegas; Alicia Fornes; Marçal Rusiñol
	Title	Convolve, Attend and Spell: An Attention-based Sequence-to-Sequence Model for Handwritten Word Recognition			Type	Conference Article
	Year	2018	Publication	40th German Conference on Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	459-472
	Keywords
	Abstract	This paper proposes Convolve, Attend and Spell, an attention based sequence-to-sequence model for handwritten word recognition. The proposed architecture has three main parts: an encoder, consisting of a CNN and a bi-directional GRU, an attention mechanism devoted to focus on the pertinent features and a decoder formed by a one-directional GRU, able to spell the corresponding word, character by character. Compared with the recent state-of-the-art, our model achieves competitive results on the IAM dataset without needing any pre-processing step, predefined lexicon nor language model. Code and additional results are available in https://github.com/omni-us/research-seq2seq-HTR.
	Address	Stuttgart; Germany; October 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	GCPR
	Notes	DAG; 600.097; 603.057; 302.065; 601.302; 600.084; 600.121; 600.129			Approved	no
	Call Number	Admin @ si @ KTR2018			Serial	3167
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Dimensionality Reduction for Graph of Words Embedding			Type	Conference Article
	Year	2011	Publication	8th IAPR-TC-15 International Workshop. Graph-Based Representations in Pattern Recognition	Abbreviated Journal
	Volume	6658	Issue		Pages	22-31
	Keywords
	Abstract	The Graph of Words Embedding consists in mapping every graph of a given dataset to a feature vector by counting unary and binary relations between node attributes of the graph. While it shows good properties in classification problems, it suffers from high dimensionality and sparsity. These two issues are addressed in this article. Two well-known techniques for dimensionality reduction, kernel principal component analysis (kPCA) and independent component analysis (ICA), are applied to the embedded graphs. We discuss their performance compared to the classification of the original vectors on three different public databases of graphs.
	Address	Münster, Germany
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Xiaoyi Jiang; Miquel Ferrer; Andrea Torsello
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-20843-0	Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2011a			Serial	1743
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta
	Title	Large-scale Graph Indexing using Binary Embeddings of Node Contexts			Type	Conference Article
	Year	2015	Publication	10th IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition	Abbreviated Journal
	Volume	9069	Issue		Pages	208-217
	Keywords	Graph matching; Graph indexing; Application in document analysis; Word spotting; Binary embedding
	Abstract	Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations in terms of feature vectors. Retrieving a query graph from a large dataset of graphs has the drawback of the high computational complexity required to compare the query and the target graphs. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. In this paper we propose a fast indexation formalism for graph retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Hence, each attribute counts the length of a walk of order k originated in a vertex with label l. Each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in a handwritten word spotting scenario in images of historical documents.
	Address	Beijing; China; May 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor	C.-L.Liu; B.Luo; W.G.Kropatsch; J.Cheng
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-319-18223-0	Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG; 600.061; 602.006; 600.077			Approved	no
	Call Number	Admin @ si @ RLF2015a			Serial	2618
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	Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke
	Title	A Recursive Embedding Approach to Median Graph Computation			Type	Conference Article
	Year	2009	Publication	7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition	Abbreviated Journal
	Volume	5534	Issue		Pages	113–123
	Keywords
	Abstract	The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
	Address	Venice, Italy
	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-02123-7	Medium
	Area		Expedition		Conference	GBR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FKV2009			Serial	1173
Permanent link to this record



	Author	Andreas Fischer; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke
	Title	A Fast Matching Algorithm for Graph-Based Handwriting Recognition			Type	Conference Article
	Year	2013	Publication	9th IAPR – TC15 Workshop on Graph-based Representation in Pattern Recognition	Abbreviated Journal
	Volume	7877	Issue		Pages	194-203
	Keywords
	Abstract	The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical classification by means of vector space embedding. This approach has shown a high performance in terms of accuracy but had shortcomings in terms of computational speed. The time complexity of the Hungarian algorithm that is used to approximate the edit distance between two handwriting graphs is demanding for a real-world scenario. In this paper, we propose a faster graph matching algorithm which is derived from the Hausdorff distance. On the historical Parzival database it is demonstrated that the proposed method achieves a speedup factor of 12.9 without significant loss in recognition accuracy.
	Address	Vienna; Austria; May 2013
	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-38220-8	Medium
	Area		Expedition		Conference	GBR
	Notes	DAG; 600.045; 605.203			Approved	no
	Call Number	Admin @ si @ FSF2013			Serial	2294
Permanent link to this record



	Author	Aura Hernandez-Sabate; Lluis Albarracin; Daniel Calvo; Nuria Gorgorio
	Title	EyeMath: Identifying Mathematics Problem Solving Processes in a RTS Video Game			Type	Conference Article
	Year	2016	Publication	5th International Conference Games and Learning Alliance	Abbreviated Journal
	Volume	10056	Issue		Pages	50-59
	Keywords	Simulation environment; Automated Driving; Driver-Vehicle interaction
	Abstract	Photorealistic virtual environments are crucial for developing and testing automated driving systems in a safe way during trials. As commercially available simulators are expensive and bulky, this paper presents a low-cost, extendable, and easy-to-use (LEE) virtual environment with the aim to highlight its utility for level 3 driving automation. In particular, an experiment is performed using the presented simulator to explore the influence of different variables regarding control transfer of the car after the system was driving autonomously in a highway scenario. The results show that the speed of the car at the time when the system needs to transfer the control to the human driver is critical.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	GALA
	Notes	ADAS;IAM;			Approved	no
	Call Number	HAC2016			Serial	2864
Permanent link to this record



	Author	Laura Lopez-Fuentes; Sebastia Massanet; Manuel Gonzalez-Hidalgo
	Title	Image vignetting reduction via a maximization of fuzzy entropy			Type	Conference Article
	Year	2017	Publication	IEEE International Conference on Fuzzy Systems	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	In many computer vision applications, vignetting is an undesirable effect which must be removed in a pre-processing step. Recently, an algorithm for image vignetting correction has been presented by means of a minimization of log-intensity entropy. This method relies on an increase of the entropy of the image when it is affected with vignetting. In this paper, we propose a novel algorithm to reduce image vignetting via a maximization of the fuzzy entropy of the image. Fuzzy entropy quantifies the fuzziness degree of a fuzzy set and its value is also modified by the presence of vignetting. The experimental results show that this novel algorithm outperforms in most cases the algorithm based on the minimization of log-intensity entropy both from the qualitative and the quantitative point of view.
	Address	Napoles; Italia; July 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	FUZZ-IEEE
	Notes	LAMP; 600.120			Approved	no
	Call Number	Admin @ si @ LMG2017			Serial	2972
Permanent link to this record



	Author	Oscar Camara; Estanislao Oubel; Gemma Piella; Simone Balocco; Mathieu De Craene; Alejandro F. Frangi
	Title	Multi-sequence Registration of Cine, Tagged and Delay-Enhancement MRI with Shift Correction and Steerable Pyramid-Based Detagging			Type	Conference Article
	Year	2009	Publication	5th International Conference on Functional Imaging and Modeling of the Heart	Abbreviated Journal
	Volume	5528	Issue		Pages	330–338
	Keywords
	Abstract	In this work, we present a registration framework for cardiac cine MRI (cMRI), tagged (tMRI) and delay-enhancement MRI (deMRI), where the two main issues to find an accurate alignment between these images have been taking into account: the presence of tags in tMRI and respiration artifacts in all sequences. A steerable pyramid image decomposition has been used for detagging purposes since it is suitable to extract high-order oriented structures by directional adaptive filtering. Shift correction of cMRI is achieved by firstly maximizing the similarity between the Long Axis and Short Axis cMRI. Subsequently, these shift-corrected images are used as target images in a rigid registration procedure with their corresponding tMRI/deMRI in order to correct their shift. The proposed registration framework has been evaluated by 840 registration tests, considerably improving the alignment of the MR images (mean RMS error of 2.04mm vs. 5.44mm).
	Address	Nice, France
	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-01931-9	Medium
	Area		Expedition		Conference	FIMH
	Notes	MILAB			Approved	no
	Call Number	BCNPCL @ bcnpcl @ COP2009			Serial	1255
Permanent link to this record



	Author	Debora Gil; Aura Hernandez-Sabate; Antoni Carol; Oriol Rodriguez; Petia Radeva
	Title	A Deterministic-Statistic Adventitia Detection in IVUS Images			Type	Conference Article
	Year	2005	Publication	3rd International workshop on International Workshop on Functional Imaging and Modeling of the Heart	Abbreviated Journal
	Volume		Issue		Pages	65-74
	Keywords	Electron microscopy; Unbending; 2D crystal; Interpolation; Approximation
	Abstract	Plaque analysis in IVUS planes needs accurate intima and adventitia models. Large variety in adventitia descriptors difficulties its detection and motivates using a classification strategy for selecting points on the structure. Whatever the set of descriptors used, the selection stage suffers from fake responses due to noise and uncompleted true curves. In order to smooth background noise while strengthening responses, we apply a restricted anisotropic filter that homogenizes grey levels along the image significant structures. Candidate points are extracted by means of a simple semi supervised adaptive classification of the filtered image response to edge and calcium detectors. The final model is obtained by interpolating the former line segments with an anisotropic contour closing technique based on functional extension principles.
	Address	Barcelona; June 2005
	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	FIMH
	Notes	IAM;MILAB			Approved	no
	Call Number	IAM @ iam @ RMF2005			Serial	1524
Permanent link to this record