Sparse pixel tracking: a fast vectorization algorithm applied to engineering drawings

We propose that the vectorization process be divided into two separate steps: basic vectorization, which yields coarse vectors, and post processing, which results in fine vectors. We propose shape (medial axis and line width) preservation and time efficiency as two criteria for evaluating basic vect...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 13th International Conference on Pattern Recognition Vol. 3; pp. 808 - 812 vol.3
Main Authors Liu Wenyin, Dori, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1996
Subjects
Data structures
Engineering drawings
Engineering management
Geometry
Image converters
Industrial engineering
Shape
Skeleton
Technology management
Wire
Online AccessGet full text
ISBN9780818672828
081867282X
ISSN1051-4651
DOI10.1109/ICPR.1996.547280

Cover

More Information
Summary:We propose that the vectorization process be divided into two separate steps: basic vectorization, which yields coarse vectors, and post processing, which results in fine vectors. We propose shape (medial axis and line width) preservation and time efficiency as two criteria for evaluating basic vectorization. Inspired by the idea of the OZZ algorithm, we present a thinningless algorithm-sparse pixel tracking-for basic vectorization. Rather than visiting all the points along the medial axis of the wire's black area, it sparsely visits selected medial points. The result is a crude polyline, which undergoes polygonal approximation to remove redundant points. Due to the sparse pixel examination and the use of a new data structure, the vectorization is highly time efficient, as well as accurate. Like OZZ, sparse pixel tracking preserves line width as well as the medial axis.
ISBN:9780818672828
081867282X
ISSN:1051-4651
DOI:10.1109/ICPR.1996.547280