Abstract
We present a parallel implementation of an algorithm designed to recognize fully parameterized objects from 3D data. For the purpose of recognition, the mapping of sensed features with model features is structured as an interpretation tree. However, with the use of parameterized models, most of the computation performed during the tree search is actually spent in the updating step of the object parameters, this process being executed through a SUP/INF network. A major contribution of our implementation is the exploitation of the intrinsic parallelism of the SUP/INF network, while the interpretation tree search is also distributed on our transputer based MIMD architecture.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
