Constraint propagation neural networks for Huffman-Clowes scene labeling

The authors propose a three-layered neural network to perform Huffman-Clowes scene labeling. The proposed neural network uses the topology and the interconnections of neurons to achieve global consistency through propagating local constraints. The problem-solving knowledge is embedded in the topology as well as the connections between neurons in the network. A brief review of the Huffman-Clowes scene labeling scheme is presented. The proposed constraint propagation neural network is described. Several examples are given to illustrate the operation of the network. Time complexity analysis of the network is discussed. A comparison with conventional algorithms is given. The characteristics of the proposed neural networks are discussed. >

[1]  M. B. Clowes,et al.  On Seeing Things , 1971, Artif. Intell..

[2]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[3]  Robert J. Schalkoff,et al.  Artificial Intelligence: An Engineering Approach , 1990 .

[4]  Azriel Rosenfeld,et al.  Reduction operations for constraint satisfaction , 1978, Inf. Sci..

[5]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[6]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[7]  Lefteris M. Kirousis Effectively Labeling Planar Projections of Polyhedra , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Drew McDermott,et al.  Introduction to artificial intelligence , 1986, Addison-Wesley series in computer science.

[9]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  Eugene C. Freuder Synthesizing constraint expressions , 1978, CACM.

[11]  David Zipser,et al.  Feature Discovery by Competive Learning , 1986, Cogn. Sci..

[12]  Bernard Nudel,et al.  Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics , 1983, Artif. Intell..

[13]  K. Sugihara Machine interpretation of line drawings , 1986, MIT Press series in artificial intelligence.

[14]  Alan K. Mackworth Consistency in Networks of Relations , 1977, Artif. Intell..

[15]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..