The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July (1988 vol.10)
pp: 586-590
ABSTRACT
<p>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.</p>
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)
CITATION
H.H. Liu, T.Y. Young, A. Das, "A Multilevel Parallel Processing Approach to Scene Labeling Problems", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.10, no. 4, pp. 586-590, July 1988, doi:10.1109/34.3919
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool