| Records |
| Author |
Herve Locteau; Sebastien Mace; Ernest Valveny; Salvatore Tabbone |
| Title |
Extraction des pieces de un plan de habitation |
Type |
Conference Article |
| Year |
2010 |
Publication |
Colloque Internacional Francophone de l´Ecrit et le Document |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1–12 |
| Keywords |
|
| Abstract |
In this article, a method to extract the rooms of an architectural floor plan image is described. We first present a line detection algorithm to extract long lines in the image. Those lines are analyzed to identify the existing walls. From this point, room extraction can be seen as a classical segmentation task for which each region corresponds to a room. The chosen resolution strategy consists in recursively decomposing the image until getting nearly convex regions. The notion of convexity is difficult to quantify, and the selection of separation lines can also be rough. Thus, we take advantage of knowledge associated to architectural floor plans in order to obtain mainly rectangular rooms. Preliminary tests on a set of real documents show promising results. |
| Address |
Sousse, Tunisia |
| 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 |
CIFED |
Notes  |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ LMV2010 |
Serial |
1440 |
| Permanent link to this record |
| |
|
| |
| Author |
Joan Mas; Gemma Sanchez; Josep Llados |
| Title |
SSP: Sketching slide Presentations, a Syntactic Approach |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
The design of a slide presentation is a creative process. In this process first, humans visualize in their minds what they want to explain. Then, they have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize a slide presentation from a sketch. A slide may be seen as a graphical document or a diagram where its elements are placed in a particular spatial arrangement. To describe and recognize slides a syntactic approach is proposed. This approach is based on an Adjacency Grammar and a parsing methodology to cope with this kind of grammars. The experimental evaluation shows the performance of our methodology from a qualitative and a quantitative point of view. Six different slides containing different number of symbols, from 4 to 7, have been given to the users and they have drawn them without restrictions in the order of the elements. The quantitative results give an idea on how suitable is our methodology to describe and recognize the different elements in a slide. |
| Address |
La Rochelle; France; July 2009 |
| 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 |
Approved |
no |
| Call Number |
DAG @ dag @ MSL2009a |
Serial |
1441 |
| Permanent link to this record |
| |
|
| |
| Author |
Salim Jouili; Salvatore Tabbone; Ernest Valveny |
| Title |
Comparing Graph Similarity Measures for Graphical Recognition. |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique. |
| Address |
La Rochelle; France; July 2009 |
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer |
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 |
Approved |
no |
| Call Number |
DAG @ dag @ JTV2009 |
Serial |
1442 |
| Permanent link to this record |
| |
|
| |
| Author |
Mathieu Nicolas Delalandre; Jean-Yves Ramel; Ernest Valveny; Muhammad Muzzamil Luqman |
| Title |
A Performance Characterization Algorithm for Symbol Localization |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
3-11 |
| Keywords |
|
| Abstract |
In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution to characterize the performance. To achieve that, it exploits only single points as the result of localization and offers the possibility to reconsider the localization results provided by a system. We use the information about context in groundtruth, and overall localization results, to detect the ambiguous localization results. A probability score is computed for each matching between a localization point and a groundtruth region, depending on the spatial distribution of the other regions in the groundtruth. Final characterization is given with detection rate/probability score plots, describing the sets of possible interpretations of the localization results, according to a given confidence rate. We present experimentation details along with the results for the symbol localization system of [1], exploiting a synthetic dataset of architectural floorplans and electrical diagrams (composed of 200 images and 3861 symbols). |
| Address |
La Rochelle; July 2009 |
| 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 |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ DRV2009 |
Serial |
1443 |
| Permanent link to this record |
| |
|
| |
| Author |
Marçal Rusiñol; K. Bertet; Jean-Marc Ogier; Josep Llados |
| Title |
Symbol Recognition Using a Concept Lattice of Graphical Patterns |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
In this paper we propose a new approach to recognize symbols by the use of a concept lattice. We propose to build a concept lattice in terms of graphical patterns. Each model symbol is decomposed in a set of composing graphical patterns taken as primitives. Each one of these primitives is described by boundary moment invariants. The obtained concept lattice relates which symbolic patterns compose a given graphical symbol. A Hasse diagram is derived from the context and is used to recognize symbols affected by noise. We present some preliminary results over a variation of the dataset of symbols from the GREC 2005 symbol recognition contest. |
| Address |
La Rochelle; July 2009 |
| 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 |
Approved |
no |
| Call Number |
DAG @ dag @ RBO2009 |
Serial |
1444 |
| Permanent link to this record |
| |
|
| |
| Author |
Partha Pratim Roy; Umapada Pal; Josep Llados |
| Title |
Touching Text Character Localization in Graphical Documents using SIFT |
Type |
Conference Article |
| Year |
2009 |
Publication |
In proceedings 8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
Interpretation of graphical document images is a challenging task as it requires proper understanding of text/graphics symbols present in such documents. Difficulties arise in graphical document recognition when text and symbol overlapped/touched. Intersection of text and symbols with graphical lines and curves occur frequently in graphical documents and hence separation of such symbols is very difficult.
Several pattern recognition and classification techniques exist to recognize isolated text/symbol. But, the touching/overlapping text and symbol recognition has not yet been dealt successfully. An interesting technique, Scale Invariant Feature Transform (SIFT), originally devised for object recognition can take care of overlapping problems. Even if SIFT features have emerged as a very powerful object descriptors, their employment in graphical documents context has not been investigated much. In this paper we present the adaptation of the SIFT approach in the context of text character localization (spotting) in graphical documents. We evaluate the applicability of this technique in such documents and discuss the scope of improvement by combining some state-of-the-art approaches. |
| Address |
La rochelle; July 2009 |
| 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 |
Approved |
no |
| Call Number |
DAG @ dag @ RPL2009c |
Serial |
1445 |
| Permanent link to this record |
| |
|
| |
| Author |
Muhammad Muzzamil Luqman; Josep Llados; Jean-Yves Ramel; Thierry Brouard |
| Title |
A Fuzzy-Interval Based Approach For Explicit Graph Embedding, Recognizing Patterns in Signals, Speech, Images and Video |
Type |
Conference Article |
| Year |
2010 |
Publication |
20th International Conference on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
6388 |
Issue |
|
Pages |
93–98 |
| Keywords |
|
| Abstract |
We present a new method for explicit graph embedding. Our algorithm extracts a feature vector for an undirected attributed graph. The proposed feature vector encodes details about the number of nodes, number of edges, node degrees, the attributes of nodes and the attributes of edges in the graph. The first two features are for the number of nodes and the number of edges. These are followed by w features for node degrees, m features for k node attributes and n features for l edge attributes — which represent the distribution of node degrees, node attribute values and edge attribute values, and are obtained by defining (in an unsupervised fashion), fuzzy-intervals over the list of node degrees, node attributes and edge attributes. Experimental results are provided for sample data of ICPR2010 contest GEPR. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer, 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-17710-1 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICPR |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ LLR2010 |
Serial |
1459 |
| Permanent link to this record |
| |
|
| |
| Author |
Muhammad Muzzamil Luqman; Thierry Brouard; Jean-Yves Ramel; Josep Llados |
| Title |
A Content Spotting System For Line Drawing Graphic Document Images |
Type |
Conference Article |
| Year |
2010 |
Publication |
20th International Conference on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
20 |
Issue |
|
Pages |
3420–3423 |
| Keywords |
|
| Abstract |
We present a content spotting system for line drawing graphic document images. The proposed system is sufficiently domain independent and takes the keyword based information retrieval for graphic documents, one step forward, to Query By Example (QBE) and focused retrieval. During offline learning mode: we vectorize the documents in the repository, represent them by attributed relational graphs, extract regions of interest (ROIs) from them, convert each ROI to a fuzzy structural signature, cluster similar signatures to form ROI classes and build an index for the repository. During online querying mode: a Bayesian network classifier recognizes the ROIs in the query image and the corresponding documents are fetched by looking up in the repository index. Experimental results are presented for synthetic images of architectural and electronic documents. |
| 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 |
1051-4651 |
ISBN |
978-1-4244-7542-1 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICPR |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ LBR2010b |
Serial |
1460 |
| Permanent link to this record |
| |
|
| |
| Author |
Jaume Gibert; Ernest Valveny; Horst Bunke |
| Title |
Graph of Words Embedding for Molecular Structure-Activity Relationship Analysis |
Type |
Conference Article |
| Year |
2010 |
Publication |
15th Iberoamerican Congress on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
6419 |
Issue |
|
Pages |
30–37 |
| Keywords |
|
| Abstract |
Structure-Activity relationship analysis aims at discovering chemical activity of molecular compounds based on their structure. In this article we make use of a particular graph representation of molecules and propose a new graph embedding procedure to solve the problem of structure-activity relationship analysis. The embedding is essentially an arrangement of a molecule in the form of a vector by considering frequencies of appearing atoms and frequencies of covalent bonds between them. Results on two benchmark databases show the effectiveness of the proposed technique in terms of recognition accuracy while avoiding high operational costs in the transformation. |
| Address |
Sao Paulo, Brazil |
| 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-16686-0 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
CIARP |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ GVB2010 |
Serial |
1462 |
| Permanent link to this record |
| |
|
| |
| Author |
Oriol Ramos Terrades; N. Serrano; Albert Gordo; Ernest Valveny; Alfons Juan-Ciscar |
| Title |
Interactive-predictive detection of handwritten text blocks |
Type |
Conference Article |
| Year |
2010 |
Publication |
17th Document Recognition and Retrieval Conference, part of the IS&T-SPIE Electronic Imaging Symposium |
Abbreviated Journal |
|
| Volume |
7534 |
Issue |
|
Pages |
75340Q–75340Q–10 |
| Keywords |
|
| Abstract |
A method for text block detection is introduced for old handwritten documents. The proposed method takes advantage of sequential book structure, taking into account layout information from pages previously transcribed. This glance at the past is used to predict the position of text blocks in the current page with the help of conventional layout analysis methods. The method is integrated into the GIDOC prototype: a first attempt to provide integrated support for interactive-predictive page layout analysis, text line detection and handwritten text transcription. Results are given in a transcription task on a 764-page Spanish manuscript from 1891. |
| 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 |
DRR |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ TSG2010 |
Serial |
1479 |
| Permanent link to this record |
| |
|
| |
| Author |
Albert Gordo; Florent Perronnin |
| Title |
A Bag-of-Pages Approach to Unordered Multi-Page Document Classification |
Type |
Conference Article |
| Year |
2010 |
Publication |
20th International Conference on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1920–1923 |
| Keywords |
|
| Abstract |
We consider the problem of classifying documents containing multiple unordered pages. For this purpose, we propose a novel bag-of-pages document representation. To represent a document, one assigns every page to a prototype in a codebook of pages. This leads to a histogram representation which can then be fed to any discriminative classifier. We also consider several refinements over this initial approach. We show on two challenging datasets that the proposed approach significantly outperforms a baseline system. |
| Address |
Istanbul (Turkey) |
| 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 |
1051-4651 |
ISBN |
978-1-4244-7542-1 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICPR |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ GoP2010 |
Serial |
1480 |
| Permanent link to this record |
| |
|
| |
| Author |
Palaiahnakote Shivakumara; Anjan Dutta; Trung Quy Phan; Chew Lim Tan; Umapada Pal |
| Title |
A Novel Mutual Nearest Neighbor based Symmetry for Text Frame Classification in Video |
Type |
Journal Article |
| Year |
2011 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
| Volume |
44 |
Issue |
8 |
Pages |
1671-1683 |
| Keywords |
|
| Abstract |
In the field of multimedia retrieval in video, text frame classification is essential for text detection, event detection, event boundary detection, etc. We propose a new text frame classification method that introduces a combination of wavelet and median moment with k-means clustering to select probable text blocks among 16 equally sized blocks of a video frame. The same feature combination is used with a new Max–Min clustering at the pixel level to choose probable dominant text pixels in the selected probable text blocks. For the probable text pixels, a so-called mutual nearest neighbor based symmetry is explored with a four-quadrant formation centered at the centroid of the probable dominant text pixels to know whether a block is a true text block or not. If a frame produces at least one true text block then it is considered as a text frame otherwise it is a non-text frame. Experimental results on different text and non-text datasets including two public datasets and our own created data show that the proposed method gives promising results in terms of recall and precision at the block and frame levels. Further, we also show how existing text detection methods tend to misclassify non-text frames as text frames in term of recall and precision at both the block and frame levels. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ SDP2011 |
Serial |
1727 |
| Permanent link to this record |
| |
|
| |
| Author |
Lluis Pere de las Heras; Gemma Sanchez |
| Title |
And-Or Graph Grammar for Architectural Floorplan Representation, Learning and Recognition. A Semantic, Structural and Hierarchical Model |
Type |
Conference Article |
| Year |
2011 |
Publication |
5th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
| Volume |
6669 |
Issue |
|
Pages |
17-24 |
| Keywords |
|
| Abstract |
This paper presents a syntactic model for architectural floor plan interpretation. A stochastic image grammar over an And-Or graph is inferred to represent the hierarchical, structural and semantic relations between elements of all possible floor plans. This grammar is augmented with three different probabilistic models, learnt from a training set, to account the frequency of that relations. Then, a Bottom-Up/Top-Down parser with a pruning strategy has been used for floor plan recognition. For a given input, the parser generates the most probable parse graph for that document. This graph not only contains the structural and semantic relations of its elements, but also its hierarchical composition, that allows to interpret the floor plan at different levels of abstraction. |
| Address |
Las Palmas de Gran Canaria. 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 |
978-3-642-21256-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
IbPRIA |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ HeS2011 |
Serial |
1736 |
| Permanent link to this record |
| |
|
| |
| Author |
Anjan Dutta; Josep Llados; Umapada Pal |
| Title |
A Bag-of-Paths Based Serialized Subgraph Matching for Symbol Spotting in Line Drawings |
Type |
Conference Article |
| Year |
2011 |
Publication |
5th Iberian Conference on Pattern Recognition and Image Analysis |
Abbreviated Journal |
|
| Volume |
6669 |
Issue |
|
Pages |
620-627 |
| Keywords |
|
| Abstract |
In this paper we propose an error tolerant subgraph matching algorithm based on bag-of-paths for solving the problem of symbol spotting in line drawings. Bag-of-paths is a factorized representation of graphs where the factorization is done by considering all the acyclic paths between each pair of connected nodes. Similar paths within the whole collection of documents are clustered and organized in a lookup table for efficient indexing. The lookup table contains the index key of each cluster and the corresponding list of locations as a single entry. The mean path of each of the clusters serves as the index key for each table entry. The spotting method is then formulated by a spatial voting scheme to the list of locations of the paths that are decided in terms of search of similar paths that compose the query symbol. Efficient indexing of common substructures helps to reduce the computational burden of usual graph based methods. The proposed method can also be seen as a way to serialize graphs which allows to reduce the complexity of the subgraph isomorphism. We have encoded the paths in terms of both attributed strings and turning functions, and presented a comparative results between them within the symbol spotting framework. Experimentations for matching different shape silhouettes are also reported and the method has been proved to work in noisy environment also. |
| Address |
Las Palmas de Gran Canaria. Spain |
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Berlin Heidelberg |
Place of Publication |
Berlin |
Editor |
Jordi Vitria; Joao Miguel Raposo; Mario Hernandez |
| 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-21256-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
IbPRIA |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ DLP2011a |
Serial |
1738 |
| 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 |
