• Publications
  • Influence
The IAM-database: an English sentence database for offline handwriting recognition
  • U. Marti, H. Bunke
  • Computer Science
  • International Journal on Document Analysis and…
  • 1 November 2002
Abstract. In this paper we describe a database that consists of handwritten English sentences. It is based on the Lancaster-Oslo/Bergen (LOB) corpus. This corpus is a collection of texts thatExpand
  • 853
  • 102
A Novel Connectionist System for Unconstrained Handwriting Recognition
Recognizing lines of unconstrained handwritten text is a challenging task. The difficulty of segmenting cursive or overlapping characters, combined with the need to exploit surrounding context, hasExpand
  • 1,248
  • 98
  • Open Access
Approximate graph edit distance computation by means of bipartite graph matching
In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged as a powerful and flexible graph matching paradigm that can be used toExpand
  • 539
  • 71
  • Open Access
An Experimental Comparison of Range Image Segmentation Algorithms
A methodology for evaluating range image segmentation algorithms is proposed. This methodology involves (1) a common set of 40 laser range finder images and 40 structured light scanner images thatExpand
  • 908
  • 68
  • Open Access
Using a Statistical Language Model to Improve the Performance of an HMM-Based Cursive Handwriting Recognition System
  • U. Marti, H. Bunke
  • Computer Science
  • Int. J. Pattern Recognit. Artif. Intell.
  • 1 June 2001
In this paper, a system for the reading of totally unconstrained handwritten text is presented. The kernel of the system is a hidden Markov model (HMM) for handwriting recognition. The HMM isExpand
  • 480
  • 45
A graph distance metric based on the maximal common subgraph
Abstract Error-tolerant graph matching is a powerful concept that has various applications in pattern recognition and machine vision. In the present paper, a new distance measure on graphs isExpand
  • 715
  • 40
  • Open Access
Lexicon-free handwritten word spotting using character HMMs
Highlights? Novel handwritten word spotting system using character HMMs. ? Efficient lexicon-free approach. ? Template-free spotting of arbitrary keywords. ? Segmentation-free approach is applied toExpand
  • 229
  • 39
  • Open Access
On a relation between graph edit distance and maximum common subgraph
  • H. Bunke
  • Mathematics, Computer Science
  • Pattern Recognit. Lett.
  • 1 August 1997
Abstract In approximate, or error-correcting, graph matching one considers a set of graph edit operations, and defines the edit distance of two graphs g1 and g2 as the shortest (or least cost)Expand
  • 530
  • 38
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
In recent years the use of graph based representation has gained popularity in pattern recognition and machine learning. As a matter of fact, object representation by means of graphs has a number ofExpand
  • 330
  • 36
Edge Detection in Range Images Based on Scan Line Approximation
  • X. Jiang, H. Bunke
  • Mathematics, Computer Science
  • Comput. Vis. Image Underst.
  • 1 February 1999
In this paper we present a novel edge detection algorithm for range images based on a scan line approximation technique. Compared to the known methods in the literature, our algorithm has a number ofExpand
  • 254
  • 29
  • Open Access