Connectedness of coherent fuzzy pictures

Abstract A fuzzy digital picture is called “connected” if it has only one connected component of constant fuzzy level that is maximal, i.e., not adjacent to any component of higher fuzzy level. In this paper, we propose two acceptors defined over fuzzy digital pictures. One is a one-pebble acceptor and another is a deterministic one-way nonwriting parallel/sequential acceptor. We also prove that both acceptors can determine whether a given coherent fuzzy digital picture is connected.

[1]  Stanley M. Selkow.  One-Pass Complexity of Digital Picture Properties , 1972, JACM.

[2]  Azriel Rosenfeld,et al.  Parallel / Sequential Array Automata , 1973, Inf. Process. Lett..

[3]  Azriel Rosenfeld,et al.  The perimeter of a fuzzy set , 1985, Pattern Recognit..

[4]  Akira Nakamura,et al.  On the Recognition of Properties of Three-Dimensional Pictures , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Azriel Rosenfeld,et al.  Fuzzy Digital Topology , 1979, Inf. Control..

[6]  Azriel Rosenfeld,et al.  On connectivity properties of grayscale pictures , 1981, Pattern Recognit..

[7]  A. Rosenfeld.  The fuzzy geometry of image subsets , 1984, Pattern Recognit. Lett..