Cart (Loading....) | Create Account
Close category search window

A multilevel parallel processing approach to scene labeling problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liu, H.-H. ; Dept. of Electr. & Comput. Eng., Miami Univ., Coral Gables, FL, USA ; Young, T.Y. ; Das, A.

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

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:10 ,  Issue: 4 )

Date of Publication:

Jul 1988

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.