This Article 
 Bibliographic References 
 Add to: 
A Multilevel Parallel Processing Approach to Scene Labeling Problems
July 1988 (vol. 10 no. 4)
pp. 586-590

A parallel tree search procedure and multilevel array architectures are presented for scene labeling problems. In the scene labeling problem, when the number of variables is not large, e.g. less than 100, its solutions and search space are not expected to greatly increase with problem size. The multilevel arrays only use a polynomial number of processors at each level and a bus or mesh connection for interlevel communication. This approach is very efficient compared to the binary-tree machine if the number of nodes in the search tree of labeling problem increases polynomially with the number of variables. Because of its regular structure, the multilevel array is particularly suitable for VLSI implementation.

[1] D. H. Ballard and C. M. Brown,Computer Vision. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[2] R. M. Haralick and L. G. Shapiro, "The consistent labeling problem--Parts I and II,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 173-184, Apr. 1979, vol. PAMI-2, pp. 193-203, May 1980.
[3] R. M. Haralick and G. L. Elliott, "Increasing tree search efficiency for constraint satisfaction problems,"Artificial Intell., vol. 14, pp. 263-313, 1980.
[4] L. S. Haynes, R. L. Lau, D. P. Siewiorek, and D. W. Mizell, "A survey of highly parallel computing,"IEEE Comput., vol. 15, pp. 9-26, Jan. 1982.
[5] K. Hwang, "Computer architectures for image processing,"IEEE Comput., vol. 16, pp. 10-12, Jan. 1983.
[6] H. H. Liu and T. Y. Young, "VLSI algorithms and structures for consistent labeling," inProc. IEEE Workshop Comput. Arch. Pattern Anal. Image Database Man., 1985, pp. 25-32.
[7] A. K. Mackworth and E. C. Freuder, "The complexity of some polynomial network consistency algorithms for constraint satisfaction problems,"Artificial Intell., vol. 25, pp. 65-74, 1985.
[8] J. T. McCall, J. G. Tront, F. G. Gray, R. M. Haralick, and W. M. McCormack, "Parallel computer architectures and problem solving strategies for the consistent labeling problem,"IEEE Trans. Comput., vol. C-34, no. 11, pp. 973-980, Nov. 1985.
[9] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[10] B. Nudel, "Consistent-labeling problem and their algorithms: Expected-complexities and theory-based heuristics,"Artificial Intell., vol. 21, pp. 135-178, 1983.
[11] D. Reisis and V. K. Prasanna Kumar, "Parallel processing of the labeling problem," inProc. IEEE Workshop Comput. Arch. Pattern Anal. Image Database Man., 1985, pp. 381-385.
[12] A. Rosenfeld, R. A. Hummel, and S. W. Zucker, "Scene labeling by relaxation operations,"IEEE Trans. Syst., Man, Cybern., vol. SMC-6, pp. 420-433, June 1976.
[13] B. W. Wah and Y. W. E. Ma, "MANIP--A multicomputer architecture for solving combinational extremum-search problems,"IEEE Trans. Comput., vol. C-33, pp. 377-390, May 1984.
[14] D. L. Waltz, "Understanding line drawings of scenes with shadows," inThe Psychology of Computer Vision, P. H. Winston, Ed. New York: McGraw-Hill, 1975, pp. 19-91.

Index Terms:
computerised picture processing; computerised pattern recognition; multilevel parallel processing; scene labeling; parallel tree search; multilevel array architectures; polynomial; computerised pattern recognition; computerised picture processing; parallel processing; trees (mathematics)
H.H. Liu, T.Y. Young, A. Das, "A Multilevel Parallel Processing Approach to Scene Labeling Problems," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 586-590, July 1988, doi:10.1109/34.3919
Usage of this product signifies your acceptance of the Terms of Use.