Skip to main content
Log in

Retrieving Similar Shapes Effectively and Efficiently

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

In this paper, we address the following problem: given a large collection of shapes and a query shape, retrieve all shapes (from the shape database) that are similar to the query shape. A generalized centroid-radii model is used to model all forms of shapes — convex shapes, concave shapes and shapes with “holes”. Under the model, a shape is represented by a set of vectors, each obtained from the radii emanating from the centroid of a virtual concentric ring.

The model can also facilitate 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. To speed up the retrieval of similar shapes, we also propose a multi-level R-tree index, called the Nested R-trees (NR-trees). Unlike traditional high-dimensional index structures that index a high-dimensional point as it is (with its full dimension), the NR-trees splits the dimensionality of the point into a set of lower dimensions that are indexed by levels of the NR-trees. We also proposed a quick filtering mechanism to further prune the search space.

We implemented a shape retrieval system that employs the generalized centroid-radii model and the NR-trees with the filtering mechanism. Our experimental study shows the effectiveness of the proposed shape model, and the efficiency of the NR-trees. The results also show that the filtering mechanism can significantly reduce the retrieval time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.R. Bach, C. Fuller, A. Gupta, A. Hampapur, B. Horowitz, R. Humphrey, R.C. Jain, and C. Shu, “The virage image search enginee: An open framework for image management,” in SPIE Proceedings of the Storage and Retrieval for Still Images and Video Databases IV, February 1996, pp. 76–86.

  2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-tree: An efficient and robust access method for points and rectangles,” in Proceedings of the 1990 ACM-SIGMOD Conference, Atlantic City, NJ, June 1990, pp. 322–331.

  3. S. Belongie, C. Carson, H. Greenspan, and J. Malik, “Recognition of images in large databases using color and texture,” available at http: //elib.cs.berkeley.edu/papers.html, 1997.

  4. S. Berchtold, D.A. Keim, and H.-P. Kriegel, “The X-tree: An index structure for high-dimensional data,” in Proceedings of the 22nd VLDB Conference, Mumbai, India, September 1996, pp. 28–39.

  5. E. Bertino, B.C. Ooi, R. Sacks-Davis, K.L. Tan, J. Zobel, B. Shilovsky, and B. Catania, Indexing Techniques for Advanced Database Systems, Kluwer Academic Publishers, 1997.

  6. Y. Chahir and L. Chen, “Peano key rediscovery for content-based retrieval of images,” in Proceedings of the SPIE Multimedia Storage and Archiving Systmes II, Dallas, Texas, November 1997, pp. 172–181.

  7. S.K. Chang and A. Hsu, “Image information systems: Where do we go from here?” IEEE Transactions on Knowledge and Data Engineering, Vol. 4, No. 5, pp. 431–442, 1992.

    Google Scholar 

  8. C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, and R. Barber, “Efficient and effective querying by image content,” Journal of Intelligent Information Systems, Vol. 3, No. 3, pp. 231–262, 1994.

    Google Scholar 

  9. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, “Query by image and video content: The qbic system,” IEEE Computer, Vol. 28, No. 9, pp. 23–32, 1995.

    Google Scholar 

  10. S.T. Goh and K.L. Tan, “Mosaic: A fast multi-feature image retrieval system,” Data and Knowledge Engineering, 2000.

  11. A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proceedings of the 1984 ACM SIGMOD Conference, May 1984, pp. 47–57.

  12. J. Huang, S.R. Kumar, and M. Mitra, “Combining supervised learning with color correlograms for contentbased image retrieval,” in Proceedings of the ACM Multimedia'97, Seattle, Washington, November 1997, pp. 325–334.

  13. C.E. Jacobs, A. Finkelstein, and D.H. Salesin, “Fast mulit-resolution image querying,” in Proceedings of the Computer Graphics Conference, Los Angeles, CA, August 1995, pp. 277–286.

  14. H.V. Jagadish, “A retrieval technique for similar shape,” in Proceedings of the ACM SIGMOD Conference, May 1991, pp. 208–217.

  15. K.F. Jea and Y.C. Lee, “Building efficient and flexible feature-based indexes,” Information Systems, Vol. 16, No. 6, pp. 653–662, 1990.

    Google Scholar 

  16. N. Katayama and S. Satoh, “The SR-tree: An index structure for high-dimensional nearest neighbor queries,” in Proceedings of the 1997 ACM-SIGMOD Conference, Tucson, Arizona, May 1997, pp. 369–380.

  17. P.M. Kelly, M. Cannon, and D.R. Hush, “Query by image example: The comparison algorithm for navigating digital image databases (candid) approach,” in SPIE Proceedings of the Storage and Retrieval for Still Images and Video Databases III, February 1995, pp. 238–249.

  18. D.E. Knuth and L.M. Wegner (Eds.), Visual Database Systems II, North-Holland, 1992.

  19. F. Korn, C. Faloutsos, N. Sidiropoulos, E. Siegel, and Z. Protopapas, “Fast nearest neighbor search in medical image databases,” in Proceedings of the 22th VLDB Conference, Mumbai, India, September 1996, pp. 215–226.

  20. K. Lin, H.V. Jagadish, and C. Faloutsos, “The TV-tree: An index structure for high-dimensional data,” The VLDB Journal, Vol. 3, No. 4, pp. 517–542, 1994.

    Google Scholar 

  21. S. Mallat, “Atheory for multiresolution signal decomposition: Thewavelet representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, No. 7, pp. 2091–2110, 1989.

    Google Scholar 

  22. P. Maragos, “Pattern spectrum and multiscale shape representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, No. 7, pp. 701–716, 1989.

    Google Scholar 

  23. P. Maragos and R.W. Schafer, “Morphological skeleton representation and coding of binary images,” IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. 34, pp. 1228–1244, 1986.

    Google Scholar 

  24. R. Mehrotra and J.E. Gary, “Feature-based retrieval of similar shapes,” in Proc. of the 9th Data Engineering Conference, April 1993, pp. 108–115.

  25. W. Niblack, R. Barber, W. Equitz, M. Flicker, E. Glasman, D. Petkovic, P. Yanker, and C. Faloutsos, “The QBIC project: Query images by content using color, texture and shape,” in SPIE V1908, 1993.

  26. J. Nievergelt, H. Hinterberger, and K.C. Sevcik, “The grid file: An adaptable, symmetric multikey file structure,” ACM TODS, Vol. 9, No. 1, pp. 38–71, 1984.

    Google Scholar 

  27. V.E. Ogle and M. Stonebraker, “Chabot: Retrieval from a relational database of images,” IEEE Computer, Vol. 28, No. 9, pp. 40–48, 1995.

    Google Scholar 

  28. B.C. Ooi, K.L. Tan, T.S. Chua, and W. Hsu, “Fast image retrieval using color-spatial information,” The VLDB Journal, Vol. 7, No. 2, pp. 115–128, 1998.

    Google Scholar 

  29. A. Pentland, R.W. Picard, and S. Sclaroff, “Photobook: Content-based manipulation of image databases,” Technical Report 255, MIT Media Lab Perceptual Computing, 1993.

  30. J.T. Robinson, “The K-D-B-tree: A search structure for large multidimensional dynamic indexes,” in Proceedings of the 1981 ACM-SIGMOD Conference, June 1981, pp. 10–18.

  31. T. Sellis, N. Roussopoulous, and C. Faloutsos, “R+-trees: A dynamic index for multi-dimensional objects,” in Proceedings of the 16th VLDB Conference, Brighton, England, August 1987, pp. 507–518.

  32. J. Serra, “Image analysis and mathematical morphology, Vol. 2: Theoretical advances,” Academic: San Diego, 1988.

    Google Scholar 

  33. J.R. Smith and S.-F. Chang, “VisualSEEk: A fully automated content-based image query system,” in Proceedings of the 1996 ACM Multimedia Conference, Boston, MA, November 1996, pp. 87–98.

  34. M.J. Swain, “Interactive indexing into image database,” in SPIE V1908, 1993.

  35. M.J. Swain and D.H. Ballard, “Color indexing,” International Journal of Computer Vision, Vol. 7, No. 1, pp. 11–32, 1991.

    Google Scholar 

  36. K.L. Tan, B.C. Ooi, and C.Y. Yee, “An evaluation of color-spatial retrieval techniques for large image databases,” Multimedia Tools and Applications, 2001.

  37. X. Wan and C.C.J. Kuo, “Pruned octree feature for interactive retrieval,” in Proceedings of the SPIE Multimedia Storage and Archiving Systmes II, Dallas, Texas, November 1997, pp. 182–193.

  38. C.Y. Yee, K.L. Tan, T.S. Chua, and B.C. Ooi, “An empirical study of color-spatial retrieval techniques for large image databases,” in Proc. of the International Conference on Mutlimedia Computing and Systems'98, June 1998, pp. 218–221.

  39. P.C. Yuen, G.C. Feng, and Y.Y. Tang, “Printed chinese character similarity measurement using ring projection and distance transform,” International Journal of Pattern Recognition and Artificial Intelligence, Vol. 12, No. 2, 1998.

  40. Z. Zhou and A.N. Venetsanopoulos, “Morphological skeleton representation and shape recognition,” in Proc. of the IEEE 2nd International Conference on ASSP, New York, 1988, pp. 48–951.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, KL., Ooi, B.C. & Thiang, L.F. Retrieving Similar Shapes Effectively and Efficiently. Multimedia Tools and Applications 19, 111–134 (2003). https://doi.org/10.1023/A:1022142527536

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022142527536

Navigation