Outline Shape Retrieval Using Textual Descriptors and Geometric Features

Outline Shape Retrieval Using Textual Descriptors and Geometric Features

Saliha Aouat (LRIA Laboratory, Department of Computer Science, University of Sciences and Technology– Houari Boumediene, Algiers, Algeria ) and Slimane Larabi (LRIA Laboratory, Department of Computer Science, University of Sciences and Technology– Houari Boumediene, Algiers, Algeria)
Copyright: © 2012 |Pages: 22
DOI: 10.4018/ijirr.2012100105
OnDemand PDF Download:
No Current Special Offers


Content_based image retrieval is a promising approach because of its automatic indexing, recognition and retrieval. This paper is a contribution in the field of the content Based Image Retrieval (CBIR). Objects are represented by their outlines shapes (silhouettes) and described following the XLWDOS Textual Description (Larabi et al., 2003). Textual Descriptors are sensitive to noise. The authors have already developed an approach to smooth the outlines at different scales (Aouat & Larabi, 2010). The smoothing is performed by applying a convolution using the Gaussian Filter to process noisy shapes in order to match shapes descriptors. The authors have also applied an indexing process after silhouettes smoothing (Aouat & Larabi, 2009). The approaches (Aouat & Larabi, 2010; Aouat & Larabi, 2009) are very interesting for shape matching and indexing, but unfortunately, they are not appropriate to the recognition and retrieval processes because there is no use of similarity measures. In order to perform the retrieval process and select the best model for a query silhouette, the authors use in this paper Geometric features extracted from Textual Description of Outline Shapes.
Article Preview

1. Introduction

The past few years have seen many advanced techniques evolving in Content-Based Image Retrieval (CBIR) systems. The rapid growth in the number of large scale image repositories in many domains has rough the need for efficient CBIR mechanisms. This envisages the need for fast and effective retrieval mechanisms in an efficient manner

There are two general methods for image matching, retrieval and recognition: intensity-based (color and texture) and geometry-based (shape). Intensity-based methods work with the intensity of the pixels and use the image itself as a feature descriptor. Geometry-based however, are feature-based methods that extract points from the image (usually edge or corner points) and reduce the problem to point set matching (Alvarado et al., 2002; Arandjelovic & Zisserman, 2010; Bernier & Landry, 2003; Chang & Kimia, 2011; Cronin, 2003; Cyr & Kimia, 2004; Geiger et al., 2003).

Shape retrieval methods are also classified into local, emphasizing local shape features or global, representing the shape as a whole. Global methods are usually easy to compute and robust against noise and shape distortions. Local methods are more complicated requiring sophisticated implementations and are slow, but are more suitable than global methods for recognizing occluded or partially visible objects. Another class of matching methods relies on symbolic entities extracted from shape contours (Keysers et al., 2007; Latecki et al., 2005; Ma & Latecki, 2011; Mokhtarian, 1995; Mokhtarian & Mackworth, 1992; Nelson & Selinger, 1998; Petrakis et al., 2002; Philbin et al., 2007; Ruberto, 2004; Sebastian et al., 2004; Trinh & Kimia, 2011;Wang et al., 2011;Yang et al., 2008; Zaeri et al., 2008). A review of shape representation methods can be found in Campbell and Flynn (2001) and Zhang and Lu (2004).

Several methods of image matching, indexing, and retrieval based on contour matching and recognition exist in the literature.

As our method is a feature-based approach using the outline shape, we will describe, in the following, the most known feature-based methods.

Authors in Berg et al. (2005) find a correspondence between the images as follows: (Given a model image P of an object, and a target image Q): Extract sparse oriented edge maps from each image, compute features based on geometric blur descriptors at locations with high edge energy, allow each of m feature points from P to potentially match any of the k most similar points in Q based on feature similarity and or proximity, construct cost matrices and approximate the resulting Binary Quadratic Optimization to obtain a correspondence, and, extend the correspondence on m points to a smooth map using a regularized thin plate spline. A key characteristic of the approach in Belongie et al. (2002) is the estimation of shape similarity and correspondences based on the shape context. It is a three-stage process: Solve the correspondence problem between two shapes, use the correspondences to estimate an aligning transform that maps one shape onto the other and then compute the distance between the two shapes as a sum of matching errors between corresponding points.

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 11: 4 Issues (2021): 1 Released, 3 Forthcoming
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing