Online Segmentation of Freehand Stroke by Dynamic Programming

Authors:
Liu Yin;Yu Yajie;Liu Wenyin
Affiliations:
City University of Hong Kong;City University of Hong Kong;City University of Hong Kong
Venue:
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Year:
2005

Citing 10
Cited 5

Direct Least Square Fitting of Ellipses

IEEE Transactions on Pattern Analysis and Machine Intelligence
A dynamic programming approach for fitting digital planar curves with line segments and circular arcs

Pattern Recognition Letters
Segmenting Handwritten Signatures at Their Perceptually Important Points

IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonparametric Segmentation of Curves into Various Representations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters
Online Recognition of Chinese Characters: The State-of-the-Art

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust sketched symbol fragmentation using templates

Proceedings of the 9th international conference on Intelligent user interfaces
A near-linear constant-factor approximation for euclidean bipartite matching?

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A Corner-Finding Algorithm for Chain-Coded Curves

IEEE Transactions on Computers
Segmentation of Plane Curves

IEEE Transactions on Computers

An agent-based framework for sketched symbol interpretation

Journal of Visual Languages and Computing
Minimum description length approximation of digital curves

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
QuickDiagram: a system for online sketching and understanding of diagrams

GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Segmentation and multi-model approximation of digital curves

Pattern Recognition Letters
Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a dynamic programming (DP) based approach is proposed to split a freehand stroke into the optimal number of line segments and elliptical arcs. Different from existing DP approaches, which often require a predefined fixed number and/or the templates of the result segments, our approach is actually a generic parameterized framework, which can be configured to some existing methods by fixing some of the parameters. Our key contribution is to avoid presetting of the number or templates of the segments and achieve the best tradeoff between the segment number and approximate error by using a suitable penalty function. Experiments show that our approach achieves high segmentation accuracy and can response to user's stroke input in real-time.