Fischer, Andreas
Lade...
E-Mail-Adresse
Geburtsdatum
Projekt
Organisationseinheiten
Berufsbeschreibung
Nachname
Fischer
Vorname
Andreas
Name
Andreas Fischer
7 Ergebnisse
Suchergebnisse
Gerade angezeigt 1 - 7 von 7
Publikation Filters for graph-based keyword spotting in historical handwritten documents(Elsevier, 2020) Stauffer, Michael; Fischer, Andreas; Riesen, Kaspar01A - Beitrag in wissenschaftlicher ZeitschriftPublikation Offline signature verification using structural dynamic time warping(IEEE, 2019) Stauffer, Michael; Maergner, Paul; Fischer, Andreas; Ingold, Rolf; Riesen, KasparIn recent years, different approaches for handwriting recognition that are based on graph representations have been proposed (e.g. graph-based keyword spotting or signature verification). This trend is mostly due to the availability of novel fast graph matching algorithms, as well as the inherent flexibility and expressivity of graph data structures when compared to vectorial representations. That is, graphs are able to directly adapt their size and structure to the size and complexity of the respective handwritten entities. However, the vast majority of the proposed approaches match the graphs from a global perspective only. In the present paper, we propose to match the underlying graphs from different local perspectives and combine the resulting assignments by means of Dynamic Time Warping. Moreover, we show that the proposed approach can be readily combined with global matchings. In an experimental evaluation, we employ the novel method in a signature verification scenario on two widely used benchmark datasets. On both datasets, we empirically confirm that the proposed approach outperforms state-of-the-art methods with respect to both accuracy and runtime.04B - Beitrag KonferenzschriftPublikation Graph-based keyword spotting in historical manuscripts using Hausdorff edit distance(Elsevier, 2019) Ameri, Mohammad Reza; Stauffer, Michael; Riesen, Kaspar; Bui, Tien Dai; Fischer, Andreas; Fischer, AndreasKeyword spotting enables content-based retrieval of scanned historical manuscripts using search terms, which, in turn, facilitates the indexation in digital libraries. Recent approaches include graph-based representations that capture the complex structure of handwriting. However, the high representational power of graphs comes at the cost of high computational complexity for graph matching. In this article, we investigate the potential of Hausdorff edit distance (HED) for keyword spotting. It is an efficient quadratic-time approximation of the graph edit distance. In a comprehensive experimental evaluation with four types of handwriting graphs and four benchmark datasets (George Washington, Parzival, Botany, and Alvermann Konzilsprotokolle), we demonstrate a strong performance of the proposed HED-based method when compared with the state of the art, both, in terms of precision and speed.01A - Beitrag in wissenschaftlicher ZeitschriftPublikation Offline signature verification via structural methods: graph edit distance and inkball models(IEEE, 2018) Maergner, Paul; Howe, Nicholas; Riesen, Kaspar; Ingold, Rolf; Fischer, AndreasFor handwritten signature verification, signature images are typically represented with fixed-sized feature vectors capturing local and global properties of the handwriting. Graphbased representations offer a promising alternative, as they are flexible in size and model the global structure of the handwriting. However, they are only rarely used for signature verification, which may be due to the high computational complexity involved when matching two graphs. In this paper, we take a closer look at two recently presented structural methods for handwriting analysis, for which efficient matching methods are available: keypoint graphs with approximate graph edit distance and inkball models. Inkball models, in particular, have never been used for signature verification before. We investigate both approaches individually and propose a combined verification system, which demonstrates an excellent performance on the MCYT and GPDS benchmark data sets when compared with the state of the art.04B - Beitrag KonferenzschriftPublikation Keyword spotting in historical handwritten documents based on graph matching(Elsevier, 2018) Stauffer, Michael; Fischer, Andreas; Riesen, KasparIn the last decades historical handwritten documents have become increasingly available in digital form. Yet, the accessibility to these documents with respect to browsing and searching remained limited as full automatic transcription is often not possible or not sufficiently accurate. This paper proposes a novel reliable approach for template-based keyword spotting in historical handwritten documents. In particular, our framework makes use of different graph representations for segmented word images and a sophisticated matching procedure. Moreover, we extend our method to a spotting ensemble. In an exhaustive experimental evaluation on four widely used benchmark datasets we show that the proposed approach is able to keep up or even outperform several state-of-the-art methods for template- and learning-based keyword spotting.01A - Beitrag in wissenschaftlicher ZeitschriftPublikation Offline signature verification by combining graph edit distance and triplet networks(Springer, 2018) Maergner, Paul; Pondenkandath, Vinaychandran; Alberti, Michele; Liwicki, Marcus; Riesen, Kaspar; Ingold, Rolf; Fischer, Andreas; Bai, Xiao; Hancock, Edwin R.; Ho, Tin Kam; Wilson, Richard C.; Biggio, Battista; Robles-Kelly, AntonioBiometric authentication by means of handwritten signatures is a challenging pattern recognition task, which aims to infer a writer model from only a handful of genuine signatures. In order to make it more difficult for a forger to attack the verification system, a promising strategy is to combine different writer models. In this work, we propose to complement a recent structural approach to offline signature verification based on graph edit distance with a statistical approach based on metric learning with deep neural networks. On the MCYT and GPDS benchmark datasets, we demonstrate that combining the structural and statistical models leads to significant improvements in performance, profiting from their complementary properties.04B - Beitrag KonferenzschriftPublikation Graph-based keyword spotting in historical documents using context-aware Hausdorff edit distance(IEEE, 2018) Stauffer, Michael; Fischer, Andreas; Riesen, KasparScanned handwritten historical documents are often not well accessible due to the limited feasibility of automatic full transcriptions. Thus, Keyword Spotting (KWS) has been proposed as an alternative to retrieve arbitrary query words from this kind of documents. In the present paper, word images are represented by means of graphs. That is, a graph is used to represent the inherent topological characteristics of handwriting. The actual keyword spotting is then based on matching a query graph with all document graphs. In particular, we make use of a fast graph matching algorithm that considers the contextual substructure of nodes. The motivation for this inclusion of node context is to increase the overall KWS accuracy. In an experimental evaluation on four historical documents, we show that the proposed procedure clearly outperforms diverse other template-based reference systems. Moreover, our novel framework keeps up or even outperforms many state-of-the-art learning-based KWS approaches.04B - Beitrag Konferenzschrift