Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[201–210] << 211 212 213 214 215 216 217 218 219 220 >> [221–228]

List View

Citations

Details

	Records
	Author	David Aldavert; Marçal Rusiñol; Ricardo Toledo; Josep Llados
	Title	A Study of Bag-of-Visual-Words Representations for Handwritten Keyword Spotting			Type	Journal Article
	Year	2015	Publication	International Journal on Document Analysis and Recognition	Abbreviated Journal	IJDAR
	Volume	18	Issue	3	Pages	223-234
	Keywords	Bag-of-Visual-Words; Keyword spotting; Handwritten documents; Performance evaluation
	Abstract	The Bag-of-Visual-Words (BoVW) framework has gained popularity among the document image analysis community, specifically as a representation of handwritten words for recognition or spotting purposes. Although in the computer vision field the BoVW method has been greatly improved, most of the approaches in the document image analysis domain still rely on the basic implementation of the BoVW method disregarding such latest refinements. In this paper, we present a review of those improvements and its application to the keyword spotting task. We thoroughly evaluate their impact against a baseline system in the well-known George Washington dataset and compare the obtained results against nine state-of-the-art keyword spotting methods. In addition, we also compare both the baseline and improved systems with the methods presented at the Handwritten Keyword Spotting Competition 2014.
	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	1433-2833	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; ADAS; 600.055; 600.061; 601.223; 600.077; 600.097			Approved	no
	Call Number	Admin @ si @ ART2015			Serial	2679
Permanent link to this record



	Author	Marçal Rusiñol; Josep Llados; Gemma Sanchez
	Title	Symbol Spotting in Vectorized Technical Drawings Through a Lookup Table of Region Strings			Type	Journal Article
	Year	2010	Publication	Pattern Analysis and Applications	Abbreviated Journal	PAA
	Volume	13	Issue	3	Pages	321-331
	Keywords
	Abstract	In this paper, we address the problem of symbol spotting in technical document images applied to scanned and vectorized line drawings. Like any information spotting architecture, our approach has two components. First, symbols are decomposed in primitives which are compactly represented and second a primitive indexing structure aims to efficiently retrieve similar primitives. Primitives are encoded in terms of attributed strings representing closed regions. Similar strings are clustered in a lookup table so that the set median strings act as indexing keys. A voting scheme formulates hypothesis in certain locations of the line drawing image where there is a high presence of regions similar to the queried ones, and therefore, a high probability to find the queried graphical symbol. The proposed approach is illustrated in a framework consisting in spotting furniture symbols in architectural drawings. It has been proved to work even in the presence of noise and distortion introduced by the scanning and raster-to-vector processes.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Verlag	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1433-7541	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ RLS2010			Serial	1165
Permanent link to this record



	Author	Eloi Puertas; Sergio Escalera; Oriol Pujol
	Title	Generalized Multi-scale Stacked Sequential Learning for Multi-class Classification			Type	Journal Article
	Year	2015	Publication	Pattern Analysis and Applications	Abbreviated Journal	PAA
	Volume	18	Issue	2	Pages	247-261
	Keywords	Stacked sequential learning; Multi-scale; Error-correct output codes (ECOC); Contextual classification
	Abstract	In many classification problems, neighbor data labels have inherent sequential relationships. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In this paper, we revise the multi-scale sequential learning approach (MSSL) for applying it in the multi-class case (MMSSL). We introduce the error-correcting output codesframework in the MSSL classifiers and propose a formulation for calculating confidence maps from the margins of the base classifiers. In addition, we propose a MMSSL compression approach which reduces the number of features in the extended data set without a loss in performance. The proposed methods are tested on several databases, showing significant performance improvement compared to classical approaches.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Verlag	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1433-7541	ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ PEP2013			Serial	2251
Permanent link to this record



	Author	Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera
	Title	Combining Local and Global Learners in the Pairwise Multiclass Classification			Type	Journal Article
	Year	2015	Publication	Pattern Analysis and Applications	Abbreviated Journal	PAA
	Volume	18	Issue	4	Pages	845-860
	Keywords	Multiclass classification; Pairwise approach; One-versus-one
	Abstract	Pairwise classification is a well-known class binarization technique that converts a multiclass problem into a number of two-class problems, one problem for each pair of classes. However, in the pairwise technique, nuisance votes of many irrelevant classifiers may result in a wrong class prediction. To overcome this problem, a simple, but efficient method is proposed and evaluated in this paper. The proposed method is based on excluding some classes and focusing on the most probable classes in the neighborhood space, named Local Crossing Off (LCO). This procedure is performed by employing a modified version of standard K-nearest neighbor and large margin nearest neighbor algorithms. The LCO method takes advantage of nearest neighbor classification algorithm because of its local learning behavior as well as the global behavior of powerful binary classifiers to discriminate between two classes. Combining these two properties in the proposed LCO technique will avoid the weaknesses of each method and will increase the efficiency of the whole classification system. On several benchmark datasets of varying size and difficulty, we found that the LCO approach leads to significant improvements using different base learners. The experimental results show that the proposed technique not only achieves better classification accuracy in comparison to other standard approaches, but also is computationally more efficient for tackling classification problems which have a relatively large number of target classes.
	Address
	Corporate Author				Thesis
	Publisher	Springer London	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1433-7541	ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ BGE2014			Serial	2441
Permanent link to this record



	Author	Laura Igual; Joan Carles Soliva; Antonio Hernandez; Sergio Escalera; Xavier Jimenez ; Oscar Vilarroya; Petia Radeva
	Title	A fully-automatic caudate nucleus segmentation of brain MRI: Application in volumetric analysis of pediatric attention-deficit/hyperactivity disorder			Type	Journal Article
	Year	2011	Publication	BioMedical Engineering Online	Abbreviated Journal	BEO
	Volume	10	Issue	105	Pages	1-23
	Keywords	Brain caudate nucleus; segmentation; MRI; atlas-based strategy; Graph Cut framework
	Abstract	Background Accurate automatic segmentation of the caudate nucleus in magnetic resonance images (MRI) of the brain is of great interest in the analysis of developmental disorders. Segmentation methods based on a single atlas or on multiple atlases have been shown to suitably localize caudate structure. However, the atlas prior information may not represent the structure of interest correctly. It may therefore be useful to introduce a more flexible technique for accurate segmentations. Method We present Cau-dateCut: a new fully-automatic method of segmenting the caudate nucleus in MRI. CaudateCut combines an atlas-based segmentation strategy with the Graph Cut energy-minimization framework. We adapt the Graph Cut model to make it suitable for segmenting small, low-contrast structures, such as the caudate nucleus, by defining new energy function data and boundary potentials. In particular, we exploit information concerning the intensity and geometry, and we add supervised energies based on contextual brain structures. Furthermore, we reinforce boundary detection using a new multi-scale edgeness measure. Results We apply the novel CaudateCut method to the segmentation of the caudate nucleus to a new set of 39 pediatric attention-deficit/hyperactivity disorder (ADHD) patients and 40 control children, as well as to a public database of 18 subjects. We evaluate the quality of the segmentation using several volumetric and voxel by voxel measures. Our results show improved performance in terms of segmentation compared to state-of-the-art approaches, obtaining a mean overlap of 80.75%. Moreover, we present a quantitative volumetric analysis of caudate abnormalities in pediatric ADHD, the results of which show strong correlation with expert manual analysis. Conclusion CaudateCut generates segmentation results that are comparable to gold-standard segmentations and which are reliable in the analysis of differentiating neuroanatomical abnormalities between healthy controls and pediatric ADHD.
	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	1475-925X	ISBN		Medium
	Area		Expedition		Conference
	Notes	MILAB;HuPBA			Approved	no
	Call Number	Admin @ si @ ISH2011			Serial	1882
Permanent link to this record



	Author	Antonio Clavelli; Dimosthenis Karatzas
	Title	Text Segmentation in Colour Posters from the Spanish Civil War Era			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	181 - 185
	Keywords
	Abstract	The extraction of textual content from colour documents of a graphical nature is a complicated task. The text can be rendered in any colour, size and orientation while the existence of complex background graphics with repetitive patterns can make its localization and segmentation extremely difficult. Here, we propose a new method for extracting textual content from such colour images that makes no assumption as to the size of the characters, their orientation or colour, while it is tolerant to characters that do not follow a straight baseline. We evaluate this method on a collection of documents with historical connotations: the Posters from the Spanish Civil War.
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ ClK2009			Serial	1172
Permanent link to this record



	Author	Albert Gordo; Ernest Valveny
	Title	A rotation invariant page layout descriptor for document classification and retrieval			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	481–485
	Keywords
	Abstract	Document classification usually requires of structural features such as the physical layout to obtain good accuracy rates on complex documents. This paper introduces a descriptor of the layout and a distance measure based on the cyclic dynamic time warping which can be computed in O(n2). This descriptor is translation invariant and can be easily modified to be scale and rotation invariant. Experiments with this descriptor and its rotation invariant modification are performed on the Girona archives database and compared against another common layout distance, the minimum weight edge cover. The experiments show that these methods outperform the MWEC both in accuracy and speed, particularly on rotated documents.
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ GoV2009a			Serial	1175
Permanent link to this record



	Author	Marçal Rusiñol; Josep Llados
	Title	Logo Spotting by a Bag-of-words Approach for Document Categorization			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	111–115
	Keywords
	Abstract	In this paper we present a method for document categorization which processes incoming document images such as invoices or receipts. The categorization of these document images is done in terms of the presence of a certain graphical logo detected without segmentation. The graphical logos are described by a set of local features and the categorization of the documents is performed by the use of a bag-of-words model. Spatial coherence rules are added to reinforce the correct category hypothesis, aiming also to spot the logo inside the document image. Experiments which demonstrate the effectiveness of this system on a large set of real data are presented.
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ RuL2009b			Serial	1179
Permanent link to this record



	Author	Ricard Coll; Alicia Fornes; Josep Llados
	Title	Graphological Analysis of Handwritten Text Documents for Human Resources Recruitment			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	1081–1085
	Keywords
	Abstract	The use of graphology in recruitment processes has become a popular tool in many human resources companies. This paper presents a model that links features from handwritten images to a number of personality characteristics used to measure applicant aptitudes for the job in a particular hiring scenario. In particular we propose a model of measuring active personality and leadership of the writer. Graphological features that define such a profile are measured in terms of document and script attributes like layout configuration, letter size, shape, slant and skew angle of lines, etc. After the extraction, data is classified using a neural network. An experimental framework with real samples has been constructed to illustrate the performance of the approach.
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ CFL2009			Serial	1221
Permanent link to this record



	Author	Alicia Fornes; Josep Llados; Gemma Sanchez; Horst Bunke
	Title	On the use of textural features for writer identification in old handwritten music scores			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	996 - 1000
	Keywords
	Abstract	Writer identification consists in determining the writer of a piece of handwriting from a set of writers. In this paper we present a system for writer identification in old handwritten music scores which uses only music notation to determine the author. The steps of the proposed system are the following. First of all, the music sheet is preprocessed for obtaining a music score without the staff lines. Afterwards, four different methods for generating texture images from music symbols are applied. Every approach uses a different spatial variation when combining the music symbols to generate the textures. Finally, Gabor filters and Grey-scale Co-ocurrence matrices are used to obtain the features. The classification is performed using a k-NN classifier based on Euclidean distance. The proposed method has been tested on a database of old music scores from the 17th to 19th centuries, achieving encouraging identification rates.
	Address	Barcelona
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ FLS2009b			Serial	1223
Permanent link to this record



	Author	Partha Pratim Roy; Umapada Pal; Josep Llados
	Title	Seal detection and recognition: An approach for document indexing			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	101–105
	Keywords
	Abstract	Reliable indexing of documents having seal instances can be achieved by recognizing seal information. This paper presents a novel approach for detecting and classifying such multi-oriented seals in these documents. First, Hough Transform based methods are applied to extract the seal regions in documents. Next, isolated text characters within these regions are detected. Rotation and size invariant features and a support vector machine based classifier have been used to recognize these detected text characters. Next, for each pair of character, we encode their relative spatial organization using their distance and angular position with respect to the centre of the seal, and enter this code into a hash table. Given an input seal, we recognize the individual text characters and compute the code for pair-wise character based on the relative spatial organization. The code obtained from the input seal helps to retrieve model hypothesis from the hash table. The seal model to which we get maximum hypothesis is selected for the recognition of the input seal. The methodology is tested to index seal in rotation and size invariant environment and we obtained encouraging results.
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ RPL2009b			Serial	1239
Permanent link to this record



	Author	Partha Pratim Roy; Umapada Pal; Josep Llados; Mathieu Nicolas Delalandre
	Title	Multi-Oriented and Multi-Sized Touching Character Segmentation using Dynamic Programming			Type	Conference Article
	Year	2009	Publication	10th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	11–15
	Keywords
	Abstract	In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate a big cavity region at the background portion. Using Convex Hull information, we use these background information to find some initial points to segment a touching string into possible primitive segments (a primitive segment consists of a single character or a part of a character). Next these primitive segments are merged to get optimum segmentation and dynamic programming is applied using total likelihood of characters as the objective function. SVM classifier is used to find the likelihood of a character. To consider multi-oriented touching strings the features used in the SVM are invariant to character orientation. Circular ring and convex hull ring based approach has been used along with angular information of the contour pixels of the character to make the feature rotation invariant. From the experiment, we obtained encouraging results.
	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	1520-5363	ISBN	978-1-4244-4500-4	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	DAG @ dag @ RPL2009a			Serial	1240
Permanent link to this record



	Author	Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados; Thierry Brouard
	Title	Subgraph Spotting Through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images			Type	Conference Article
	Year	2011	Publication	11th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	870-874
	Keywords
	Abstract	We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a relational data structure is mandatory. Our proposed method accomplishes subgraph spotting through graph embedding. We achieve automatic indexation of a graph repository during off-line learning phase, where we (i) break the graphs into 2-node sub graphs (a.k.a. cliques of order 2), which are primitive building-blocks of a graph, (ii) embed the 2-node sub graphs into feature vectors by employing our recently proposed explicit graph embedding technique, (iii) cluster the feature vectors in classes by employing a classic agglomerative clustering technique, (iv) build an index for the graph repository and (v) learn a Bayesian network classifier. The subgraph spotting is achieved during the on-line querying phase, where we (i) break the query graph into 2-node sub graphs, (ii) embed them into feature vectors, (iii) employ the Bayesian network classifier for classifying the query 2-node sub graphs and (iv) retrieve the respective graphs by looking-up in the index of the graph repository. The graphs containing all query 2-node sub graphs form the set of result graphs for the query. Finally, we employ the adjacency matrix of each result graph along with a score function, for spotting the query graph in it. The proposed subgraph spotting method is equally applicable to a wide range of domains, offering ease of query by example (QBE) and granularity of focused retrieval. Experimental results are presented for graphs generated from two repositories of electronic and architectural document images.
	Address	Beijing, China
	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	1520-5363	ISBN	978-1-4577-1350-7	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ LRL2011			Serial	1790
Permanent link to this record



	Author	Anjan Dutta; Josep Llados; Umapada Pal
	Title	Symbol Spotting in Line Drawings Through Graph Paths Hashing			Type	Conference Article
	Year	2011	Publication	11th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	982-986
	Keywords
	Abstract	In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can be efficiently represented by graphs, which ease the accurate localization of the model symbol. Graph paths are the factorized substructures of graphs which enable robust recognition even in the presence of noise and distortion. In our framework, the entire database of the graphical documents is indexed in hash tables by the locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. The spotting method is formulated by a spatial voting scheme to the list of locations of the paths that are decided during the hash table lookup process. We perform detailed experiments with various dataset of line drawings and the results demonstrate the effectiveness and efficiency of the technique.
	Address	Beijing, China
	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	1520-5363	ISBN	978-1-4577-1350-7	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ DLP2011b			Serial	1791
Permanent link to this record



	Author	Lluis Pere de las Heras; Joan Mas; Gemma Sanchez; Ernest Valveny
	Title	Wall Patch-Based Segmentation in Architectural Floorplans			Type	Conference Article
	Year	2011	Publication	11th International Conference on Document Analysis and Recognition	Abbreviated Journal
	Volume		Issue		Pages	1270-1274
	Keywords
	Abstract	Segmentation of architectural floor plans is a challenging task, mainly because of the large variability in the notation between different plans. In general, traditional techniques, usually based on analyzing and grouping structural primitives obtained by vectorization, are only able to handle a reduced range of similar notations. In this paper we propose an alternative patch-based segmentation approach working at pixel level, without need of vectorization. The image is divided into a set of patches and a set of features is extracted for every patch. Then, each patch is assigned to a visual word of a previously learned vocabulary and given a probability of belonging to each class of objects. Finally, a post-process assigns the final label for every pixel. This approach has been applied to the detection of walls on two datasets of architectural floor plans with different notations, achieving high accuracy rates.
	Address	Beiging, China
	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	1520-5363	ISBN	978-0-7695-4520-2	Medium
	Area		Expedition		Conference	ICDAR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ HMS2011a			Serial	1792
Permanent link to this record