Issue No. 04 - April (1998 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.677280
<p><b>Abstract</b>—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.</p>
Arc segmentation, vectorization, performance evaluation, graphics recognition.
D. Dori and L. Wenyin, "Incremental Arc Segmentation Algorithm and Its Evaluation," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 20, no. , pp. 424-431, 1998.