Skeleton Tree for Shape-Based Image Retrieval


The KIPS Transactions:PartB , Vol. 14, No. 4, pp. 263-272, Aug. 2007
10.3745/KIPSTB.2007.14.4.263,   PDF Download:

Abstract

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Park, "Skeleton Tree for Shape-Based Image Retrieval," The KIPS Transactions:PartB , vol. 14, no. 4, pp. 263-272, 2007. DOI: 10.3745/KIPSTB.2007.14.4.263.

[ACM Style]
Jong Seung Park. 2007. Skeleton Tree for Shape-Based Image Retrieval. The KIPS Transactions:PartB , 14, 4, (2007), 263-272. DOI: 10.3745/KIPSTB.2007.14.4.263.