Indexing Outline Shapes Using Simple Polygons

Indexing Outline Shapes Using Simple Polygons

Saliha Aouat
Copyright: © 2015 |Pages: 17
DOI: 10.4018/IJIRR.2015010102
(Individual Articles)
No Current Special Offers


In this paper, a new approach is proposed for modeling and indexing outline shapes by using simple primitives extracted from the contours of objects. The primitives are line segments and curves described with few bytes of text thanks to use of parametric equations of those primitives. The author also proposes a new and an efficient way to index the outline shapes. Indexes are issued from characteristic polygons determined on the outline shapes of objects. Despite the recognition process is not the aim of their method, the proposed indexing process only is sufficient to retrieve a few most similar models for a given query. Experiments are done on synthetic and real images and give very encouraging results in order to apply the author's approach to the recognition process which will be the next step after this work.
Article Preview

1. Introduction

Indexing and retrieval techniques refer to a process of retrieving expected images from databases according to image queries or a number of features (e.g. color, texture and shape), which can be automatically extracted from the images using reasoning techniques. Some of those approaches use the outlines of objects described by a succession of straight line segments or curves (Belongie et Al., 2002; Zhang & Lu, 2004).

After many years of continuous development, indexing and retrieval technologies have become more and more mature and start play a key role in human life (e.g. a commercial package namely QBIC is available since 1995 (Flickner et Al., 1995)).

Various methods have been developed in order to represent and index shapes in an abstract and efficient way. The most interesting are part-based methods where a silhouette is decomposed into parts (Arandjelovic & Zisserman, 2010; Cronin, 2003), the aspect-graph methods that are viewer-centered representations of a three-dimensional object (Cyr & Kimia, 2004; Keysers et Al., 2007; Latecki et Al., 2005), methods that use the medial axis of silhouettes (Ma & Latecki, 2011; Mokhtarian, 1995) and appearance-based methods (Mokhtarian & Mackworth, 1992; Philbin et Al., 2007;Trinh & Kimia, 2011).

Indexing database of images facilitates the retrieval problem of any image. The indexing process has been considerably applied to various areas such as search engines, medical informatics, surveillance and digital rights management (Kato et Al., 1992; Hersh et Al., 2006; Hoad & Zobel, 2003).

The indexing and the recognition of objects using database of shapes is a current and difficult problem. Different methods based on different representations of shapes have been proposed. All of these methods proceed on descriptors comparison, and a similarity measure is then computed and used for the indexing process.

Among those methods, Geometry-based approaches that extract points from the image (usually edge or corner points) and reduce the problem to point set matching. Users are more interested in matching and retrieval by shape than by color and texture (Wang et Al., 2011; Yang et Al., 2008; Zaeri et Al, 2008). Segments are particularly interesting features (Lamdan & Wolfson, 1988; Matusiak, 1999; Lamiroy & Gros, 1996) because of their robustness to noise and their connectedness constraint that reduce the possibility of false matches. They also have the properties to vary slightly with a small change in the viewpoint, and to be invariant under similarity transform of the image (Gros, 1993).

Our aim is to develop an indexing and retrieval system. This system is based, first, on the extraction of elementary primitives of objects. The objects are represented by their silhouettes because our system is an appearance-based. This induces that the indexing process is restricted to 2D-2D matching, instead of directly interpreting 3D object information, and perform the object retrieval in the 2D indexes representation space.

In Sections 2 and 3, our modeling and indexing schemes are respectively presented and detailed. The proposed algorithms will be also given and discussed.

Our approach is validated in the fourth experimenting section in which application results on synthetic and real images will be presented and commented.

Complete Article List

Search this Journal:
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 11: 4 Issues (2021)
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