A new convexity measure for polygons

被引:107
|
作者
Zunic, J
Rosin, PL
机构
[1] Univ Exeter, Dept Comp Sci, Exeter EX4 4QF, Devon, England
[2] Serbian Acad Arts & Sci, Math Inst, Belgrade, Serbia
[3] Cardiff Univ, Dept Comp Sci, Queens Bldg,Newport Rd,POB 916, Cardiff CF24 3XF, S Glam, Wales
基金
英国生物技术与生命科学研究理事会;
关键词
shape; polygons; convexity; measurement;
D O I
10.1109/TPAMI.2004.19
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Convexity estimators are commonly used in the analysis of shape. In this paper, we define and evaluate a new convexity measure for planar regions bounded by polygons. The new convexity measure can be understood as a "boundary-based" measure and in accordance with this it is more sensitive to measured boundary defects than the so called "area-based" convexity measures. When compared with the convexity measure defined as the ratio between the Euclidean perimeter of the convex hull of the measured shape and the Euclidean perimeter of the measured shape then the new convexity measure also shows some advantages-particularly for shapes with holes. The new convexity measure has the following desirable properties: 1) the estimated convexity is always a number from (0, 1] 2) the estimated convexity is 1 if and only if the measured shape is convex, 3) there are shapes whose estimated convexity is arbitrarily close to 0, 4) the new convexity measure is invariant under similarity transformations, and 5) there is a simple and fast procedure for computing the new convexity measure.
引用
收藏
页码:923 / 934
页数:12
相关论文
共 50 条
  • [1] Leaf Classification Using Convexity Measure of Polygons
    Kala, Jules Raymond
    Viriri, Serestina
    Moodley, Deshendran
    Tapamo, Jules Raymond
    IMAGE AND SIGNAL PROCESSING (ICISP 2016), 2016, 9680 : 51 - 60
  • [2] A new measure for the rectilinearity of polygons
    Zunic, J
    Rosin, PL
    VISION GEOMETRY XI, 2002, 4794 : 81 - 91
  • [3] Global convexity of curves and polygons
    Carnicer, JM
    Garcia-Esnaola, M
    COMPUTER AIDED GEOMETRIC DESIGN, 1998, 15 (09) : 893 - 907
  • [4] ALGORITHMS FOR TESTING CONVEXITY OF DIGITAL POLYGONS
    KLETTE, R
    KRISHNAMURTHY, EV
    COMPUTER GRAPHICS AND IMAGE PROCESSING, 1981, 16 (02): : 177 - 184
  • [5] POLYGONS AS OPTIMAL SHAPES WITH CONVEXITY CONSTRAINT
    Lamboley, Jimmy
    Novruzi, Arian
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2009, 48 (05) : 3003 - 3025
  • [6] COMPUTING DEVIATIONS FROM CONVEXITY IN POLYGONS
    BOXER, L
    PATTERN RECOGNITION LETTERS, 1993, 14 (03) : 163 - 167
  • [7] DIGITAL CONVEXITY, STRAIGHTNESS, AND CONVEX POLYGONS
    KIM, CE
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1982, 4 (06) : 618 - 626
  • [8] Measuring Convexity via Convex Polygons
    Rosin, Paul L.
    Zunic, Jovisa
    IMAGE AND VIDEO TECHNOLOGY - PSIVT 2015 WORKSHOPS, 2016, 9555 : 38 - 47
  • [9] STARLIKENESS AND CONVEXITY OF CAUCHY TRANSFORMS ON REGULAR POLYGONS
    Zhang, Peng-Fei
    Dong, Xin-Han
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2021, 103 (02) : 291 - 302
  • [10] A new convexity measure based on a probabilistic interpretation of images
    Rahtu, Esa
    Salo, Mikko
    Heikkila, Janne
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (09) : 1501 - 1512