Please use this identifier to cite or link to this item:
|Title:||Indexing shapes in image databases using the centroid-radii model|
|Authors:||Tan, K.-L. |
|Citation:||Tan, K.-L., Ooi, B.C., Thiang, L.F. (2000). Indexing shapes in image databases using the centroid-radii model. Data and Knowledge Engineering 32 (3) : 271-289. ScholarBank@NUS Repository. https://doi.org/10.1016/S0169-023X(99)00039-7|
|Abstract:||In content-based image retrieval systems, the content of an image such as color, shapes and textures are used to retrieve images that are similar to a query image. Most of the existing work focus on the retrieval effectiveness of using content for retrieval, i.e., study the accuracy (in terms of recall and precision) of using different representations of content. In this paper, we address the issue of retrieval efficiency, i.e., study the speed of retrieval, since a slow system is not useful for large image databases. In particular, we look at using the shape feature as the content of an image, and employ the centroid-radii model to represent the shape feature of objects in an image. This facilitates multi-resolution and similarity retrievals. Furthermore, using the model, the shape of an object can be transformed into a point in a high-dimensional data space. We can thus employ any existing high-dimensional point index as an index to speed up the retrieval of images. We propose a multi-level R-tree index, called the Nested R-trees (NR-trees) and compare its performance with that of the R-tree. Our experimental study shows that NR-trees can reduce the retrieval time significantly compared to R-tree, and facilitate similarity retrieval. We note that our NR-trees can also be used to index high-dimensional point data commonly found in many other applications.|
|Source Title:||Data and Knowledge Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 24, 2018
WEB OF SCIENCETM
checked on Sep 5, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.