Hierarchical approach to feature indexing

摘要

We extend data driven indexed hypotheses, our previous approach to 2D shape indexing, to hierarchical features. It is shown mathematically and experimentally that an index based on hierarchical features is more computationally efficient than one based on non-hierarchical features under some very general conditions which are easily satisfied. Our approach addresses two types of hierarchies: a multilevel approximation of the contours of 2D objects; and a multilevel feature indexing system, which in this particular illustration consists of three levels. Our approach can easily be extended to 3D objects.