Corner Detection and Curve Partitioning Using Arc-Chord Distance
There are several algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along the curve and the distance from each border pixel to the chord is computed. The scale of the corners detected by these algorithms depends on the choice of integer k. Without a priori knowledge about the curve, it is difficult to choose a k that yields good results. This paper presents a modified method of this type that can tolerate the effects of an improper choice of k to an acceptable degree.
KeywordsCorner Detection Acceptable Degree Polygonal Approximation Border Point Pattern Recognition Letter
Unable to display preview. Download preview PDF.
- 2.Rutkowski, W.S., Rosenfeld, A.: A comparison of corner-detection techniques for chain-coded curves. Technical Report TR-623, Computer Science Center, University of Maryland (1978)Google Scholar
- 5.Han, J.H.: Detection of convex and concave discontinuous points in a plane curve. In: Proc. 3rd Int. Conf. Computer Vision, Osaka, Japan, December 4-7, pp. 71–74 (1990)Google Scholar