Multiresolution spatial partitioning for shape representation

An original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference points with respect to which a relationship matrix is computed, accounting for the spatial distribution of shape pixels. This is accomplished at different levels of resolution by a tree based representation. Depending on the number of points, coarse to fine region and boundary shape information are captured. Properties of the representation are discussed and assessed through an experimental evaluation on a set of sample shapes.

[1]  Alberto Del Bimbo,et al.  Weighted walkthroughs between extended entities for retrieval by spatial arrangement , 2003, IEEE Trans. Multim..

[2]  Miroslaw Bober,et al.  MPEG-7 visual shape descriptors , 2001, IEEE Trans. Circuits Syst. Video Technol..

[3]  Euripides G. M. Petrakis,et al.  Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Farzin Mokhtarian,et al.  Silhouette-Based Isolated Object Recognition through Curvature Scale Space , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Sven Loncaric,et al.  A survey of shape analysis techniques , 1998, Pattern Recognit..