Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[1–10] << 11 12 13 14 15 16 17 18 19 20 >> [21–30]

List View

Citations

Details

	Records
	Author	Marçal Rusiñol; Josep Llados
	Title	Symbol Spotting in Digital Libraries:Focused Retrieval over Graphic-rich Document Collections			Type	Book Whole
	Year	2010	Publication	Symbol Spotting in Digital Libraries:Focused Retrieval over Graphic-rich Document Collections	Abbreviated Journal
	Volume		Issue		Pages
	Keywords	Focused Retrieval , Graphical Pattern Indexation,Graphics Recognition ,Pattern Recognition , Performance Evaluation , Symbol Description ,Symbol Spotting
	Abstract	The specific problem of symbol recognition in graphical documents requires additional techniques to those developed for character recognition. The most well-known obstacle is the so-called Sayre paradox: Correct recognition requires good segmentation, yet improvement in segmentation is achieved using information provided by the recognition process. This dilemma can be avoided by techniques that identify sets of regions containing useful information. Such symbol-spotting methods allow the detection of symbols in maps or technical drawings without having to fully segment or fully recognize the entire content. This unique text/reference provides a complete, integrated and large-scale solution to the challenge of designing a robust symbol-spotting method for collections of graphic-rich documents. The book examines a number of features and descriptors, from basic photometric descriptors commonly used in computer vision techniques to those specific to graphical shapes, presenting a methodology which can be used in a wide variety of applications. Additionally, readers are supplied with an insight into the problem of performance evaluation of spotting methods. Some very basic knowledge of pattern recognition, document image analysis and graphics recognition is assumed.
	Address
	Corporate Author				Thesis
	Publisher	Springer	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-1-84996-208-7	Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ RuL2010a			Serial	1292
Permanent link to this record



	Author	Ana Garcia Rodriguez; Jorge Bernal; F. Javier Sanchez; Henry Cordova; Rodrigo Garces Duran; Cristina Rodriguez de Miguel; Gloria Fernandez Esparrach
	Title	Polyp fingerprint: automatic recognition of colorectal polyps’ unique features			Type	Journal Article
	Year	2020	Publication	Surgical Endoscopy and other Interventional Techniques	Abbreviated Journal	SEND
	Volume	34	Issue	4	Pages	1887-1889
	Keywords
	Abstract	BACKGROUND: Content-based image retrieval (CBIR) is an application of machine learning used to retrieve images by similarity on the basis of features. Our objective was to develop a CBIR system that could identify images containing the same polyp ('polyp fingerprint'). METHODS: A machine learning technique called Bag of Words was used to describe each endoscopic image containing a polyp in a unique way. The system was tested with 243 white light images belonging to 99 different polyps (for each polyp there were at least two images representing it in two different temporal moments). Images were acquired in routine colonoscopies at Hospital Clínic using high-definition Olympus endoscopes. The method provided for each image the closest match within the dataset. RESULTS: The system matched another image of the same polyp in 221/243 cases (91%). No differences were observed in the number of correct matches according to Paris classification (protruded: 90.7% vs. non-protruded: 91.3%) and size (< 10 mm: 91.6% vs. > 10 mm: 90%). CONCLUSIONS: A CBIR system can match accurately two images containing the same polyp, which could be a helpful aid for polyp image recognition. KEYWORDS: Artificial intelligence; Colorectal polyps; Content-based image retrieval
	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	MV; no menciona			Approved	no
	Call Number	Admin @ si @			Serial	3403
Permanent link to this record



	Author	Miguel Angel Bautista; Xavier Baro; Oriol Pujol; Petia Radeva; Jordi Vitria; Sergio Escalera
	Title	Compact Evolutive Design of Error-Correcting Output Codes			Type	Conference Article
	Year	2010	Publication	Supervised and Unsupervised Ensemble Methods and their Applications in the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases	Abbreviated Journal
	Volume		Issue		Pages	119-128
	Keywords	Ensemble of Dichotomizers; Error-Correcting Output Codes; Evolutionary optimization
	Abstract	The classication of large number of object categories is a challenging trend in the Machine Learning eld. In literature, this is often addressed using an ensemble of classiers. In this scope, the Error-Correcting Output Codes framework has demonstrated to be a powerful tool for the combination of classiers. However, most of the state-of-the-art ECOC approaches use a linear or exponential number of classiers, 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 classiers. Evolutionary computation is used for tuning the parameters of the classiers and looking for the best Minimal ECOC code conguration. The results over several public UCI data sets and a challenging multi-class Computer Vision problem show that the proposed methodology obtains comparable and even better results than state-of-the-art ECOC methodologies with far less number of dichotomizers.
	Address	Barcelona (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		Medium
	Area		Expedition		Conference	SUEMA
	Notes	OR;MILAB;HUPBA;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ BBP2010			Serial	1363
Permanent link to this record



	Author	Pierluigi Casale; Oriol Pujol; Petia Radeva
	Title	Embedding Random Projections in Regularized Gradient Boosting Machines			Type	Conference Article
	Year	2010	Publication	Supervised and Unsupervised Ensemble Methods and their Applications in the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases	Abbreviated Journal
	Volume		Issue		Pages	44–53
	Keywords
	Abstract
	Address	Barcelona (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		Medium
	Area		Expedition		Conference	SUEMA
	Notes	MILAB;HUPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ CPR2010c			Serial	1466
Permanent link to this record



	Author	Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados
	Title	Improving Fuzzy Multilevel Graph Embedding through Feature Selection Technique			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	243-253
	Keywords
	Abstract	Graphs are the most powerful, expressive and convenient data structures but there is a lack of efficient computational tools and algorithms for processing them. The embedding of graphs into numeric vector spaces permits them to access the state-of-the-art computational efficient statistical models and tools. In this paper we take forward our work on explicit graph embedding and present an improvement to our earlier proposed method, named “fuzzy multilevel graph embedding – FMGE”, through feature selection technique. FMGE achieves the embedding of attributed graphs into low dimensional vector spaces by performing a multilevel analysis of graphs and extracting a set of global, structural and elementary level features. Feature selection permits FMGE to select the subset of most discriminating features and to discard the confusing ones for underlying graph dataset. Experimental results for graph classification experimentation on IAM letter, GREC and fingerprint graph databases, show improvement in the performance of FMGE.
	Address
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ LRL2012			Serial	2381
Permanent link to this record



	Author	Volkmar Frinken; Alicia Fornes; Josep Llados; Jean-Marc Ogier
	Title	Bidirectional Language Model for Handwriting Recognition			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	611-619
	Keywords
	Abstract	In order to improve the results of automatically recognized handwritten text, information about the language is commonly included in the recognition process. A common approach is to represent a text line as a sequence. It is processed in one direction and the language information via n-grams is directly included in the decoding. This approach, however, only uses context on one side to estimate a word’s probability. Therefore, we propose a bidirectional recognition in this paper, using distinct forward and a backward language models. By combining decoding hypotheses from both directions, we achieve a significant increase in recognition accuracy for the off-line writer independent handwriting recognition task. Both language models are of the same type and can be estimated on the same corpus. Hence, the increase in recognition accuracy comes without any additional need for training data or language modeling complexity.
	Address	Japan
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ FFL2012			Serial	2057
Permanent link to this record



	Author	Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados
	Title	Hierarchical graph representation for symbol spotting in graphical document images			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	529-538
	Keywords
	Abstract	Symbol spotting can be defined as locating given query symbol in a large collection of graphical documents. In this paper we present a hierarchical graph representation for symbols. This representation allows graph matching methods to deal with low-level vectorization errors and, thus, to perform a robust symbol spotting. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
	Address	Miyajima-Itsukushima, Hiroshima
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ BDJ2012			Serial	2126
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke; Alicia Fornes
	Title	On the Correlation of Graph Edit Distance and L1 Distance in the Attribute Statistics Embedding Space			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	135-143
	Keywords
	Abstract	Graph embeddings in vector spaces aim at assigning a pattern vector to every graph so that the problems of graph classification and clustering can be solved by using data processing algorithms originally developed for statistical feature vectors. An important requirement graph features should fulfil is that they reproduce as much as possible the properties among objects in the graph domain. In particular, it is usually desired that distances between pairs of graphs in the graph domain closely resemble those between their corresponding vectorial representations. In this work, we analyse relations between the edit distance in the graph domain and the L1 distance of the attribute statistics based embedding, for which good classification performance has been reported on various datasets. We show that there is actually a high correlation between the two kinds of distances provided that the corresponding parameter values that account for balancing the weight between node and edge based features are properly selected.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Berlag, Berlin	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2012c			Serial	2167
Permanent link to this record



	Author	Fadi Dornaika; A.Assoum; Bogdan Raducanu
	Title	Automatic Dimensionality Estimation for Manifold Learning through Optimal Feature Selection			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	575-583
	Keywords
	Abstract	A very important aspect in manifold learning is represented by automatic estimation of the intrinsic dimensionality. Unfortunately, this problem has received few attention in the literature of manifold learning. In this paper, we argue that feature selection paradigm can be used to the problem of automatic dimensionality estimation. Besides this, it also leads to improved recognition rates. Our approach for optimal feature selection is based on a Genetic Algorithm. As a case study for manifold learning, we have considered Laplacian Eigenmaps (LE) and Locally Linear Embedding (LLE). The effectiveness of the proposed framework was tested on the face recognition problem. Extensive experiments carried out on ORL, UMIST, Yale, and Extended Yale face data sets confirmed our hypothesis.
	Address
	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-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ DAR2012			Serial	2174
Permanent link to this record



	Author	Bogdan Raducanu; Fadi Dornaika
	Title	Out-of-Sample Embedding by Sparse Representation			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	336-344
	Keywords
	Abstract	A critical aspect of non-linear dimensionality reduction techniques is represented by the construction of the adjacency graph. The difficulty resides in finding the optimal parameters, a process which, in general, is heuristically driven. Recently, sparse representation has been proposed as a non-parametric solution to overcome this problem. In this paper, we demonstrate that this approach not only serves for the graph construction, but also represents an efficient and accurate alternative for out-of-sample embedding. Considering for a case study the Laplacian Eigenmaps, we applied our method to the face recognition problem. Experimental results conducted on some challenging datasets confirmed the robustness of our approach and its superiority when compared to existing techniques.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	OR;MV			Approved	no
	Call Number	Admin @ si @ RaD2012c			Serial	2175
Permanent link to this record



	Author	Zhong Jin; Franck Davoine; Zhen Lou
	Title	An Effective EM Algorithm for PCA Mixture Model			Type	Miscellaneous
	Year	2004	Publication	Structural and Statistical Pattern Recognition, Lecture Notes in Computer Science, 3138:626–634	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract
	Address	Lisbon, 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
	Notes				Approved	no
	Call Number	Admin @ si @ JDL2004			Serial	482
Permanent link to this record



	Author	Fadi Dornaika; Angel Sappa
	Title	Real Time Image Registration for Planar Structure and 3D Sensor Pose Estimation			Type	Book Chapter
	Year	2008	Publication	Stereo Vision	Abbreviated Journal
	Volume	18	Issue		Pages	299–316
	Keywords
	Abstract
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Asim Bhatti
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS			Approved	no
	Call Number	ADAS @ adas @ DoS2008c			Serial	1057
Permanent link to this record



	Author	Ferran Poveda; Debora Gil;Enric Marti
	Title	Multi-resolution DT-MRI cardiac tractography			Type	Conference Article
	Year	2012	Publication	Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges	Abbreviated Journal
	Volume	7746	Issue		Pages	270-277
	Keywords
	Abstract	Even using objective measures from DT-MRI no consensus about myocardial architecture has been achieved so far. Streamlining provides good reconstructions at low level of detail, but falls short to give global abstract interpretations. In this paper, we present a multi-resolution methodology that is able to produce simplified representations of cardiac architecture. Our approach produces a reduced set of tracts that are representative of the main geometric features of myocardial anatomical structure. Experiments show that fiber geometry is preserved along reductions, which validates the simplified model for interpretation of cardiac architecture.
	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-36960-5	Medium
	Area		Expedition		Conference	STACOM
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ PGM2012			Serial	1986
Permanent link to this record



	Author	Debora Gil;Agnes Borras;Ruth Aris;Mariano Vazquez;Pierre Lafortune; Guillame Houzeaux
	Title	What a difference in biomechanics cardiac fiber makes			Type	Conference Article
	Year	2012	Publication	Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges	Abbreviated Journal
	Volume	7746	Issue		Pages	253-260
	Keywords
	Abstract	Computational simulations of the heart are a powerful tool for a comprehensive understanding of cardiac function and its intrinsic relationship with its muscular architecture. Cardiac biomechanical models require a vector field representing the orientation of cardiac fibers. A wrong orientation of the fibers can lead to a non-realistic simulation of the heart functionality. In this paper we explore the impact of the fiber information on the simulated biomechanics of cardiac muscular anatomy. We have used the John Hopkins database to perform a biomechanical simulation using both a synthetic benchmark fiber distribution and the data obtained experimentally from DTI. Results illustrate how differences in fiber orientation affect heart deformation along cardiac cycle.
	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
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-36960-5	Medium
	Area		Expedition		Conference	STACOM
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ GBA2012			Serial	1987
Permanent link to this record



	Author	Simeon Petkov; Adriana Romero; Xavier Carrillo; Petia Radeva; Carlo Gatta
	Title	Robust and accurate diaphragm border detection in cardiac X-Ray angiographies			Type	Conference Article
	Year	2012	Publication	Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges	Abbreviated Journal
	Volume	7746	Issue		Pages	225-234
	Keywords
	Abstract	Workshop STACOM, dins del MICCAI X-ray angiography is the most common imaging modality employed in the diagnosis of coronary diseases prior to or during a catheter-based intervention. The analysis of the patient X-Ray sequence can provide useful information about the degree of arterial stenosis, the myocardial perfusion and other clinical parameters. If the sequence has been acquired to evaluate the perfusion grade, the opacity due to the diaphragm could potentially hinder any kind of visual inspection and make more difficult a computer aided measurements. In this paper we propose an accurate and robust method to automatically identify the diaphragm border in each frame. Quantitative evaluation on a set of 11 sequences shows that the proposed algorithm outperforms previous methods.
	Address	Nice, France
	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	0302-9743	ISBN	978-3-642-36960-5	Medium
	Area		Expedition		Conference	STACOM
	Notes	MILAB			Approved	no
	Call Number	Admin @ si @ PRC2012			Serial	2028
Permanent link to this record