Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Computing deviations from convexity in polygons
Pattern Recognition Letters
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Measuring shape: ellipticity, rectangularity, and triangularity
Machine Vision and Applications
A New Convexity Measure for Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
An approximation of the maximal inscribed convex set of a digital object
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Measuring Elongation from Shape Boundary
Journal of Mathematical Imaging and Vision
Classification of pathological shapes using convexity measures
Pattern Recognition Letters
A Hu moment invariant as a shape circularity measure
Pattern Recognition
Shape elongation from optimal encasing rectangles
Computers & Mathematics with Applications
Measuring Squareness and Orientation of Shapes
Journal of Mathematical Imaging and Vision
ADR shape descriptor - Distance between shape centroids versus shape diameter
Computer Vision and Image Understanding
Computational Aesthetics'08 Proceedings of the Fourth Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
Simple art as abstractions of photographs
Proceedings of the Symposium on Computational Aesthetics
| Hi-index | 0.00 |
A new area-based convexity measure for polygons is described. It has the desirable properties that it is not sensitive to small boundary defects, and it is more symmetric with respect to intrusions and protrusions than other published convexity measures. The measure requires a maximally overlapping convex polygon, and this is efficiently estimated using a genetic algorithm (GA1). A second genetic algorithm (GA2) is then used to fine tune the result. In addition, the convex polygon is used to generate other values, measuring the amount of protrusions and intrusions that a polygon contains. Furthermore, the scheme can be modified to find the convex skull, which yields another new convexity measure. Examples of the measures' application to medical image analysis are shown.