Concavity Point Detection by Iterative Arrays

https://doi.org/10.1016/0146-664X(74)90009-4Get rights and content

Points of concavity constitute an important feature of every digital picture. A 1-1 correspondence exists between them and any significant negative inflection of the digitized contour. Each point of concavity may be seen as a point marking the superposition region of two convex contours. A sufficient condition is given in order that a simple arc of the contour be concave and a parallel process is shown by means of which one point of concavity is detected in correspondence to every concave arc. An iterative array of the type of CLIP 3 has been used to implement the process and a description of the behavior of the machine is given. A detailed program is included.

References (23)

  • R. Baker

    A spatially-oriented information processor which simulates the motions of rigid objects

    Artificial Intelligence

    (1973)
  • M.J.B. Duff et al.

    A cellular logic array for image processing

    Pattern Recognition

    (1973)
  • J. Sklansky

    Recognition of convex blobs

    Pattern Recognition

    (1970)
  • J. von Neumann
  • S.H. Unger

    Pattern detection and recognition

    Proc. IRE

    (1959)
  • B.H. McCormick

    The Illinois pattern recognition computer-ILLIAC 111

    IEEE Trans. Electronic Computers

    (1963)
  • W.T. Beyer

    Recognition of topological invariants by iterative arrays

  • A.R. Smith III

    Two-dimensional formal languages and pattern recognition by cellular automata

    Twelfth Annual Symp. Switching and Automata

    (1971)
  • S. Levialdi

    On shrinking binary picture patterns

    Comm. ACM

    (1972)
  • K.N. Levitt et al.

    Cellular arrays for the solution of graph problems

    Comm. ACM

    (1972)
  • M.J.B. Duff

    CLIP 3-A cellular logic image processor

  • Cited by (0)

    View full text