| Records |
| Author |
Pau Riba; Josep Llados; Alicia Fornes |
| Title |
Hierarchical graphs for coarse-to-fine error tolerant matching |
Type |
Journal Article |
| Year |
2020 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
134 |
Issue |
|
Pages |
116-124 |
| Keywords |
Hierarchical graph representation; Coarse-to-fine graph matching; Graph-based retrieval |
| Abstract |
During the last years, graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their ability to capture both structural and appearance-based information. Thus, they provide a greater representational power than classical statistical frameworks. However, graph-based representations leads to high computational complexities usually dealt by graph embeddings or approximated matching techniques. Despite their representational power, they are very sensitive to noise and small variations of the input image. With the aim to cope with the time complexity and the variability present in the generated graphs, in this paper we propose to construct a novel hierarchical graph representation. Graph clustering techniques adapted from social media analysis have been used in order to contract a graph at different abstraction levels while keeping information about the topology. Abstract nodes attributes summarise information about the contracted graph partition. For the proposed representations, a coarse-to-fine matching technique is defined. Hence, small graphs are used as a filtering before more accurate matching methods are applied. This approach has been validated in real scenarios such as classification of colour images or retrieval of handwritten words (i.e. word spotting). |
| 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; 600.097; 601.302; 603.057; 600.140; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ RLF2020 |
Serial  |
3349 |
| Permanent link to this record |
| |
|
| |
| Author |
Pau Riba; Josep Llados; Alicia Fornes |
| Title |
Error-tolerant coarse-to-fine matching model for hierarchical graphs |
Type |
Conference Article |
| Year |
2017 |
Publication |
11th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition |
Abbreviated Journal |
|
| Volume |
10310 |
Issue |
|
Pages |
107-117 |
| Keywords |
Graph matching; Hierarchical graph; Graph-based representation; Coarse-to-fine matching |
| Abstract |
Graph-based representations are effective tools to capture structural information from visual elements. However, retrieving a query graph from a large database of graphs implies a high computational complexity. Moreover, these representations are very sensitive to noise or small changes. In this work, a novel hierarchical graph representation is designed. Using graph clustering techniques adapted from graph-based social media analysis, we propose to generate a hierarchy able to deal with different levels of abstraction while keeping information about the topology. For the proposed representations, a coarse-to-fine matching method is defined. These approaches are validated using real scenarios such as classification of colour images and handwritten word spotting. |
| Address |
Anacapri; Italy; May 2017 |
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer International Publishing |
Place of Publication |
|
Editor |
Pasquale Foggia; Cheng-Lin Liu; Mario Vento |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
GbRPR |
| Notes |
DAG; 600.097; 601.302; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ RLF2017a |
Serial |
2951 |
| Permanent link to this record |
| |
|
| |
| Author |
Pau Riba; Josep Llados; Alicia Fornes |
| Title |
Handwritten Word Spotting by Inexact Matching of Grapheme Graphs |
Type |
Conference Article |
| Year |
2015 |
Publication |
13th International Conference on Document Analysis and Recognition ICDAR2015 |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
781 - 785 |
| Keywords |
|
| Abstract |
This paper presents a graph-based word spotting for handwritten documents. Contrary to most word spotting techniques, which use statistical representations, we propose a structural representation suitable to be robust to the inherent deformations of handwriting. Attributed graphs are constructed using a part-based approach. Graphemes extracted from shape convexities are used as stable units of handwriting, and are associated to graph nodes. Then, spatial relations between them determine graph edges. Spotting is defined in terms of an error-tolerant graph matching using bipartite-graph matching algorithm. To make the method usable in large datasets, a graph indexing approach that makes use of binary embeddings is used as preprocessing. Historical documents are used as experimental framework. The approach is comparable to statistical ones in terms of time and memory requirements, especially when dealing with large document collections. |
| 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 |
ICDAR |
| Notes |
DAG; 600.077; 600.061; 602.006 |
Approved |
no |
| Call Number |
Admin @ si @ RLF2015b |
Serial |
2642 |
| Permanent link to this record |
