By Topic

Incremental arc segmentation algorithm and its 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
$33 $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)
L. Wenyin ; Fac. of Ind. Eng. & Manage., Technion-Israel Inst. of Technol., Haifa, Israel ; D. Dori

We present an incremental arc segmentation algorithm, which recovers the vectorized arc fragments obtained by the vectorization of a piece of arc image in a stepwise fashion. Due to proper threshold selection and consistent checking of cocircularity of the assumed arc pieces, the algorithm accurately constructs arcs from the vector input. Nearly 200 synthetic arcs, ranging in radius from five to 50 pixels, in open angle from 1/8π to 2π, and in thickness from one to nine pixels, are used in the experiments and evaluation. Parts of six real drawings, containing about 200 arcs, are also processed. The algorithm works well for arc segments greater than 10 pixels in radius, π/4 in angle, and one pixel in width

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:20 ,  Issue: 4 )