A Simple and Efficient Algorithm for Detection of High Curvature Points in Planar Curves

A new algorithm is presented for detection of corners and other high curvature points in planar curves. A corner is defined as a location where a triangle with specified opening angle and size can be inscribed in the curve. The tests compare the new algorithm to four alternative algorithms for corner detection.

[1]  Mandyam D. Srinath,et al.  Corner detection from chain-code , 1990, Pattern Recognit..

[2]  Fang-Hsuan Cheng,et al.  Parallel algorithm for corner finding on digital curves , 1988, Pattern Recognit. Lett..

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

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

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

[6]  H. Lynn Beus,et al.  An improved corner detection algorithm based on chain-coded plane curves , 1987, Pattern Recognit..

[7]  G. Medioni,et al.  Corner detection and curve representation using cubic B-splines , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[8]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[9]  Farzin Mokhtarian,et al.  A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..