Browsing Research Articles (Informatics) by UP Author "Stauffer, Michael"

Browsing Research Articles (Informatics) by UP Author "Stauffer, Michael"

Sort by: Order: Results:

  • Stauffer, Michael; Fischer, Andreas; Riesen, Kaspar (Elsevier, 2020-06)
    The accessibility to handwritten historical documents is often constrained by the limited feasibility of automatic full transcriptions. Keyword Spotting (KWS), that allows to retrieve arbitrary query words from documents, ...
  • Stauffer, Michael; Fischer, Andreas; Riesen, Kaspar (Springer, 2016-11)
    The amount of handwritten documents that is digitally available is rapidly increasing. However, we observe a certain lack of accessibility to these documents especially with respect to searching and browsing. This paper ...
  • Ameri, Mohammad Reza; Stauffer, Michael; Riesen, Kaspar; Bui, Tien Dai; Fischer, Andreas (Elsevier, 2019-04)
    Keyword 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 ...
  • Stauffer, Michael; Fischer, Andreas; Riesen, Kaspar (Elsevier, 2018-09)
    In 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 ...
  • Stauffer, Michael; Fischer, Andreas; Riesen, Kaspar (Springer, 2016-11)
    For several decades graphs act as a powerful and flexible representation formalism in pattern recognition and related fields. For instance, graphs have been employed for specific tasks in image and video analysis, ...
  • Stauffer, Michael; Fischer, Andreas; Riesen, Kaspar (Springer, 2017-05)
    The present paper is concerned with a graph-based system for Keyword Spotting (KWS) in historical documents. This particular system operates on segmented words that are in turn represented as graphs. The basic KWS process ...
  • Stauffer, Michael; Tschachtli, Thomas; Fischer, Andreas; Riesen, Kaspar (Springer, 2017-05)
    About ten years ago, a novel graph edit distance framework based on bipartite graph matching has been introduced. This particular framework allows the approximation of graph edit distance in cubic time. This, in turn, makes ...