Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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.  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.  have also shown that the approach compares favorably to previous approaches for shape retrieval on these datasets.
['M. Fatih Demirci']
I am writing a research paper on a idea Retrieving 2D shapes using caterpillar decomposition
[{"from": "human", "value": "I am writing a research paper on a idea Retrieving 2D shapes using caterpillar decomposition"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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.  have successfully evaluated the proposed algorithm on two shape databases and include a set of perturbation experiments that establish the algorithm\u2019s robustness to noise.  have also shown that the approach compares favorably to previous approaches for shape retrieval on these datasets."}]