Multi-scale analysis of discrete point sets

Presents the shape of a sparse point set S in R/sup 2/. A crucial step in finding the shape of a sparse point set is the definition of its boundary. This boundary is a graph indicating a relation among the elements of S. No well defined definition of such a boundary is found in literature. For continuous point sets this problem does not exist as the boundary has a unique definition. The authors pose general criteria a boundary definition should satisfy and show that the alpha -graph satisfies those criteria. The boundary is a function of the scale parameter alpha . The authors further show that the alpha -graph has a strong relation with mathematical morphology. As an application the use of the alpha -graph in the multi-scale recognition of industrial objects is shown.<<ETX>>

[1]  Farzin Mokhtarian,et al.  Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Michael Brady,et al.  The Curvature Primal Sketch , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[4]  M.-H. Chen,et al.  A Multiscanning Approach Based on Morphological Filtering , 1989, IEEE Trans. Pattern Anal. Mach. Intell..