Fast Shape Classification Using Kolmogorov-Smirnov Statistics

Abstract

The fast classification of shapes is an important problem in shape analysis and of high relevance for many possible applications. In this paper, we consider the use of very fast and easy to compute statistical techniques for assessing shapes, which may for instance be useful for a first similarity search in a shape database. To this end, we con- struct shape signatures at hand of stochastic sampling of distances between points of interest in a given shape. By employing the Kolmogorov-Smirnov statistics we then propose to formulate the problem of shape classification as a statistical hypothesis test that enables to assess the similarity of the signature distributions. In order to illus- trate some important properties of our approach, we explore the use of simple sampling techniques. At hand of experiments conducted with a variety of shapes in two dimensions, we give a discussion of potentially interesting features of the method.