A novel triangulation procedure for thinning hand-written text

Melhi, M.; Ipson, Stanley S.; Booth, W.

doi:10.1016/s0167-8655(01)00038-1

Cited by 30 publications

(21 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Skeleton extraction is closely related to curve reconstruction which is an important process in many applications such as hand-written character recognition and digital map recognition [17,18]. Image thinning algorithms are widely used for skeleton extraction of 2D shapes, which recursively remove boundary pixels to give an image with one-pixel width [19].…”

Section: D Skeletonizationmentioning

confidence: 99%

A graph-based method for fitting planar B-spline curves with intersections

Luo

Wang

2015

Journal of Computational Design and Engineering

View full text Add to dashboard Cite

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

show abstract

Section: D Skeletonizationmentioning

confidence: 99%

A graph-based method for fitting planar B-spline curves with intersections

Luo

Wang

2015

Journal of Computational Design and Engineering

View full text Add to dashboard Cite

show abstract

“…The interdependency of Voronoi Diagram and skeleton (more logically medial axis) can be clearly understood from the description above and Voronoi Diagram definition. So using Voronoi Diagram to find the skeleton has been one of the topics of interest from a long time [13], [12], [21]. Skeletonization has innumerable applications like separations of overlapped objects, study and analysis of roadmaps and others [19].…”

Section: Voronoi Diagram Definitionsmentioning

confidence: 99%

Detecting Arabic handwritten word baseline using Voronoi Diagram

AL-Shatnawi

Omar

2009

2009 International Conference on Electrical Engineering and Informatics

View full text Add to dashboard Cite

The purpose of this paper is to present a methodology based on Voronoi Diagram for detecting the Arabic handwritten word baseline. In this paper, the definition and background of Voronoi Diagram has been explained. A short survey about the application of Voronoi Diagram on the language recognition fields also presented. Finally, a method is proposed based on the Voronoi Diagram for detecting the Arabic baseline handwritten word. The proposed method expects to be the robust Arabic handwriting words baseline detection algorithms, because the images slope and the diacritics will not affect in the method performance. In addition it will be the first method for detecting the Arabic baseline in zigzag way. The proposed method will implement in the next phase, in order to build a complete Arabic optical character recognition system.

show abstract

“…So in the fields of pattern recognition, computer visualization and so on, to compute skeletons of such images is a very important issue. Since the introduction of the notion of skeleton by Blum 1 , great deals of works [3][4][5][6][7][8][9][10][11][12][13][14][15][16] involving the computation of the skeleton have been reported. And they are commonly generalized into two classes 2 .…”

Section: Introductionmentioning

confidence: 99%

Fast algorithms of constrained Delaunay triangulation and skeletonization for band images

et al. 2004

View full text Add to dashboard Cite

For the boundary polygons of band-images, a fast constrained Delaunay triangulation algorithm is presented and based on it an efficient skeletonization algorithm is designed. In the process of triangulation the characters of uniform grid structure and the band-polygons are utilized to improve the speed of computing the third vertex for one edge within its local ranges when forming a Delaunay triangle. The final skeleton of the band-image is derived after reducing each triangle to local skeleton lines according to its topology. The algorithm with a simple data structure is easy to understand and implement. Moreover, it can deal with multiply connected polygons on the fly. Experiments show that there is a nearly linear dependence between triangulation time and size of band-polygons randomly generated. Correspondingly, the skeletonization algorithm is also an improvement over the previously known results in terms of time. Some practical examples are given in the paper.

show abstract

A novel triangulation procedure for thinning hand-written text

Cited by 30 publications

References 23 publications

A graph-based method for fitting planar B-spline curves with intersections

A graph-based method for fitting planar B-spline curves with intersections

Detecting Arabic handwritten word baseline using Voronoi Diagram

Fast algorithms of constrained Delaunay triangulation and skeletonization for band images

Contact Info

Product

Resources

About