Shape retrieval using concavity trees

Concavity trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The first is an efficient (in terms of space and time) contour-based concavity tree extraction algorithm. The second component is a recursive concavity-tree matching algorithm that returns a distance between two trees. We demonstrate that concavity trees are able to boost the retrieval performance of two feature sets by at least 15% when tested on a database of 625 silhouette images.

[1]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[2]  B. G. Batchelor.  Shape Descriptors for Labeling Concavity Trees , 1980, Cybern. Syst..

[3]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[4]  Gabriella Sanniti di Baja,et al.  Methods for hierarchical analysis of concavities , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[5]  B. G. Batchelor,et al.  Hierarchical Shape Description Based upon Convex Hulls of Concavities , 1980, Cybern. Syst..

[6]  Jack Sklansky,et al.  Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[7]  Jianning Xu.  Hierarchical representation of 2-D shapes using convex polygons: A morphological approach , 1997, Pattern Recognit. Lett..

[8]  Mohamed S. Kamel,et al.  Matching Concavity Trees , 2004, SSPR/SPR.

[9]  Gabriella Sanniti di Baja,et al.  Analyzing Nonconvex 2D and 3D Patterns , 1996, Comput. Vis. Image Underst..

[10]  Mohamed S. Kamel,et al.  Shape-Based Image Retrieval Applied to Trademark Images , 2002, Int. J. Image Graph..