Translator Disclaimer
1 November 1992 Comparison of massively parallel hand-print segmentors
Author Affiliations +
Proceedings Volume 1825, Intelligent Robots and Computer Vision XI: Algorithms, Techniques, and Active Vision; (1992)
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
NIST has developed a massively parallel hand-print recognition system that allows components to be interchanged. Using this system, three different character segmentation algorithms have been developed and studied. They are blob coloring, histogramming, and a hybrid of the two. The blob coloring method uses connected components to isolate characters. The histogramming method locates linear spaces, which may be slanted, to segment characters. The hybrid method is an augmented histogramming method that incorporates statistically adaptive rules to decide when a histogrammed item is too large and applies blob coloring to further segment the difficult item. The hardware configuration is a serial host computer with a 1024 processor SIMD machine attached to it. The data used in this comparison is `NIST Special Database 1' which contains 2100 forms from different writers where each form contains 130 digit characters distributed across 28 fields. This gives a potential 273,000 characters to be segmented. Running the massively parallel system across the 2100 forms, blob coloring required 2.1 seconds per form with an accuracy of 97.5%, histogramming required 14.4 seconds with an accuracy of 95.3%, and the hybrid method required 13.2 seconds with an accuracy of 95.4%. The results of this comparison show that the blob coloring method on a SIMD architecture is superior.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
R. Allen Wilkinson and Michael D. Garris "Comparison of massively parallel hand-print segmentors", Proc. SPIE 1825, Intelligent Robots and Computer Vision XI: Algorithms, Techniques, and Active Vision, (1 November 1992);


Space And Time Requirements For Two Image Data Structures
Proceedings of SPIE (March 27 1989)
Connection Machine Vision Applications
Proceedings of SPIE (June 06 1987)
Automatic Target Detection On The Connection Machine
Proceedings of SPIE (February 19 1988)
Locating Mushrooms For Robotic Harvesting
Proceedings of SPIE (March 01 1990)
Segmenting text images with massively parallel machines
Proceedings of SPIE (February 01 1992)

Back to Top