### Abstract

Segmenting Arabic characters is one of the challenging and tedious tasks in the character recognition process. This work proposes an approach to construct Arabic characters segmentation based on Voronoi area. The proposed approach is constructed based on four existing algorithms, such as Voronoi Diagrams (VD), Divided-and-Conquer algorithm (DAC), Half Plane Intersection algorithm (HPI) and Incremental algorithm (I). The VD method performs the segmentation processes by obtaining extracting the line between the connected components, based on the neighbours graph. Whereas the DAC is a fundamental paradigm used for designing efficient algorithms, where the original problem is recursively divided into several simpler sub-problems of approximately equal size. Thenthen the solution of the original problem will be obtained, by merging the solutions of the subproblems. The HPI algorithm is based on Delauney Triangulation. The VD is constructed by HPI algorithm as follows: i): Connect connect Nearest nearest neighbors and; ii): draw the perpendicular bisector for each Delauney line. Meanwhile, the 'I' algorithm calculates the VD by incremental insertion of Voronoi regions, which makes it more efficient and numerically robust to produce the best structures and yield better results in the segmentation process. The proposed algorithm determines the neighbours graph by drawing a line from the centre of the connected components to trace the boundaries of the neighbours in a white background. If there is a gap between the connected components, then they are not considered as neighbours. The Euclidian distance is used as a base to draw line segment between the connected components, which is called as VD. In this research the IFN/ENIT1 dataset will be used. This dataset consists of 569 handwritten Arabic images of the Tunisian towns' names namesof Tunisian towns'. Several experiments has been carried out with the above mentioned base algorithms and compared in terms oftime,speed ofconstruction,the number ofvertices,and edges. The early results shows that in the static algorithm category, the performance of DAC is promising than the HPI in the static algorithm category, whereas the dynamic I algorithm consumes more time than static algorithms.

Original language | English |
---|---|

Pages (from-to) | 1653-1667 |

Number of pages | 15 |

Journal | Australian Journal of Basic and Applied Sciences |

Volume | 5 |

Issue number | 11 |

Publication status | Published - Nov 2011 |

### Fingerprint

### Keywords

- Connected component
- Handwritten word
- Neighbours
- OCR
- VD Segmentation
- Voronoi Diagram

### ASJC Scopus subject areas

- General

### Cite this

**Comparative study of algorithms for voronoi diagram construction on segmentation of Arabic hand writing.** / Ramdan, Jabril; Omar, Khairuddin.

Research output: Contribution to journal › Article

*Australian Journal of Basic and Applied Sciences*, vol. 5, no. 11, pp. 1653-1667.

}

TY - JOUR

T1 - Comparative study of algorithms for voronoi diagram construction on segmentation of Arabic hand writing

AU - Ramdan, Jabril

AU - Omar, Khairuddin

PY - 2011/11

Y1 - 2011/11

N2 - Segmenting Arabic characters is one of the challenging and tedious tasks in the character recognition process. This work proposes an approach to construct Arabic characters segmentation based on Voronoi area. The proposed approach is constructed based on four existing algorithms, such as Voronoi Diagrams (VD), Divided-and-Conquer algorithm (DAC), Half Plane Intersection algorithm (HPI) and Incremental algorithm (I). The VD method performs the segmentation processes by obtaining extracting the line between the connected components, based on the neighbours graph. Whereas the DAC is a fundamental paradigm used for designing efficient algorithms, where the original problem is recursively divided into several simpler sub-problems of approximately equal size. Thenthen the solution of the original problem will be obtained, by merging the solutions of the subproblems. The HPI algorithm is based on Delauney Triangulation. The VD is constructed by HPI algorithm as follows: i): Connect connect Nearest nearest neighbors and; ii): draw the perpendicular bisector for each Delauney line. Meanwhile, the 'I' algorithm calculates the VD by incremental insertion of Voronoi regions, which makes it more efficient and numerically robust to produce the best structures and yield better results in the segmentation process. The proposed algorithm determines the neighbours graph by drawing a line from the centre of the connected components to trace the boundaries of the neighbours in a white background. If there is a gap between the connected components, then they are not considered as neighbours. The Euclidian distance is used as a base to draw line segment between the connected components, which is called as VD. In this research the IFN/ENIT1 dataset will be used. This dataset consists of 569 handwritten Arabic images of the Tunisian towns' names namesof Tunisian towns'. Several experiments has been carried out with the above mentioned base algorithms and compared in terms oftime,speed ofconstruction,the number ofvertices,and edges. The early results shows that in the static algorithm category, the performance of DAC is promising than the HPI in the static algorithm category, whereas the dynamic I algorithm consumes more time than static algorithms.

AB - Segmenting Arabic characters is one of the challenging and tedious tasks in the character recognition process. This work proposes an approach to construct Arabic characters segmentation based on Voronoi area. The proposed approach is constructed based on four existing algorithms, such as Voronoi Diagrams (VD), Divided-and-Conquer algorithm (DAC), Half Plane Intersection algorithm (HPI) and Incremental algorithm (I). The VD method performs the segmentation processes by obtaining extracting the line between the connected components, based on the neighbours graph. Whereas the DAC is a fundamental paradigm used for designing efficient algorithms, where the original problem is recursively divided into several simpler sub-problems of approximately equal size. Thenthen the solution of the original problem will be obtained, by merging the solutions of the subproblems. The HPI algorithm is based on Delauney Triangulation. The VD is constructed by HPI algorithm as follows: i): Connect connect Nearest nearest neighbors and; ii): draw the perpendicular bisector for each Delauney line. Meanwhile, the 'I' algorithm calculates the VD by incremental insertion of Voronoi regions, which makes it more efficient and numerically robust to produce the best structures and yield better results in the segmentation process. The proposed algorithm determines the neighbours graph by drawing a line from the centre of the connected components to trace the boundaries of the neighbours in a white background. If there is a gap between the connected components, then they are not considered as neighbours. The Euclidian distance is used as a base to draw line segment between the connected components, which is called as VD. In this research the IFN/ENIT1 dataset will be used. This dataset consists of 569 handwritten Arabic images of the Tunisian towns' names namesof Tunisian towns'. Several experiments has been carried out with the above mentioned base algorithms and compared in terms oftime,speed ofconstruction,the number ofvertices,and edges. The early results shows that in the static algorithm category, the performance of DAC is promising than the HPI in the static algorithm category, whereas the dynamic I algorithm consumes more time than static algorithms.

KW - Connected component

KW - Handwritten word

KW - Neighbours

KW - OCR

KW - VD Segmentation

KW - Voronoi Diagram

UR - http://www.scopus.com/inward/record.url?scp=84155185187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84155185187&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 1653

EP - 1667

JO - Australian Journal of Basic and Applied Sciences

JF - Australian Journal of Basic and Applied Sciences

SN - 1991-8178

IS - 11

ER -