A new convexity measure for polygons

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 I 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.

[1]  E.E. Pissaloux,et al.  Image Processing , 1994, Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing.

[2]  Jan Flusser,et al.  Pattern recognition by affine moment invariants , 1993, Pattern Recognit..

[3]  Helman I. Stern,et al.  Polygonal entropy: A convexity measure , 1989, Pattern Recognit. Lett..

[4]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[5]  Arthur E. Hawkins,et al.  The shape of powder-particle outlines , 1994 .

[6]  F. Bookstein,et al.  Morphometric Tools for Landmark Data: Geometry and Biology , 1999 .

[7]  A Monograph of the British Desmidiaceae , 1909, Nature.

[8]  Franco P. Preparata,et al.  Sequencing-by-hybridization revisited: the analog-spectrum proposal , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[9]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[10]  Longin Jan Latecki,et al.  Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution , 1999, Comput. Vis. Image Underst..

[11]  G. West,et al.  A monograph of the British Desmidiaceæ, by W. West and G. S. West. , 1904 .

[12]  Jovisa D. Zunic,et al.  On the Maximal Number of Edges of Convex Digital Polygons Included into an m x m -Grid , 1995, J. Comb. Theory A.

[13]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[14]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[15]  Milan Sonka,et al.  Image Processing, Analysis and Machine Vision , 1993, Springer US.

[16]  Horst Bunke,et al.  IDENTIFICATION USING CLASSICAL AND NEW FEATURES IN COMBINATION WITH DECISION TREE ENSEMBLES , 2002 .

[17]  Paul L. Rosin.  Measuring shape: ellipticity, rectangularity, and triangularity , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[18]  Paul L. Rosin.  Shape Partitioning by Convexity , 1999, BMVC.

[19]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[20]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[21]  Ralph R. Martin,et al.  Putting objects into boxes , 1988 .

[22]  Laurence Boxer.  Computing deviations from convexity in polygons , 1993, Pattern Recognit. Lett..

[23]  G. West,et al.  A monograph of the British Desmidiaceæ , 1904 .

[24]  Simon Kasif,et al.  A System for Induction of Oblique Decision Trees , 1994, J. Artif. Intell. Res..

[25]  H. D. Buf,et al.  Automatic diatom identification , 2002 .

[26]  Longin Jan Latecki,et al.  Shape Similarity Measure Based on Correspondence of Visual Parts , 2000, IEEE Trans. Pattern Anal. Mach. Intell..