Name
Abstract | ||
|---|---|---|
This paper describes a novel procedure for thinning binary text images by generating graphical representations of words within the image. A smoothed polygonal approximation of the boundaries of each word is first decomposed into a set of contiguous triangles. Each triangle is then classified into one of only three possible types from which a graph is generated that represents the topological features of the object. Joining graph points with straight lines generates a final polygon skeleton that, by construction, is one pixel wide and fully connected. Results of applying the procedure to thinning Arabic and English handwriting are presented. Comparisons of skeleton structure and execution time with results from alternative techniques are also presented. The procedure is considerably faster than the alternatives tested when the image resolution is greater than 600 dpi and the graphical representation often needed in subsequent recognition steps is available without further processing. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0167-8655(01)00038-1 | Pattern Recognition Letters |
Keywords | Field | DocType |
handwriting,thinning,triangulation,arabic text,novel triangulation procedure,skeletonisation,hand-written text,image resolution | Thinning,Handwriting,Computer science,Artificial intelligence,Binary number,Computer vision,Polygon,Pattern recognition,Contiguity (probability theory),Algorithm,Triangulation (social science),Pixel,Image resolution | Journal |
Volume | Issue | ISSN |
22 | 10 | Pattern Recognition Letters |
Citations | PageRank | References |
13 | 0.79 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Melhi | 1 | 13 | 1.13 |
| S. S. Ipson | 2 | 39 | 2.29 |
| W. Booth | 3 | 13 | 0.79 |