Skip to main content
SpringerLink
Log in

Retrieving 2D shapes using caterpillar decomposition

  • Short Paper
  • Published:
Machine Vision and Applications Aims and scope Submit manuscript

Abstract

Graphs provide effective data structures modeling complex relations and schemaless data such as images, XML documents, circuits, compounds, and proteins. Given a query graph, finding sufficiently similar database graphs without performing a sequential search is an important problem arising in different domains. In this paper, we propose a new method for indexing tree structures based on a graph-theoretic concept called caterpillar decomposition. Our algorithm starts by representing each tree along with its subtrees in the geometric space using its caterpillar decomposition. After representing the query in the same fashion, similar database trees are retrieved efficiently by means of nearest neighbor searches. We have successfully evaluated the proposed algorithm on two shape databases and include a set of perturbation experiments that establish the algorithm’s robustness to noise. We have also shown that the approach compares favorably to previous approaches for shape retrieval on these datasets.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berretti S., Del Bimbo A., Vicario E.: Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1089–1105 (2001)

    Article  Google Scholar 

  2. Bicego, M., Lagorio, A., Grosso, E., Tistarelli, M.: On the use of sift features for face authentication. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshop, CVPRW ’06, IEEE Computer Society, Washington, DC (2006)

  3. Blum H.: Biological shape and visual science (Part I). J. Theor. Biol. 38(2), 205–287 (1973)

    Article  Google Scholar 

  4. Chen, Q., Lim, A., Ong, K.: D(k)-index: an adaptive structural summary for graph-structured data. In: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 134–144, ACM, New York (2003)

  5. Demirci, M.F.:Graph-based shape indexing. Mach. Vis. Appl. pp. 1–15, (2010) doi:10.1007/s00138-010-0290-z

  6. Demirci M.F., van Leuken R.H., Veltkamp R.C.: Indexing through Laplacian spectra. Comput. Vis. Image Understand. 110(3), 312–325 (2008)

    Article  Google Scholar 

  7. Fergus, R., Perona, P., and Zisserman, A.: Object class recognition by unsupervised scale-invariant learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 264–271. IEEE Comput. Soc. (2003)

  8. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  9. Geusebroek J., Burghouts G., Smeulders A.: The Amsterdam library of object images. Int. J. Comput. Vis. 61(1), 103–112 (2005)

    Article  Google Scholar 

  10. Giblin P., Kimia B.: On the local form and transitions of symmetry sets, medial axes, and shocks. Int. J. Comput. Vis. 54(1–3), 143–156 (2003)

    Article  MATH  Google Scholar 

  11. Goedemé T., Nuttin M., Tuytelaars T., Van Gool L.: Omnidirectional vision based topological navigation. Int. J. Comput. Vis. 74, 219–236 (2007)

    Article  Google Scholar 

  12. Gupta, A.: Embedding tree metrics into low dimensional euclidean spaces. In: Proceedings of the Thirty-first Annual ACM symposium on Theory of computing, pp. 694–700, ACM, New York (1999)

  13. Lowe D.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60, 91–110 (2004)

    Article  Google Scholar 

  14. Matousek J.: On embedding trees into uniformly convex banach spaces. Isr. J. Math. 237, 221–237 (1999)

    Article  MathSciNet  Google Scholar 

  15. Messmer B.T., Bunke H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. 20, 493–504 (1998)

    Article  Google Scholar 

  16. Messmer B.T., Bunke H.: A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognit. 32(12), 1979–1998 (1999)

    Article  Google Scholar 

  17. Min J., Chung C., Shim K.: An adaptive path index for xml data using the query workload. Inf. Syst. 30(6), 467–487 (2005)

    Article  Google Scholar 

  18. Nister, D., Stewenius, H.:Scalable recognition with a vocabulary tree. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2161–2168, IEEE Computer Society, Washington, DC (2006)

  19. Petrakis E.G.M., Faloutsos C.: Similarity searching in medical image databases. IEEE Trans. Knowl. Data Eng. 9, 435–447 (1997)

    Article  Google Scholar 

  20. Se S., Lowe D., Little J.: Mobile robot localization and mapping with uncertainty using scale-invariant visual landmarks. Int. J. Robot. Res. 21, 735–758 (2002)

    Article  Google Scholar 

  21. Shasha, D., Wang, J., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems, pp. 39–52, ACM, New York (2002)

  22. Shih F., Kowalski A.: Computing unique three-dimensional object aspects representation. Inf. Sci. 132, 13–22 (2001)

    Article  MATH  Google Scholar 

  23. Shilane, P., Min, P., Kazhdan, M., Funkhouser, T.: The Princeton shape benchmark. In: Proceedings of the Shape Modeling International, pp. 167–178, IEEE Computer Society, Washington, DC (2004)

  24. Shokoufandeh A., Macrini D., Dickinson S., Siddiqi K., Zucker S.W.: Indexing hierarchical structures using graph spectra. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1125–1140 (2005)

    Article  Google Scholar 

  25. Uhlmann J.K.: Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett. 40, 175–179 (1991)

    Article  MATH  Google Scholar 

  26. Yan, X., Yu, P., Han, J.: Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 335–346, ACM, New York (2004)

  27. Yilmaz, F., Demirci, M.F.: Indexing tree structures through caterpillar decomposition. In: Heyden, A., Kahl, F. (eds.) SCIA volume 6688 of Lecture Notes in Computer Science, pp. 687–696. Springer (2011)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, TOBB University of Economics and Technology, Ankara, Turkey

    M. Fatih Demirci

Authors
  1. M. Fatih Demirci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Fatih Demirci.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demirci, M.F. Retrieving 2D shapes using caterpillar decomposition. Machine Vision and Applications 24, 435–445 (2013). https://doi.org/10.1007/s00138-012-0406-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00138-012-0406-8

Keywords

Search

Navigation