Demo Data from VLDB 2026 / reviewers in the wild / expert
Stefan Jäger 0002
dblp:71/115-2
· DBLP profile ↗
7ranked-venue papers
6as first author
0since 2021 · last 2004
0000-0003-4983-0331ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 6 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Image recognition and object detection · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Image recognition and object detection
handwriting recognition |
0.0 | 1 | 2004 | Online Recognition of Chinese Characters: The State-of-the-Art · IEEE Trans. Pattern Anal. Mach. Intell. 2004 |
Computer vision › Image recognition and object detection › handwriting recognition
online handwritten chinese character recognition |
0.0 | 1 | 2004 | Online Recognition of Chinese Characters: The State-of-the-Art · IEEE Trans. Pattern Anal. Mach. Intell. 2004 |
Computer vision › Image recognition and object detection › text recognition
character classification |
0.0 | 1 | 2004 | Online Recognition of Chinese Characters: The State-of-the-Art · IEEE Trans. Pattern Anal. Mach. Intell. 2004 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Online Recognition of Chinese Characters: The State-of-the-ArtabstractOnline handwriting recognition is gaining renewed interest owing to the increase of pen computing applications and new pen input devices. The recognition of Chinese characters is different from western handwriting recognition and poses a special challenge. To provide an overview of the technical status and inspire future research, this paper reviews the advances in online Chinese character recognition (OLCCR), with emphasis on the research works from the 1990s. Compared to the research in the 1980s, the research efforts in the 1990s aimed to further relax the constraints of handwriting, namely, the adherence to standard stroke orders and stroke numbers and the restriction of recognition to isolated characters only. The target of recognition has shifted from regular script to fluent script in order to better meet the requirements of practical applications. The research works are reviewed in terms of pattern representation, character classification, learning/adaptation, and contextual processing. We compare important results and discuss possible directions of future research. Stefan Jäger 0002, Masaki Nakagawa |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |
| 2003 | The Callpaper Concept: Turning Paper into Computer TerminalsabstractDespite all the attempts of modern information technologyto supplant paper by sophisticated electronic devices,paper is still omnipresent in virtually any office environment.We have learned over the last decade that paper isan indispensable part of our daily work and that even thelatest computers are not able to mimic its functionality. Today,paper and computer are coexisting side by side withoutinteracting with each other, both having their specificadvantages. This paper presents a concept for bridging thegap between computer and paper by combining the advantagesof both electronic and paper world. The implementationdescribed in this paper augments standard paper withfeatures of modern information technology. Moreover, it allowsinterfacing computers using pen and paper. Stefan Jäger 0002, Masaki Nakagawa |
ICDAR | 1 |
| 2003 | The state of the art in Japanese online handwriting recognition compared to techniques in western handwriting recognition
Stefan Jäger 0002, Masaki Nakagawa |
Int. J. Document Anal. Recognit. | 1 |
| 2001 | Two On-Line Japanese Character Databases in Unipen FormatabstractThis paper presents the UP-Kuchibue and UP-Nakayosi databases containing on-line handwritten Japanese characters. These databases are the international versions of two databases, Kuchibue and Nakayosi, collected in the Nakagawa Laboratory at the University of Agriculture & Technology in Tokyo. They contain more than 3 million characters written by 283 Japanese writers. UP-Kuchibue and UP-Nakayosi are stored in the common Unipen format. Unipen is a western plain ASCII format which allows easy access for international researchers and facilitates international benchmarks. Stefan Jäger 0002, Masaki Nakagawa |
ICDAR | 1 |
| 2001 | Online handwriting recognition: the NPen++ recognizer
Stefan Jäger 0002, Stefan Manke, Jürgen Reichert, Alex Waibel |
Int. J. Document Anal. Recognit. | 1 |
| 1997 | A Psychomotor Method for Tracking HandwritingabstractThe paper proposes a model for tracking handwriting based on curvature minimization. Aiming at recovering stroke sequences from words written in the past, the problem is formulated as a graph theoretical question. The solution does not require mathematical functions. In particular loops are considered elementary basic strokes and are not approximated with functions. Recovering stroke sequences is equivalent to ordering the edges of a graph, which can be derived in a straightforward manner from the scanned binary word image. The paper does not deal with any special recognition method. However, an important aim is to provide a mechanism for deriving temporal information to help to improve off-line recognition methods. The most important advantages of this method over methods proposed so far are: a single global principle (global optimization of curvature), implicit modeling of retraced strokes and simplicity. Stefan Jäger 0002 |
ICDAR | 1 |
| 1996 | Recovering writing traces in off-line handwriting recognition: using a global optimization techniqueabstractOff-line handwriting recognition is constrained by the lack of time information. This paper describes an approach to derive sequence information from a written word. The underlying representation of the word used is a graph with nodes and edges resulting from a skeletonization process. The writing path is reconstructed by assuming that the writer has used a path with least curvature, i.e. reconstruction is realized as a global optimization process, which consists of solving a travelling salesman problem. Stefan Jäger 0002 |
ICPR | 1 |