An analysis of feature detectability from curvature estimation

A common approach to finding features in digitized lines is to estimate the curvature along the lines and determine the features from the curvature plot. The authors compare two approaches to curvature estimation by analyzing performance with respect to signal-to-noise ratio and signal localization of corner features. One approach, curvature estimation by difference of slopes, is analyzed to determine the spacing between slope estimates which yields optimum signal-to-noise ratio. The other approach, Gaussian smoothing of the second line derivative, is compared with the difference of slopes method and found to yield poorer signal localization for low signal-to-noise ratio. Besides analytical comparisons, the methods are tested and compared for digitized lines containing chosen corner angles and random noise. These empirical comparisons corroborate the analytical results.<<ETX>>

[1]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[2]  Charles M. Williams,et al.  Bounded straight-line approximation of digitized planar curves and lines , 1981 .

[3]  P. Sankar,et al.  A parallel procedure for the detection of dominant points on a digital curve , 1978 .

[4]  David H. Marimont.  A Representation for Image Curves , 1984, AAAI.

[5]  이한식.  ANALYZING INTENSITY ARRAYS USING KNOWLEDGE ABOUT SCENES , 1989 .

[6]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[7]  L. O'Gorman.  Curvilinear feature detection from curvature estimation , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[8]  Michael Brady,et al.  The Curvature Primal Sketch , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  T. Pavlidis,et al.  Curve Fitting and Curve Displaying , 1982 .

[10]  Azriel Rosenfeld,et al.  An Improved Method of Angle Detection on Digital Curves , 1975, IEEE Transactions on Computers.

[11]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[12]  Charles M. Williams,et al.  An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

[13]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[14]  Ivan Tomek,et al.  Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable , 1974, IEEE Transactions on Computers.

[15]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[16]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.