Parts-based 2D shape decomposition by convex hull

被引:0
|
作者
Wan, Lili [1 ]
机构
[1] Beijing Jiaotong Univ, Inst Informat Sci, Beijing 100044, Peoples R China
来源
SMI 2009: IEEE INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDINGS | 2009年
关键词
Shape decomposition; Convex hull; Concavity measurement; POLYHEDRAL SURFACE DECOMPOSITION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Parts-based 2D shape decomposition is important to shape analysis and recognition. Much research in psychology has shown that the human visual system tends to segment complex objects at regions of deep concavities, so concavity measurement is very important to shape decompositions, but it still has not a well accepted definition. In this paper, we propose a method for measuring concavities and segmenting a 2D shape without holes by 2D convex hulls.-The primary motivation for using 2D convex hull in our SLA-concavity (straight line and angle concavity) is to grasp global variation trends of the polygon boundary, and furthermore, determine concave vertexes before computing interior angles for representing local attribute. SLA-concavity is invariant despite the presence of arbitrary translations, rotations and scales after normalizing the polygon by its area. For dealing with over-segmentation, we introduce a decomposition method in order of decreasing concavities, avoiding connection of two vertexes, in the same pocket generated by a convex hull. Experimental results show that our approach has good performance.
引用
收藏
页码:89 / 95
页数:7
相关论文
共 27 条
  • [21] Morphological decomposition of 2-D binary shapes into conditionally maximal convex polygons
    Xu, JN
    PATTERN RECOGNITION, 1996, 29 (07) : 1075 - 1104
  • [22] Shortest paths and convex hulls in 2D complexes withnon-positive curvature
    Lubiw, Anna
    Maftuleac, Daniela
    Owen, Megan
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2020, 89
  • [23] The attractor-wrapping approach to approximating convex hulls of 2D affine IFS attractors
    Martyn, Tomasz
    COMPUTERS & GRAPHICS-UK, 2009, 33 (01): : 104 - 112
  • [24] A new parallel algorithm for finding convex hull based on COW with 2-clusters, 2-domains and 2-directions
    Zhou, Qihai
    Wu, Hongyu
    DCABES 2007 PROCEEDINGS, VOLS I AND II, 2007, : 28 - 32
  • [25] The computation of polygonal approximations for 2D contours based on a concavity tree
    Aguilera-Aguilera, E. J.
    Carmona-Poyato, A.
    Madrid-Cuevas, F. J.
    Medina-Carnicer, R.
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2014, 25 (08) : 1905 - 1917
  • [26] Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach
    El Badawy, O
    Kamel, MS
    PATTERN RECOGNITION LETTERS, 2005, 26 (07) : 865 - 877
  • [27] RETRACTED: A Parallel Dynamic Convex Hull Algorithm based on the M2M model originated from Thinking Pattern of Human Beings (Retracted Article)
    Zhang, Yingpeng
    Chen, Haozhong
    Hu, Shicai
    Wang, Kaige
    Yan, Yannan
    PROCEEDINGS 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, (ICCSIT 2010), VOL 1, 2010, : 359 - 366