Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/7402
Title: Retrieving 2D shapes using caterpillar decomposition
Authors: Demirci, Muhammed Fatih
Keywords: Shape retrieval
Indexing
Caterpillar decomposition
Issue Date: 2013
Publisher: Springer
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.
URI: https://doi.org/10.1007/s00138-012-0406-8
https://hdl.handle.net/20.500.11851/7402
ISSN: 0932-8092
1432-1769
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

SCOPUSTM   
Citations

4
checked on Sep 23, 2022

WEB OF SCIENCETM
Citations

5
checked on Sep 24, 2022

Page view(s)

34
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.