A new convexity measure for polygons

被引:111
作者
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
相关论文
共 23 条
[1]   ON THE MAXIMAL NUMBER OF EDGES OF CONVEX DIGITAL POLYGONS INCLUDED INTO AN MXM-GRID [J].
ACKETA, DM ;
ZUNIC, JD .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1995, 69 (02) :358-368
[2]  
[Anonymous], 1997, FLATLAND GEOMETRIC F, DOI DOI 10.1016/B978-044481538-5/50005-8
[3]  
[Anonymous], 2016, MED J ISLAM REPUB IR
[4]  
Bookstein F. L., 1997, Morphometric tools for landmark data
[5]   COMPUTING DEVIATIONS FROM CONVEXITY IN POLYGONS [J].
BOXER, L .
PATTERN RECOGNITION LETTERS, 1993, 14 (03) :163-167
[6]  
duBuf J., 2002, AUTOMATIC DIATOM IDE
[7]  
Fischer S., 2002, AUTOMATIC DIATOM IDE, P109
[8]   PATTERN-RECOGNITION BY AFFINE MOMENT INVARIANTS [J].
FLUSSER, J ;
SUK, T .
PATTERN RECOGNITION, 1993, 26 (01) :167-174
[9]   DETERMINING MINIMUM-AREA ENCASING RECTANGLE FOR AN ARBITRARY CLOSED CURVE [J].
FREEMAN, H ;
SHAPIRA, R .
COMMUNICATIONS OF THE ACM, 1975, 18 (07) :409-413
[10]  
Hawkins A.E., 1993, SHAPE POWDER PARTICL