Pearling: stroke segmentation with crusted pearl strings
Whited, Brian and Rossignac, Jarec and Slabaugh, Greg and Fang, Tong and Ünal, Gözde (2009) Pearling: stroke segmentation with crusted pearl strings. Pattern Recognition and Image Analysis, 19 (2). pp. 277-283. ISSN 1054-6618 (Print) 1555-6212 (Online)
Official URL: http://dx.doi.org/10.1134/S1054661809020102
We introduce a novel segmentation technique, called Pearling, for the semi-automatic extraction of idealized models of networks of strokes (variable width curves) in images. These networks may for example represent roads in an aerial photograph, vessels in a medical scan, or strokes in a drawing. The operator seeds the process by selecting representative areas of good (stroke interior) and bad colors. Then, the operator may either provide a rough trace through a particular path in the stroke graph or simply pick a starting point (seed) on a stroke and a direction of growth. Pearling computes in realtime the centerlines of the strokes, the bifurcations, and the thickness function along each stroke, hence producing a purified medial axis transform of a desired portion of the stroke graph. No prior segmentation or thresholding is required. Simple gestures may be used to trim or extend the selection or to add branches. The realtime performance and reliability of Pearling results from a novel disk-sampling approach, which traces the strokes by optimizing the positions and radii of a discrete series of disks (pearls) along the stroke. A continuous model is defined through subdivision. By design, the idealized pearl string model is slightly wider than necessary to ensure that it contains the stroke boundary. A narrower core model that fits inside the stroke is computed simultaneously. The difference between the pearl string and its core contains the boundary of the stroke and may be used to capture, compress, visualize, or analyze the raw image data along the stroke boundary.
Repository Staff Only: item control page