By Topic

Sparse pixel vectorization: an algorithm and its performance evaluation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dori, D. ; Fac. of Ind. Eng. & Manage., Technion-Israel Inst. of Technol., Haifa, Israel ; Wenyin Liu

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

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:21 ,  Issue: 3 )