Segmentation of planar curves into circular arcs and line segments

Image and Vision Computing

Volumn 14, Issue 1, 1996, Pages 71-83

  Chen, Jen Ming ^a   Ventura, Jose A ^b   Wu, Chih Hang ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Circular arcs; Line segments; Planar curves; Segmentation

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; CURVE FITTING; DYNAMIC PROGRAMMING; EDGE DETECTION; FUNCTIONS; IMAGE ANALYSIS; OPTIMIZATION;

CHAIN CODE TECHNIQUES; COMPUTATIONAL TIME; DIFFERENTIAL CHAIN CODE TECHNIQUES; SHAPE ANALYSIS;

IMAGE SEGMENTATION;

EID: 0030080578     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/0262-8856(95)01042-4     Document Type: Article

References (24)

1. C.H. Teh and R.T. Chin, On the detection of dominant points on digital curves, IEEE Trans. PAMI, 11 (1989) 859-872.
2. J.A. Ventura and J.M. Chen, Segmentation of two-dimensional curve contours, Patt. Recogn. 25 (1992) 1129-1140.
3. F.T. Farago, Handbook of Dimensional Measurement, 2nd Ed, Industrial Press Inc., New York (1982).
4. T. Pavlidis and S.L. Horowitz, 'Segmentation of plane curves', IEEE Trans. Comput., 23 (1974) 860-870.
5. A. Albano, Representation of digitized contours in terms of conic arcs and straight-line segments, Comput. Graph., Image Process., 3 (1974) 23-33.
6. O. Baruch and M.H. Loew, Segmentation of two-dimensional boundaries using the chain code, Patt. Recogn., 21 (1988) 581-589.
7. P.L. Rosin and G.A.W. West, Segmentation of edges into lines and arcs, Image & Vision Comput., 7 (1989) 109-114.
8. G.A.W. West and P.L. Rosin, Techniques for segmenting image curves into meaningful descriptions, Patt. Recogn., 24 (1991) 643-652.
9. R.T. Chin and A.R. Dyer, Model-based recognition in robot vision, ACM Comput. Surv., 18 (1986) 67-108.
10. R.T. Chin and C.A. Harlow, Automated visual inspection: a survey, IEEE Trans. PAMI, 4 (1982) 557-573.
11. R.T. Chin, Survey of automated visual inspection: 1981 to 1987, Comput. Vision Graphics Image Process., 41 (1988) 346-381.
12. H. Asada and M. Brady, The curvature primal sketch, IEEE Trans. PAMI, 8 (1986) 2-14.
13. A. Sirjani and G.R. Cross, An algorithm for polygonal approximation of a digital object, Patt. Recogn. Lett., 7 (1988) 299-303.
14. W. Kim and R.H. Park, Contour coding based on the decomposition of line segments, Patt. Recogn. Lett., 11 (1990) 191-195.
15. R. Sriraman, J. Koplowitz and S. Mohan, Tree search chain coding for subpixel reconstruction of planar curves, IEEE Trans. PAMI, 11 (1989) 95-104.
16. V.K. Rohatgi, Statistical Inference, Wiley, New York (1984).
17. T. Pavlidis, Waveform segmentation through functional approximation, IEEE Trans. Comput., 22 (1973) 689-697.
18. U. Ramer, An iterative procedure for the polygonal approximation of plane curves, Comput. Vision Graph., Image Process. 1 (1972) 244-256.
19. R.M. Bolle and B.C. Vemuri, On three-dimensional surface reconstruction methods, IEEE Trans. PAMI, 13 (1991) 1-13.
20. R. Safaee-Red, K.C. Smith and B. Benhabib, Accurate estimation of elliptical shape parameters from a grey-level image, Proc. Int. Conf. Patt. Recogn., 2 (1990) 20-26.
21. S. Yeralan and J.A. Ventura, Computerized roundness inspection, Int. J. Prod. Res., 26 (1988) 1921-1935.
22. R. Bellman, On the approximation of curves by line segments using dynamic programming, Comm. ACM, 4 (1961) 284.
23. B. Gluss, Further remarks on line segment curve-fitting using dynamic programming, Comm. ACM, 5 (1962) 441-443.
24. S.E. Dreyfus and A.M. Law, The Art and Theory of Dynamic Programming, Academic Press, New York (1977).