CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1999 vol.21 Issue No.03 - March
Issue No.03 - March (1999 vol.21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.754586
<p><b>Abstract</b>—Accurate and efficient vectorization of line drawings is essential for their higher level processing. We present a thinningless Sparse Pixel Vectorization (SPV) algorithm. Rather than visiting all the points along the wire's black area, SPV sparsely visits selected medial axis points. The result is a crude polyline, which is refined through polygonal approximation by removing redundant points. Due to the sparseness of pixel examination and the use of a specialized data structure, SPV is both time efficient and accurate, as evaluated by our proposed performance evaluation criteria.</p>
Vectorization, line tracking, sparse pixel vectorization, polygonal approximation, performance evaluation.
Dov Dori, Wenyin Liu, "Sparse Pixel Vectorization: An Algorithm and Its Performance Evaluation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.21, no. 3, pp. 202-215, March 1999, doi:10.1109/34.754586