A Really Useful Vectorization Algorithm
- 385 Downloads
A novel algorithm for the vectorization of binary images is described. It is based on a data structure formed by crack following the outlines of the dark region of the image and applying a heuristic to decide which edges lie along the direction of the vector at any position. The regions are divided into classes, described as strokes and junctions respectively. The idea of a junction as a region containing more than one stroke is introduced, and this is used to inform the process of vectorization in these areas. The quality of the vectors produced compares favourably with those produced by other algorithms known to the author, and the implementation is reasonably efficient, a typical A4 drawing is processed in under ten seconds on my 300 MHz Pentium lap-top.
KeywordsBinary Image Machine Intelligence Dark Region Medial Axis Engineering Drawing
Unable to display preview. Download preview PDF.
- 3.Elliman, D. G.: Document Recognition for Facsimile Data. Document Image Processing and Multimedia (DIPM’99), IEE Press London, March (1999) 20, 22Google Scholar
- 4.Booch, G., Jacobson, I., Rumbaugh, J.: The Unified Modelling Language Users Guide. Addison-Wesley Press, (1998) 24Google Scholar