Corner Detection and Curve Partitioning Using Arc-Chord Distance

  • Majed Marji
  • Reinhard Klette
  • Pepe Siy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3322)


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.


Corner Detection Acceptable Degree Polygonal Approximation Border Point Pattern Recognition Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ramer, U.: An iterative procedure for the polygonal approximation of plane closed curves. Computer Graphics Image Processing 1, 244–256 (1972)CrossRefGoogle Scholar
  2. 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
  3. 3.
    Fischler, M., Bolles, R.: Perceptual organization and curve partitioning. IEEE Trans. Pattern Analysis Machine Intelligence 8, 100–105 (1986)CrossRefGoogle Scholar
  4. 4.
    Phillips, T.Y., Rosenfeld, A.: A method for curve partitioning using arc-chord distance. Pattern Recognition Letters 5, 285–288 (1987)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Lin, Y., Dou, J., Wang, H.: Contour shape description based on an arc height function. Pattern Recognition 25, 17–23 (1992)CrossRefGoogle Scholar
  7. 7.
    Aoyama, H., Kawagoe, M.: A piecewise linear approximation method for preserving visual feature points of original figures. CVGIP: Graphical Models and Image Processing 53, 435–446 (1991)zbMATHCrossRefGoogle Scholar
  8. 8.
    Wu, S.-Y., Wang, M.-J.: Detecting the dominant points by the curvature-based polygonal approximation. CVGIP: Graphical Models and Image Processing 5, 79–88 (1993)CrossRefGoogle Scholar
  9. 9.
    Fischler, M.A., Wolf, H.C.: Locating perceptually salient points on planar curves. IEEE Trans. Pattern Analysis Machine Intelligence 16, 113–129 (1994)CrossRefGoogle Scholar
  10. 10.
    Han, J.H., Poston, T.: Chord-to-point distance accumulation and planar curvature: a new approach to discrete curvature. Pattern Recognition Letters 22, 1133–1144 (2001)zbMATHCrossRefGoogle Scholar
  11. 11.
    The, C.-H., Chin, R.T.: On the detection of dominant points on digital curve. IEEE Trans. Pattern Analysis Machine Intelligence 11, 859–872 (1989)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Majed Marji
    • 1
  • Reinhard Klette
    • 2
  • Pepe Siy
    • 1
  1. 1.Daimler Chrysler CorporationAuburn HillsUSA
  2. 2.CITRThe University of AucklandAucklandNew Zealand

Personalised recommendations