Segmentation of planar curves into circular arcs and line segments
References (24)
- et al.
Segmentation of two-dimensional curve contours
Patt. Recogn.
(1992) Representation of digitized contours in terms of conic arcs and straight-line segments
Comput. Graph., Image Process.
(1974)- et al.
Segmentation of two-dimensional boundaries using the chain code
Pan. Recogn.
(1988) - et al.
Segmentation of edges into lines and arcs
Image & Vision Comput.
(1989) - et al.
Techniques for segmenting image curves into meaningful descriptions
Pan. Recogn.
(1991) Survey of automated visual inspection: 1981 to 1987
Comput. Vision Graphics Image Process.
(1988)- et al.
An algorithm for polygonal approximation of a digital object
Patt. Recogn. Lett.
(1988) - et al.
Contour coding based on the decomposition of line segments
Patt. Recogn. Lett.
(1990) An iterative procedure for the polygonal approximation of plane curves
Comput. Vision Graph., Image Process.
(1972)- et al.
On the detection of dominant points on digital curves
IEEE Trans. PAMI
(1989)
Segmentation of plane curves
IEEE Trans. Comput.
Cited by (23)
Angles of arc-polygons and Lombardi drawings of cacti
2023, Computational Geometry: Theory and ApplicationsA robust and accurate breakpoint detection method for line-structured laser scanner
2019, Optics and Laser TechnologyCitation Excerpt :The third step is a series of suppression and removing process to obtain the dominant points. Chen et al. [8] presented a curve segmentation procedure, which includes two steps. The first step is determining a starting set of breakpoints based on the freeman code.
Segmentation and multi-model approximation of digital curves
2012, Pattern Recognition LettersCitation Excerpt :This can be undertaken with a heuristic algorithms (Chen et al., 1996), with a DP algorithm (Tortorella et al., 2008), or with Lagrange Multiplier method with user-defined value of the Lagrange multiplier (Bodansky and Gribov, 2006). In (Chen et al., 1996; Horng and Li, 2001; Sarkar et al., 2003; Tortorella et al., 2008), the total number of approximation segments is given and the task there is to find the best location of breakpoints. Such an approach is probably justifiable in those cases where we have prior knowledge about the shape structure and where the main problem is to find the location of the breakpoints and the type of approximating models for the curve segments.
On-line segmentation of freehand sketches by knowledge-based nonlinear thresholding operations
2001, Pattern RecognitionImage analysis for computer-assisted internal fixation of hip fractures
2000, Medical Image AnalysisAccurate matching of two-dimensional shapes using the minimal tolerance zone error
1997, Image and Vision Computing