Publications

Ying, M 2001, Topology in process calculus - approximate correctness and infinite evolution of concurrent programs., Springer, New York.

Blumenstein, M & Verma, B 1970, 'Analysis of segmentation performance on the CEDAR benchmark database', Proceedings of Sixth International Conference on Document Analysis and Recognition, Sixth International Conference on Document Analysis and Recognition, IEEE Comput. Soc, pp. 1142-1146.
View/Download from: Publisher's site
View description>>

The purpose of this paper is to analyse the performance of our improved segmentation algorithm tested on the CEDAR benchmark database. Segmentation is achieved through the extraction of a wide range of information adjacent to or surrounding suspicious segmentation points. Initially, a heuristic technique is employed to search for structural features and to over-segment each word. For each segmentation point that is located, the left character (preceding the segmentation point), and centre character (centred on the segmentation point) are extracted along with other features from the segmentation area. The aforementioned features are presented to trained character and segmentation point validation neural networks to evaluate a number of confidence values. Finally, the confidence values are fused to obtain the final segmentation decision. Based on a detailed analysis, it was observed that the left and centre character networks increased the accuracy of the segmentation algorithm.