Fast Polynomial Segmentation of Digitized Curves
We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the topological properties of a digitized curve into account. The algorithm uses uniform (or L ∞ ) fitting and it works for segments of arbitrary thickness. We illustrate the algorithm with the segmentation of contours into straight and parabolic segments.
KeywordsPattern Anal Variable Order Curve Segment Incremental Algorithm Topological Constraint
- 3.Smeulders, A., Dorst, L.: Decomposition of discrete curves into piecewise straight segments in linear time. In: Melter, R.A., Rosenfeld, A., Bhattacharya, P. (eds.) Vision Geometry, American Mathematical Society. Contemporary Mathematics Series, vol. 119, pp. 169–195 (1991)Google Scholar
- 13.Veelaert, P.: Linear-time algorithms for region growing with applications to image and curve segmentation. In: Proceedings of the SPIE conference on Vision Geometry VI, vol. 3168, pp. 76–87 (1997)Google Scholar