Fast recognition using adaptive subdivisions of transformation space

An algorithm, RAST, for solving the bounded error recognition problem efficiently using adaptive subdivisions of transformation space, is presented. The RAST algorithm uses no heuristics and loses no solutions. It is a simple, efficient algorithm combining the ideas of multiresolution matching, Hough transform, search-based recognition, and bounded error recognition. Its performance is better than that of alignment and Hough transform methods, and, as opposed to these methods; RAST finds solutions satisfying simple, well-defined bounded error criteria