Journal of South China University of Technology (Natural Science Edition) ›› 2010, Vol. 38 ›› Issue (7): 27-32.doi: 10.3969/j.issn.1000-565X.2010.07.005

• Computer Science & Technology • Previous Articles     Next Articles

Shape Description and Skeleton-Graph Matching Algorithm Based on Histogram

Tang Jin  Jiang Bo  Luo Bin  Kong Min   

  1. School of Computer Science and Technology,Anhui University,Hefei 230039,Anhui,China
  • Received:2009-10-20 Revised:2010-01-06 Online:2010-07-25 Published:2010-07-25
  • Contact: 汤进（1976-）,男,副教授,博士,主要从事图像处理与模式识别研究. E-mail: ahhftang@gmail.com
  • About author:汤进（1976-）,男,副教授,博士,主要从事图像处理与模式识别研究.
  • Supported by:

    国家自然科学基金资助项目（60772122）; 安徽省教育厅自然科学基金重点资助项目（KJ2008A033）; 安徽省自然科学基金资助项目（090412261X）

PDF

1171

Abstract:

Proposed in this paper is a shape description and skeleton-graph matching algorithm based on histogram, which takes into consideration the shape variability of objects and adopts the length of skeleton branch as well as the radii of the disks at skeleton points as the features to describe the object shape. In the investigation,first,a method to describe the shape and the skeleton end nodes is presented based on the 2D histogram. Then,an improved optimal subsequence algorithm is proposed for the skeleton-graph matching. The descriptions of shape and skeleton end nodes are invariant to common non-rigid transformation. Experimental results demonstrate that the proposed algorithm can implement the skeleton-graph matching of objects with non-rigid transformations and the high-precision shape retrieval with low computational complexity.

Key words: skeleton, shape description, 2D histogram, matching algorithm