Fitting digital curve using circular arcs

Abstract A smoothing procedure is proposed, where the Gaussian filter is used with an adaptive mechanism to suppress the noise effect and quantization error of a digital curve. Those points of the smoothed curve where curvature changes abruptly are detected as breakpoints. Circular arcs are suitably designed between breakpoints to fit the input curve. Experimental results indicate that our curve-fitting method provides good approximations of the input curves.

[1]  Carlos Cabrelli,et al.  Automatic Representation of Binary Images , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Edward J. Delp,et al.  On detecting dominant points , 1991, Pattern Recognit..

[4]  Roland T. Chin,et al.  Scale-Based Detection of Corners of Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Wen-Yen Wu,et al.  Detecting the Dominant Points by the Curvature-Based Polygonal Approximation , 1993, CVGIP Graph. Model. Image Process..

[6]  Nirwan Ansari,et al.  Non-parametric dominant point detection , 1991, Pattern Recognition.

[7]  Philippe Saint-Marc,et al.  Adaptive Smoothing: A General Tool for Early Vision , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Bimal Kumar Ray,et al.  An algorithm for detection of dominant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[9]  Kumar S. Ray,et al.  Detection of significant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..