Analysis of relaxation processes: The two-node two-label case

Several relaxation processes are analyzed in the simple case of two nodes, each having two possible labels. It is shown that the choice of coefficients is very important. For certain values of the coefficients, some processes will have a single nontrivial convergence point regardless of the initial labeling. For other choices of the coefficients, there can be more than one possible convergence point, and different solutions can be obtained for different initial labelings. In the probabilistic approach where the coefficients are predefined in terms of joint probabilities, there are always two nontrivial convergence points for all possible coefficients. The results are also compared to the Bayesian analysis that can be obtained in this simple case of two nodes. Since certain selections of coefficients can give unacceptable results even in this simple case, it can be expected that the proper selection of coefficients will be much more important in the general case involving larger numbers of nodes and labels.

[1]  S. H. Unger,et al.  A Computer Oriented toward Spatial Problems , 1899, Proceedings of the IRE.

[2]  S. H. Unger,et al.  Pattern Detection and Recognition , 1959, Proceedings of the IRE.

[3]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[4]  L. West.  Loop-Transmission Control Structures , 1972, IEEE Trans. Commun..

[5]  Gordon Bell,et al.  C.mmp: a multi-mini-processor , 1972, AFIPS '72 (Fall, part II).

[6]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

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

[8]  S. Tanimoto.  Pictorial feature distortion in a pyramid , 1976 .

[9]  Shmuel Peleg,et al.  Determining Compatibility Coefficients for Curve Enhancement Relaxation Processes , 1978 .

[10]  Clark D. Thomborson,et al.  Generalized Connection Networks for Parallel Processor Intercommunication , 1978, IEEE Trans. Computers.

[11]  Kenneth J. Thurber.  Distributed-processor communication architecture , 1979 .

[12]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[14]  Olivier D. Faugeras,et al.  Using Context in the Global Recognition of a Set of Objects: An Optimization Approach , 1980, IFIP Congress.

[15]  Michael L. Baird.  Structural Pattern Recognition , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[17]  Olivier D. Faugeras,et al.  Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[19]  Shimon Ullman.  Interfacing the one-dimensional scanning of an image with the application of two-dimensional operators , 1981 .

[20]  Steven L. Tanimoto,et al.  IMAGE IMAGE PROCESSOR BASED ON AN ARRAY OF PIPELINES. , 1981 .

[21]  Steven W. Zucker,et al.  On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  L. Uhr.  Converging Pyramids of Arrays , 1984 .