Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[21–30] << 31 32 33 34 35 36 37 38 39 40 >> [41–50]

List View

Citations

Details

	Records
	Author	Daniel Hernandez; Antonio Espinosa; David Vazquez; Antonio Lopez; Juan C. Moure
	Title	3D Perception With Slanted Stixels on GPU			Type	Journal Article
	Year	2021	Publication	IEEE Transactions on Parallel and Distributed Systems	Abbreviated Journal	TPDS
	Volume	32	Issue	10	Pages	2434-2447
	Keywords	Daniel Hernandez-Juarez; Antonio Espinosa; David Vazquez; Antonio M. Lopez; Juan C. Moure
	Abstract	This article presents a GPU-accelerated software design of the recently proposed model of Slanted Stixels, which represents the geometric and semantic information of a scene in a compact and accurate way. We reformulate the measurement depth model to reduce the computational complexity of the algorithm, relying on the confidence of the depth estimation and the identification of invalid values to handle outliers. The proposed massively parallel scheme and data layout for the irregular computation pattern that corresponds to a Dynamic Programming paradigm is described and carefully analyzed in performance terms. Performance is shown to scale gracefully on current generation embedded GPUs. We assess the proposed methods in terms of semantic and geometric accuracy as well as run-time performance on three publicly available benchmark datasets. Our approach achieves real-time performance with high accuracy for 2048 × 1024 image sizes and 4 × 4 Stixel resolution on the low-power embedded GPU of an NVIDIA Tegra Xavier.
	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	ADAS; 600.124; 600.118			Approved	no
	Call Number	Admin @ si @ HEV2021			Serial	3561
Permanent link to this record



	Author	Oriol Pujol; David Masip
	Title	Geometry-Based Ensembles: Toward a Structural Characterization of the Classification Boundary			Type	Journal Article
	Year	2009	Publication	IEEE Transactions on Pattern Analysis and Machine Intelligence	Abbreviated Journal	TPAMI
	Volume	31	Issue	6	Pages	1140–1146
	Keywords
	Abstract	This article introduces a novel binary discriminative learning technique based on the approximation of the non-linear decision boundary by a piece-wise linear smooth additive model. The decision border is geometrically defined by means of the characterizing boundary points – points that belong to the optimal boundary under a certain notion of robustness. Based on these points, a set of locally robust linear classifiers is defined and assembled by means of a Tikhonov regularized optimization procedure in an additive model to create a final lambda-smooth decision rule. As a result, a very simple and robust classifier with a strong geometrical meaning and non-linear behavior is obtained. The simplicity of the method allows its extension to cope with some of nowadays machine learning challenges, such as online learning, large scale learning or parallelization, with linear computational complexity. We validate our approach on the UCI database. Finally, we apply our technique in online and large scale scenarios, and in six real life computer vision and pattern recognition problems: gender recognition, intravascular ultrasound tissue classification, speed traffic sign detection, Chagas' disease severity detection, clef classification and action recognition using a 3D accelerometer data. The results are promising and this paper opens a line of research that deserves further attention
	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	OR;HuPBA;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ PuM2009			Serial	1252
Permanent link to this record



	Author	Wenjuan Gong; Andrew Bagdanov; Xavier Roca; Jordi Gonzalez
	Title	Automatic Key Pose Selection for 3D Human Action Recognition			Type	Conference Article
	Year	2010	Publication	6th International Conference on Articulated Motion and Deformable Objects	Abbreviated Journal
	Volume	6169	Issue		Pages	290–299
	Keywords
	Abstract	This article describes a novel approach to the modeling of human actions in 3D. The method we propose is based on a “bag of poses” model that represents human actions as histograms of key-pose occurrences over the course of a video sequence. Actions are first represented as 3D poses using a sequence of 36 direction cosines corresponding to the angles 12 joints form with the world coordinate frame in an articulated human body model. These pose representations are then projected to three-dimensional, action-specific principal eigenspaces which we refer to as aSpaces. We introduce a method for key-pose selection based on a local-motion energy optimization criterion and we show that this method is more stable and more resistant to noisy data than other key-poses selection criteria for action recognition.
	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	0302-9743	ISBN	978-3-642-14060-0	Medium
	Area		Expedition		Conference	AMDO
	Notes	ISE			Approved	no
	Call Number	DAG @ dag @ GBR2010			Serial	1317
Permanent link to this record



	Author	Wenjuan Gong; Jordi Gonzalez; Joao Manuel R. S. Taveres; Xavier Roca
	Title	A New Image Dataset on Human Interactions			Type	Conference Article
	Year	2012	Publication	7th Conference on Articulated Motion and Deformable Objects	Abbreviated Journal
	Volume	7378	Issue		Pages	204-209
	Keywords
	Abstract	This article describes a new collection of still image dataset which are dedicated to interactions between people. Human action recognition from still images have been a hot topic recently, but most of them are actions performed by a single person, like running, walking, riding bikes, phoning and so on and there is no interactions between people in one image. The dataset collected in this paper are concentrating on human interaction between two people aiming to explore this new topic in the research area of action recognition from still images.
	Address	Mallorca
	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-31566-4	Medium
	Area		Expedition		Conference	AMDO
	Notes	ISE			Approved	no
	Call Number	Admin @ si @ GGT2012			Serial	2030
Permanent link to this record



	Author	Hans Stadthagen-Gonzalez; Luis Lopez; M. Carmen Parafita; C. Alejandro Parraga
	Title	Using two-alternative forced choice tasks and Thurstone law of comparative judgments for code-switching research			Type	Book Chapter
	Year	2018	Publication	Linguistic Approaches to Bilingualism	Abbreviated Journal
	Volume		Issue		Pages	67-97
	Keywords	two-alternative forced choice and Thurstone's law; acceptability judgment; code-switching
	Abstract	This article argues that 2-alternative forced choice tasks and Thurstone’s law of comparative judgments (Thurstone, 1927) are well suited to investigate code-switching competence by means of acceptability judgments. We compare this method with commonly used Likert scale judgments and find that the 2-alternative forced choice task provides granular details that remain invisible in a Likert scale experiment. In order to compare and contrast both methods, we examined the syntactic phenomenon usually referred to as the Adjacency Condition (AC) (apud Stowell, 1981), which imposes a condition of adjacency between verb and object. Our interest in the AC comes from the fact that it is a subtle feature of English grammar which is absent in Spanish, and this provides an excellent springboard to create minimal code-switched pairs that allow us to formulate a clear research question that can be tested using both methods.
	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	NEUROBIT; no menciona			Approved	no
	Call Number	Admin @ si @ SLP2018			Serial	2994
Permanent link to this record



	Author	Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny
	Title	Word Spotting and Recognition with Embedded Attributes			Type	Journal Article
	Year	2014	Publication	IEEE Transactions on Pattern Analysis and Machine Intelligence	Abbreviated Journal	TPAMI
	Volume	36	Issue	12	Pages	2552 - 2566
	Keywords
	Abstract	This article addresses the problems of word spotting and word recognition on images. In word spotting, the goal is to find all instances of a query word in a dataset of images. In recognition, the goal is to recognize the content of the word image, usually aided by a dictionary or lexicon. We describe an approach in which both word images and text strings are embedded in a common vectorial subspace. This is achieved by a combination of label embedding and attributes learning, and a common subspace regression. In this subspace, images and strings that represent the same word are close together, allowing one to cast recognition and retrieval tasks as a nearest neighbor problem. Contrary to most other existing methods, our representation has a fixed length, is low dimensional, and is very fast to compute and, especially, to compare. We test our approach on four public datasets of both handwritten documents and natural images showing results comparable or better than the state-of-the-art on spotting and recognition tasks.
	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	0162-8828	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.056; 600.045; 600.061; 602.006; 600.077			Approved	no
	Call Number	Admin @ si @ AGF2014a			Serial	2483
Permanent link to this record



	Author	Victor Ponce; Baiyu Chen; Marc Oliu; Ciprian Corneanu; Albert Clapes; Isabelle Guyon; Xavier Baro; Hugo Jair Escalante; Sergio Escalera
	Title	ChaLearn LAP 2016: First Round Challenge on First Impressions – Dataset and Results			Type	Conference Article
	Year	2016	Publication	14th European Conference on Computer Vision Workshops	Abbreviated Journal
	Volume		Issue		Pages
	Keywords	Behavior Analysis; Personality Traits; First Impressions
	Abstract	This paper summarizes the ChaLearn Looking at People 2016 First Impressions challenge data and results obtained by the teams in the rst round of the competition. The goal of the competition was to automatically evaluate ve \apparent“ personality traits (the so-called \Big Five”) from videos of subjects speaking in front of a camera, by using human judgment. In this edition of the ChaLearn challenge, a novel data set consisting of 10,000 shorts clips from YouTube videos has been made publicly available. The ground truth for personality traits was obtained from workers of Amazon Mechanical Turk (AMT). To alleviate calibration problems between workers, we used pairwise comparisons between videos, and variable levels were reconstructed by tting a Bradley-Terry-Luce model with maximum likelihood. The CodaLab open source platform was used for submission of predictions and scoring. The competition attracted, over a period of 2 months, 84 participants who are grouped in several teams. Nine teams entered the nal phase. Despite the diculty of the task, the teams made great advances in this round of the challenge.
	Address	Amsterdam; The Netherlands; October 2016
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	ECCVW
	Notes	HuPBA;MV; 600.063			Approved	no
	Call Number	Admin @ si @ PCP2016			Serial	2828
Permanent link to this record



	Author	Debora Gil; Jaume Garcia; Ruth Aris; Guillaume Houzeaux; Manuel Vazquez
	Title	A Riemmanian approach to cardiac fiber architecture modelling			Type	Conference Article
	Year	2009	Publication	1st International Conference on Mathematical & Computational Biomedical Engineering	Abbreviated Journal
	Volume		Issue		Pages	59-62
	Keywords	cardiac fiber architecture; diffusion tensor magnetic resonance imaging; differential (Rie- mannian) geometry.
	Abstract	There is general consensus that myocardial fiber architecture should be modelled in order to fully understand the electromechanical properties of the Left Ventricle (LV). Diffusion Tensor magnetic resonance Imaging (DTI) is the reference image modality for rapid measurement of fiber orientations by means of the tensor principal eigenvectors. In this work, we present a mathematical framework for across subject comparison of the local geometry of the LV anatomy including the fiber architecture from the statistical analysis of DTI studies. We use concepts of differential geometry for defining a parametric domain suitable for statistical analysis of a low number of samples. We use Riemannian metrics to define a consistent computation of DTI principal eigenvector modes of variation. Our framework has been applied to build an atlas of the LV fiber architecture from 7 DTI normal canine hearts.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication	Swansea (UK)	Editor	Nithiarasu, R.L.R.V.L.
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	CMBE
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ FGA2009			Serial	1520
Permanent link to this record



	Author	Anjan Dutta
	Title	Inexact Subgraph Matching Applied to Symbol Spotting in Graphical Documents			Type	Book Whole
	Year	2014	Publication	PhD Thesis, Universitat Autonoma de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	There is a resurgence in the use of structural approaches in the usual object recognition and retrieval problem. Graph theory, in particular, graph matching plays a relevant role in that. Specifically, the detection of an object (or a part of that) in an image in terms of structural features can be formulated as a subgraph matching. Subgraph matching is a challenging task. Specially due to the presence of outliers most of the graph matching algorithms do not perform well in subgraph matching scenario. Also exact subgraph isomorphism has proven to be an NP-complete problem. So naturally, in graph matching community, there are lot of efforts addressing the problem of subgraph matching within suboptimal bound. Most of them work with approximate algorithms that try to get an inexact solution in estimated way. In addition, usual recognition must cope with distortion. Inexact graph matching consists in finding the best isomorphism under a similarity measure. Theoretically this thesis proposes algorithms for solving subgraph matching in an approximate and inexact way. We consider the symbol spotting problem on graphical documents or line drawings from application point of view. This is a well known problem in the graphics recognition community. It can be further applied for indexing and classification of documents based on their contents. The structural nature of this kind of documents easily motivates one for giving a graph based representation. So the symbol spotting problem on graphical documents can be considered as a subgraph matching problem. The main challenges in this application domain is the noise and distortions that might come during the usage, digitalization and raster to vector conversion of those documents. Apart from that computer vision nowadays is not any more confined within a limited number of images. So dealing a huge number of images with graph based method is a further challenge. In this thesis, on one hand, we have worked on efficient and robust graph representation to cope with the noise and distortions coming from documents. On the other hand, we have worked on different graph based methods and framework to solve the subgraph matching problem in a better approximated way, which can also deal with considerable number of images. Firstly, we propose a symbol spotting method by hashing serialized subgraphs. Graph serialization allows to create factorized substructures such as graph paths, which can be organized in hash tables depending on the structural similarities of the serialized subgraphs. The involvement of hashing techniques helps to reduce the search space substantially and speeds up the spotting procedure. Secondly, we introduce contextual similarities based on the walk based propagation on tensor product graph. These contextual similarities involve higher order information and more reliable than pairwise similarities. We use these higher order similarities to formulate subgraph matching as a node and edge selection problem in the tensor product graph. Thirdly, we propose near convex grouping to form near convex region adjacency graph which eliminates the limitations of traditional region adjacency graph representation for graphic recognition. Fourthly, we propose a hierarchical graph representation by simplifying/correcting the structural errors to create a hierarchical graph of the base graph. Later these hierarchical graph structures are matched with some graph matching methods. Apart from that, in this thesis we have provided an overall experimental comparison of all the methods and some of the state-of-the-art methods. Furthermore, some dataset models have also been proposed.
	Address
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Josep Llados;Umapada Pal
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-84-940902-4-0	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.077			Approved	no
	Call Number	Admin @ si @ Dut2014			Serial	2465
Permanent link to this record



	Author	F.Guirado; Ana Ripoll; C.Roig; Aura Hernandez-Sabate; Emilio Luque
	Title	Exploiting Throughput for Pipeline Execution in Streaming Image Processing Applications			Type	Book Chapter
	Year	2006	Publication	Euro-Par 2006 Parallel Processing	Abbreviated Journal	LNCS
	Volume	4128	Issue		Pages	1095-1105
	Keywords	12th International Euro–Par Conference
	Abstract	There is a large range of image processing applications that act on an input sequence of image frames that are continuously received. Throughput is a key performance measure to be optimized when execu- ting them. In this paper we propose a new task replication methodology for optimizing throughput for an image processing application in the field of medicine. The results show that by applying the proposed methodo- logy we are able to achieve the desired throughput in all cases, in such a way that the input frames can be processed at any given rate.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Verlag Berlin Heidelberg	Place of Publication	Dresden, Germany (European Union)	Editor	UAB; W, E.N.; et al.
	Language		Summary Language		Original Title
	Series Editor		Series Title	Lecture Notes In Computer Science	Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	Euro–Par
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ GRR2006a			Serial	1542
Permanent link to this record



	Author	Vacit Oguz Yazici; Joost Van de Weijer; Arnau Ramisa
	Title	Color Naming for Multi-Color Fashion Items			Type	Conference Article
	Year	2018	Publication	6th World Conference on Information Systems and Technologies	Abbreviated Journal
	Volume	747	Issue		Pages	64-73
	Keywords	Deep learning; Color; Multi-label
	Abstract	There exists a significant amount of research on color naming of single colored objects. However in reality many fashion objects consist of multiple colors. Currently, searching in fashion datasets for multi-colored objects can be a laborious task. Therefore, in this paper we focus on color naming for images with multi-color fashion items. We collect a dataset, which consists of images which may have from one up to four colors. We annotate the images with the 11 basic colors of the English language. We experiment with several designs for deep neural networks with different losses. We show that explicitly estimating the number of colors in the fashion item leads to improved results.
	Address	Naples; March 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	WORLDCIST
	Notes	LAMP; 600.109; 601.309; 600.120			Approved	no
	Call Number	Admin @ si @ YWR2018			Serial	3161
Permanent link to this record



	Author	Umapada Pal; Partha Pratim Roy; N. Tripathya; Josep Llados
	Title	Multi-oriented Bangla and Devnagari text recognition			Type	Journal Article
	Year	2010	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	43	Issue	12	Pages	4124–4136
	Keywords
	Abstract	There are printed complex documents where text lines of a single page may have different orientations or the text lines may be curved in shape. As a result, it is difficult to detect the skew of such documents and hence character segmentation and recognition of such documents are a complex task. In this paper, using background and foreground information we propose a novel scheme towards the recognition of Indian complex documents of Bangla and Devnagari script. In Bangla and Devnagari documents usually characters in a word touch and they form cavity regions. To take care of these cavity regions, background information of such documents is used. Convex hull and water reservoir principle have been applied for this purpose. Here, at first, the characters are segmented from the documents using the background information of the text. Next, individual characters are recognized using rotation invariant features obtained from the foreground part of the characters. For character segmentation, at first, writing mode of a touching component (word) is detected using water reservoir principle based features. Next, depending on writing mode and the reservoir base-region of the touching component, a set of candidate envelope points is then selected from the contour points of the component. Based on these candidate points, the touching component is finally segmented into individual characters. For recognition of multi-sized/multi-oriented characters the features are computed from different angular information obtained from the external and internal contour pixels of the characters. These angular information are computed in such a way that they do not depend on the size and rotation of the characters. Circular and convex hull rings have been used to divide a character into smaller zones to get zone-wise features for higher recognition results. We combine circular and convex hull features to improve the results and these features are fed to support vector machines (SVM) for recognition. From our experiment we obtained recognition results of 99.18% (98.86%) accuracy when tested on 7515 (7874) Devnagari (Bangla) characters.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier	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			Approved	no
	Call Number	DAG @ dag @ PRT2010			Serial	1337
Permanent link to this record



	Author	Graham D. Finlayson; Javier Vazquez; Sabine Süsstrunk; Maria Vanrell
	Title	Spectral sharpening by spherical sampling			Type	Journal Article
	Year	2012	Publication	Journal of the Optical Society of America A	Abbreviated Journal	JOSA A
	Volume	29	Issue	7	Pages	1199-1210
	Keywords
	Abstract	There are many works in color that assume illumination change can be modeled by multiplying sensor responses by individual scaling factors. The early research in this area is sometimes grouped under the heading “von Kries adaptation”: the scaling factors are applied to the cone responses. In more recent studies, both in psychophysics and in computational analysis, it has been proposed that scaling factors should be applied to linear combinations of the cones that have narrower support: they should be applied to the so-called “sharp sensors.” In this paper, we generalize the computational approach to spectral sharpening in three important ways. First, we introduce spherical sampling as a tool that allows us to enumerate in a principled way all linear combinations of the cones. This allows us to, second, find the optimal sharp sensors that minimize a variety of error measures including CIE Delta E (previous work on spectral sharpening minimized RMS) and color ratio stability. Lastly, we extend the spherical sampling paradigm to the multispectral case. Here the objective is to model the interaction of light and surface in terms of color signal spectra. Spherical sampling is shown to improve on the state of the art.
	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	1084-7529	ISBN		Medium
	Area		Expedition		Conference
	Notes	CIC			Approved	no
	Call Number	Admin @ si @ FVS2012			Serial	2000
Permanent link to this record



	Author	David Fernandez; Josep Llados; Alicia Fornes
	Title	Handwritten Word Spotting in Old Manuscript Images Using a Pseudo-Structural Descriptor Organized in a Hash Structure			Type	Conference Article
	Year	2011	Publication	5th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	6669	Issue		Pages	628-635
	Keywords
	Abstract	There are lots of historical handwritten documents with information that can be used for several studies and projects. The Document Image Analysis and Recognition community is interested in preserving these documents and extracting all the valuable information from them. Handwritten word-spotting is the pattern classification task which consists in detecting handwriting word images. In this work, we have used a query-by-example formalism: we have matched an input image with one or multiple images from handwritten documents to determine the distance that might indicate a correspondence. We have developed an approach based in characteristic Loci Features stored in a hash structure. Document images of the marriage licences of the Cathedral of Barcelona are used as the benchmarking database.
	Address	Las Palmas de Gran Canaria. Spain
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor	Jordi Vitria; Joao Miguel Raposo; Mario Hernandez
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-21256-7	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ FLF2011			Serial	1742
Permanent link to this record



	Author	David Fernandez
	Title	Contextual Word Spotting in Historical Handwritten Documents			Type	Book Whole
	Year	2014	Publication	PhD Thesis, Universitat Autonoma de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	There are countless collections of historical documents in archives and libraries that contain plenty of valuable information for historians and researchers. The extraction of this information has become a central task among the Document Analysis researches and practitioners. There is an increasing interest to digital preserve and provide access to these kind of documents. But only the digitalization is not enough for the researchers. The extraction and/or indexation of information of this documents has had an increased interest among researchers. In many cases, and in particular in historical manuscripts, the full transcription of these documents is extremely dicult due the inherent deciencies: poor physical preservation, dierent writing styles, obsolete languages, etc. Word spotting has become a popular an ecient alternative to full transcription. It inherently involves a high level of degradation in the images. The search of words is holistically formulated as a visual search of a given query shape in a larger image, instead of recognising the input text and searching the query word with an ascii string comparison. But the performance of classical word spotting approaches depend on the degradation level of the images being unacceptable in many cases . In this thesis we have proposed a novel paradigm called contextual word spotting method that uses the contextual/semantic information to achieve acceptable results whereas classical word spotting does not reach. The contextual word spotting framework proposed in this thesis is a segmentation-based word spotting approach, so an ecient word segmentation is needed. Historical handwritten documents present some common diculties that can increase the diculties the extraction of the words. We have proposed a line segmentation approach that formulates the problem as nding the central part path in the area between two consecutive lines. This is solved as a graph traversal problem. A path nding algorithm is used to nd the optimal path in a graph, previously computed, between the text lines. Once the text lines are extracted, words are localized inside the text lines using a word segmentation technique from the state of the art. Classical word spotting approaches can be improved using the contextual information of the documents. We have introduced a new framework, oriented to handwritten documents that present a highly structure, to extract information making use of context. The framework is an ecient tool for semi-automatic transcription that uses the contextual information to achieve better results than classical word spotting approaches. The contextual information is automatically discovered by recognizing repetitive structures and categorizing all the words according to semantic classes. The most frequent words in each semantic cluster are extracted and the same text is used to transcribe all them. The experimental results achieved in this thesis outperform classical word spotting approaches demonstrating the suitability of the proposed ensemble architecture for spotting words in historical handwritten documents using contextual information.
	Address
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Josep Llados;Alicia Fornes
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-84-940902-7-1	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.077			Approved	no
	Call Number	Admin @ si @ Fer2014			Serial	2573
Permanent link to this record