3-D OBJECT RECOGNITION USING BIPARTITE MATCHING EMBEDDED IN DISCRETE RELAXATION

In this paper we show how large efficiencies can be achieved in model-based 3-D vision by combining the notions of discrete relaxation and bipartite matching. The computational approach we present is empirically interesting and capable of pruning large segments of search space-an indispensable step when the number of objects in the model library is large and when recognition of complex objects with a large number of surfaces is called for. We use bipartite matching for quick wholesale rejection of inapplicable models. We also use bipartite matching for implementing one of the key steps of discrete relaxation: the determination of compatibility of a scene surface with a potential model surface taking into account relational considerations. While we are able to provide the time complexity function associated with those aspects of the procedure that are implemented via bipartite matching, we are not able to do so for the interative elements of the discrete relaxation computations. In defense of our claim regarding computational efficiencies of the method presented here, all we can say is that our algorithms do not take more than a couple of iterations even for objects with more than 30 surfaces.