Computational geometry: an introduction
Computational geometry: an introduction
Computer-Aided Design
Computing deviations from convexity in polygons
Pattern Recognition Letters
On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
Shape Similarity Measure Based on Correspondence of Visual Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
Shape Analysis and Classification: Theory and Practice
Shape Analysis and Classification: Theory and Practice
Measuring shape: ellipticity, rectangularity, and triangularity
Machine Vision and Applications
Shape partitioning by convexity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A New Convexity Measure Based on a Probabilistic Interpretation of Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Vision and Image Understanding
A two-component rectilinearity measure
Computer Vision and Image Understanding
Measuring Elongation from Shape Boundary
Journal of Mathematical Imaging and Vision
Measuring linearity of planar point sets
Pattern Recognition
A rectilinearity measurement for 3d meshes
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
Classification of pathological shapes using convexity measures
Pattern Recognition Letters
A Hu moment invariant as a shape circularity measure
Pattern Recognition
Measuring linearity of ordered point sets
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
Finding the orthogonal hull of a digital object: a combinatorial approach
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
International Journal of Computer Vision
Shape elongation from optimal encasing rectangles
Computers & Mathematics with Applications
Measuring Squareness and Orientation of Shapes
Journal of Mathematical Imaging and Vision
Articulation-invariant representation of non-planar shapes
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Classification using scale and rotation tolerant shape signatures from convex hulls
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
ADR shape descriptor - Distance between shape centroids versus shape diameter
Computer Vision and Image Understanding
A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane
Information Sciences: an International Journal
Measuring regularity of convex polygons
Computer-Aided Design
Feature-Preserved 3D Canonical Form
International Journal of Computer Vision
| Hi-index | 0.14 |
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.