About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On Geometric Hashing and the Generalized Hough Transform
Abstract
The generalized Hough transform and geometric hashing are two contemporary paradigms for model-based object recognition. Both schemes simultaneously find instances of objects in a scene and determine the location and orientation of these instances. The methods encode the models for the objects in a similar fashion and object recognition is achieved by image features “voting” for object models. For both schemes, the object recognition time is largely independent of the number of objects that are encoded in the object-model database. This paper puts the two schemes in perspective and examines differences and similarities. We also study the object representation techniques and discuss how the object representations are used for object recognition and position estimation. © 1994 IEEE