Segmentation of digital plane curves: A dynamic focusing approach

Pattern Recognition Letters

Volumn 17, Issue 7, 1996, Pages 741-750

  Ichoku, Charles ^a   Deffontaines, Benoit ^a   Chorowicz, Jean ^a  

^a CNRS   (France)

Author keywords

Arc fitting; Digital plane curves; Dynamic focusing algorithm; Line fitting; Segmentation

Indexed keywords

ALGORITHMS; CURVE FITTING; DIGITAL SIGNAL PROCESSING; FOCUSING; SCANNING;

ARC FITTING; DIGITAL PLANE CURVES; DYNAMIC FOCUSING ALGORITHM; LINE FITTING;

IMAGE SEGMENTATION;

EID: 0030170473     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(96)00015-3     Document Type: Article

References (15)

1. Albano, A. (1974). Representation of digitized contours in terms of conic arcs and straight-line segments. Computer Graphics and Image Processing 3, 23-33.
2. Baruch, O. and M.H. Loew (1988). Segmentation of two-dimensional boundaries using chain codes. Pattern Recognition 21 (6), 581-589.
3. Davis, L.S. (1991). Shape representation and matching, In: R.A. Vaughan, Ed., Pattern Recognition and Image Processing in Physics. Adam Hilger, Bristol, 101-128.
4. Etemadi, A., (1992). Robust segmentation of edge data. Proc. 4th Internat. Conf. on Image Processing and its Applications, 311-313.
5. Illing, D.P. and P.T. Fairney (1991). Determining perpetually significant points on noisy boundary curves. Pattern Recognition Lett. 12, 557-564.
6. Pavlidis, T. and S.L. Horowitz (1974). Segmentation of plane curves. IEEE Trans. Comput. 23 (8), 860-870.
7. Pei, S.-C. and J.-H. Horng (1995). Fitting digital curve using circular arcs. Pattern Recognition 28 (1), 107-116.
8. Pikaz, A. and I. Dinstein (1995). Optimal polygonal approximation of digital curves. Pattern Recognition 28 (3), 373-379.
9. Ramer, U. (1972). An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1, 244-256.
10. Ray, B.K. and K.S. Ray (1995). A new split- and merge technique for polygonal approximation of chain coded curves. Pattern Recognition Lett. 16, 161-169.
11. Sarkar, D. (1993). A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves. Pattern Recognition Lett. 14, 959-964.
12. Spiegel, M.R. (1961). Theory and Problems of Statistics, Schaum's Outline Series. McGraw-Hill, New York.
13. Taubin, G. (1991). Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 13 (11), 1115-1138.
14. Ventura, J.A. and J.M. Chen (1992). Segmentation of two-dimensional curve contours. Pattern Recognition 25 (10), 1129-1140.
15. West, G.A.W. and P.L. Rosin (1991). Techniques for segmenting image curves into meaningful descriptions. Pattern Recognition 24 (7), 643-652.